/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:03:51,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:03:51,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:03:51,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:03:51,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:03:51,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:03:51,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:03:51,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:03:51,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:03:51,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:03:51,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:03:51,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:03:51,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:03:51,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:03:51,885 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:03:51,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:03:51,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:03:51,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:03:51,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:03:51,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:03:51,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:03:51,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:03:51,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:03:51,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:03:51,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:03:51,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:03:51,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:03:51,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:03:51,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:03:51,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:03:51,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:03:51,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:03:51,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:03:51,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:03:51,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:03:51,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:03:51,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:03:51,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:03:51,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:03:51,906 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:03:51,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:03:51,907 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:03:51,921 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:03:51,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:03:51,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:03:51,923 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:03:51,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:03:51,923 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:03:51,923 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:03:51,924 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:03:51,924 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:03:51,924 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:03:51,924 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:03:51,924 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:03:51,925 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:03:51,925 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:03:51,925 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:03:51,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:03:51,925 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:03:51,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:03:51,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:03:51,926 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:03:51,926 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:03:51,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:03:51,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:03:51,926 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:03:51,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:03:51,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:03:51,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:03:51,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:03:51,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:03:52,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:03:52,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:03:52,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:03:52,116 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:03:52,116 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:03:52,117 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:03:52,182 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_gLleXq/tmp/f072345bb2684f859e04b8f192aacdcd/FLAGa39e41753 [2020-07-01 13:03:52,524 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:03:52,524 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:03:52,525 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:03:52,531 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_gLleXq/tmp/f072345bb2684f859e04b8f192aacdcd/FLAGa39e41753 [2020-07-01 13:03:52,929 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_gLleXq/tmp/f072345bb2684f859e04b8f192aacdcd [2020-07-01 13:03:52,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:03:52,942 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:03:52,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:03:52,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:03:52,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:03:52,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:03:52" (1/1) ... [2020-07-01 13:03:52,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d3453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:52, skipping insertion in model container [2020-07-01 13:03:52,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:03:52" (1/1) ... [2020-07-01 13:03:52,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:03:52,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:03:53,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:03:53,223 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:03:53,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:03:53,257 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:03:53,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53 WrapperNode [2020-07-01 13:03:53,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:03:53,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:03:53,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:03:53,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:03:53,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:03:53,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:03:53,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:03:53,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:03:53,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:03:53,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:03:53,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:03:53,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:03:53,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:03:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:03:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:03:53,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:03:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:03:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:03:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:03:53,646 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:03:53,646 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:03:53,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:53 BoogieIcfgContainer [2020-07-01 13:03:53,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:03:53,651 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:03:53,651 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:03:53,653 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:03:53,653 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:53" (1/1) ... [2020-07-01 13:03:53,669 INFO L313 BlockEncoder]: Initial Icfg 26 locations, 29 edges [2020-07-01 13:03:53,670 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:03:53,671 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:03:53,671 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:03:53,672 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:03:53,674 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:03:53,675 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:03:53,675 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:03:53,702 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:03:53,728 INFO L200 BlockEncoder]: SBE split 12 edges [2020-07-01 13:03:53,733 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:03:53,734 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:03:53,763 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 13:03:53,765 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:03:53,767 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:03:53,767 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:03:53,767 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:03:53,768 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:03:53,768 INFO L313 BlockEncoder]: Encoded RCFG 19 locations, 35 edges [2020-07-01 13:03:53,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:03:53 BasicIcfg [2020-07-01 13:03:53,769 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:03:53,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:03:53,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:03:53,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:03:53,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:03:52" (1/4) ... [2020-07-01 13:03:53,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1726f895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:03:53, skipping insertion in model container [2020-07-01 13:03:53,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (2/4) ... [2020-07-01 13:03:53,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1726f895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:03:53, skipping insertion in model container [2020-07-01 13:03:53,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:53" (3/4) ... [2020-07-01 13:03:53,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1726f895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:03:53, skipping insertion in model container [2020-07-01 13:03:53,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:03:53" (4/4) ... [2020-07-01 13:03:53,778 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:03:53,788 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:03:53,796 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-01 13:03:53,810 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-01 13:03:53,833 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:03:53,833 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:03:53,834 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:03:53,834 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:03:53,834 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:03:53,834 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:03:53,834 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:03:53,834 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:03:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-01 13:03:53,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:03:53,855 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:53,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:03:53,857 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:03:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:53,863 INFO L82 PathProgramCache]: Analyzing trace with hash 4470606, now seen corresponding path program 1 times [2020-07-01 13:03:53,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:53,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601665002] [2020-07-01 13:03:53,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601665002] [2020-07-01 13:03:54,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:03:54,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880224817] [2020-07-01 13:03:54,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:03:54,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:03:54,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:03:54,068 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 4 states. [2020-07-01 13:03:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:54,159 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2020-07-01 13:03:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:03:54,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 13:03:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:54,174 INFO L225 Difference]: With dead ends: 20 [2020-07-01 13:03:54,174 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 13:03:54,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:03:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 13:03:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 13:03:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:03:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2020-07-01 13:03:54,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 4 [2020-07-01 13:03:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:54,216 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 34 transitions. [2020-07-01 13:03:54,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:03:54,216 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. [2020-07-01 13:03:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:03:54,216 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:54,216 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:03:54,218 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:03:54,218 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:03:54,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:54,219 INFO L82 PathProgramCache]: Analyzing trace with hash 4470603, now seen corresponding path program 1 times [2020-07-01 13:03:54,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:54,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878986260] [2020-07-01 13:03:54,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878986260] [2020-07-01 13:03:54,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:54,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325972492] [2020-07-01 13:03:54,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:54,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:54,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,247 INFO L87 Difference]: Start difference. First operand 19 states and 34 transitions. Second operand 3 states. [2020-07-01 13:03:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:54,330 INFO L93 Difference]: Finished difference Result 19 states and 34 transitions. [2020-07-01 13:03:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:54,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:03:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:54,331 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:03:54,331 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 13:03:54,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 13:03:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 13:03:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 13:03:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2020-07-01 13:03:54,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 32 transitions. Word has length 4 [2020-07-01 13:03:54,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:54,337 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 32 transitions. [2020-07-01 13:03:54,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 32 transitions. [2020-07-01 13:03:54,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:03:54,338 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:54,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:03:54,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:03:54,338 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:03:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 4470605, now seen corresponding path program 1 times [2020-07-01 13:03:54,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:54,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836576531] [2020-07-01 13:03:54,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,370 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836576531] [2020-07-01 13:03:54,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:03:54,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405268535] [2020-07-01 13:03:54,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:03:54,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:03:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,372 INFO L87 Difference]: Start difference. First operand 18 states and 32 transitions. Second operand 3 states. [2020-07-01 13:03:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:54,427 INFO L93 Difference]: Finished difference Result 18 states and 32 transitions. [2020-07-01 13:03:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:03:54,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:03:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:54,428 INFO L225 Difference]: With dead ends: 18 [2020-07-01 13:03:54,429 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 13:03:54,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:03:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 13:03:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 13:03:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 13:03:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2020-07-01 13:03:54,433 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 4 [2020-07-01 13:03:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:54,433 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2020-07-01 13:03:54,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:03:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2020-07-01 13:03:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:03:54,434 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:54,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:03:54,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:03:54,434 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:03:54,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:54,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1258387, now seen corresponding path program 1 times [2020-07-01 13:03:54,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:54,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663955253] [2020-07-01 13:03:54,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663955253] [2020-07-01 13:03:54,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:03:54,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381800958] [2020-07-01 13:03:54,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:03:54,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:03:54,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:03:54,477 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 4 states. [2020-07-01 13:03:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:54,561 INFO L93 Difference]: Finished difference Result 17 states and 31 transitions. [2020-07-01 13:03:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:03:54,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 13:03:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:54,562 INFO L225 Difference]: With dead ends: 17 [2020-07-01 13:03:54,562 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 13:03:54,563 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:03:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 13:03:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 13:03:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 13:03:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2020-07-01 13:03:54,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 6 [2020-07-01 13:03:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:54,566 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2020-07-01 13:03:54,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:03:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2020-07-01 13:03:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:03:54,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:54,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:03:54,567 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:03:54,567 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:03:54,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:54,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1258389, now seen corresponding path program 1 times [2020-07-01 13:03:54,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:54,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152189522] [2020-07-01 13:03:54,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152189522] [2020-07-01 13:03:54,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 13:03:54,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294668708] [2020-07-01 13:03:54,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:03:54,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:03:54,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:03:54,646 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2020-07-01 13:03:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:54,756 INFO L93 Difference]: Finished difference Result 23 states and 40 transitions. [2020-07-01 13:03:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:03:54,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2020-07-01 13:03:54,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:54,758 INFO L225 Difference]: With dead ends: 23 [2020-07-01 13:03:54,758 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 13:03:54,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:03:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 13:03:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-01 13:03:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:03:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2020-07-01 13:03:54,773 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 33 transitions. Word has length 6 [2020-07-01 13:03:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:54,774 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 33 transitions. [2020-07-01 13:03:54,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:03:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 33 transitions. [2020-07-01 13:03:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:03:54,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:54,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:03:54,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:03:54,775 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:03:54,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:54,776 INFO L82 PathProgramCache]: Analyzing trace with hash -938260353, now seen corresponding path program 1 times [2020-07-01 13:03:54,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:54,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127390692] [2020-07-01 13:03:54,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:54,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127390692] [2020-07-01 13:03:54,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:03:54,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 13:03:54,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272382623] [2020-07-01 13:03:54,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 13:03:54,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:54,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 13:03:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:03:54,915 INFO L87 Difference]: Start difference. First operand 19 states and 33 transitions. Second operand 7 states. [2020-07-01 13:03:55,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:03:55,083 INFO L93 Difference]: Finished difference Result 36 states and 63 transitions. [2020-07-01 13:03:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 13:03:55,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-01 13:03:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:03:55,084 INFO L225 Difference]: With dead ends: 36 [2020-07-01 13:03:55,084 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 13:03:55,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 13:03:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 13:03:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 13:03:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:03:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 32 transitions. [2020-07-01 13:03:55,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 32 transitions. Word has length 11 [2020-07-01 13:03:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:03:55,089 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 32 transitions. [2020-07-01 13:03:55,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 13:03:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 32 transitions. [2020-07-01 13:03:55,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:03:55,090 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:03:55,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:03:55,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:03:55,090 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:03:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:03:55,090 INFO L82 PathProgramCache]: Analyzing trace with hash 15977358, now seen corresponding path program 1 times [2020-07-01 13:03:55,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:03:55,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863316427] [2020-07-01 13:03:55,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:03:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:55,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863316427] [2020-07-01 13:03:55,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12428850] [2020-07-01 13:03:55,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:03:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:03:55,354 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-01 13:03:55,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:03:55,390 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:03:55,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 13:03:55,437 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:03:55,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 13:03:55,443 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:03:55,457 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:03:55,459 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-07-01 13:03:55,459 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2020-07-01 13:03:55,503 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:03:55,669 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:03:55,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2020-07-01 13:03:55,671 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:03:55,672 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:03:55,686 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:03:55,687 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:03:55,691 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:03:55,691 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:35 [2020-07-01 13:03:55,752 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:03:55,754 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:03:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:03:55,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:03:55,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-01 13:03:55,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194206875] [2020-07-01 13:03:55,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 13:03:55,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:03:55,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 13:03:55,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:03:55,782 INFO L87 Difference]: Start difference. First operand 19 states and 32 transitions. Second operand 13 states. [2020-07-01 13:03:56,161 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2020-07-01 13:03:59,825 WARN L192 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-07-01 13:04:01,461 WARN L192 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-07-01 13:04:02,968 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-07-01 13:04:06,039 WARN L192 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2020-07-01 13:04:08,307 WARN L192 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2020-07-01 13:04:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:14,054 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2020-07-01 13:04:14,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-01 13:04:14,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2020-07-01 13:04:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:14,056 INFO L225 Difference]: With dead ends: 53 [2020-07-01 13:04:14,056 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 13:04:14,057 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=200, Invalid=450, Unknown=0, NotChecked=0, Total=650 [2020-07-01 13:04:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 13:04:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 21. [2020-07-01 13:04:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 13:04:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-07-01 13:04:14,063 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 33 transitions. Word has length 11 [2020-07-01 13:04:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:14,063 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-07-01 13:04:14,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 13:04:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2020-07-01 13:04:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 13:04:14,064 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:14,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:04:14,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-01 13:04:14,266 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:04:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 15977359, now seen corresponding path program 1 times [2020-07-01 13:04:14,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:14,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490816171] [2020-07-01 13:04:14,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:14,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490816171] [2020-07-01 13:04:14,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854795732] [2020-07-01 13:04:14,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:14,340 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:04:14,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:04:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:14,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:04:14,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 13:04:14,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589200678] [2020-07-01 13:04:14,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:04:14,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:14,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:04:14,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:04:14,352 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. Second operand 4 states. [2020-07-01 13:04:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:14,424 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2020-07-01 13:04:14,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:04:14,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 13:04:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:14,427 INFO L225 Difference]: With dead ends: 22 [2020-07-01 13:04:14,427 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 13:04:14,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:04:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 13:04:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 13:04:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:04:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2020-07-01 13:04:14,432 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 11 [2020-07-01 13:04:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:14,432 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2020-07-01 13:04:14,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:04:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2020-07-01 13:04:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 13:04:14,433 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:14,433 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 13:04:14,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:14,634 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:04:14,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1478507482, now seen corresponding path program 2 times [2020-07-01 13:04:14,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:14,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280105070] [2020-07-01 13:04:14,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:14,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280105070] [2020-07-01 13:04:14,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792139989] [2020-07-01 13:04:14,864 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:14,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:04:14,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:04:14,904 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-01 13:04:14,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:04:14,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 13:04:14,913 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:04:14,916 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:04:14,917 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:04:14,917 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 13:04:14,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 13:04:14,935 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:04:14,941 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:04:14,941 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:04:14,942 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 13:04:15,061 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:04:15,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 13:04:15,063 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:04:15,063 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:04:15,079 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:04:15,080 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:04:15,082 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 13:04:15,082 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:31 [2020-07-01 13:04:15,133 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:04:15,134 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:04:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:04:15,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:04:15,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-01 13:04:15,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855224995] [2020-07-01 13:04:15,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 13:04:15,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 13:04:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-07-01 13:04:15,164 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand 15 states. [2020-07-01 13:04:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:17,108 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2020-07-01 13:04:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-07-01 13:04:17,108 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2020-07-01 13:04:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:17,109 INFO L225 Difference]: With dead ends: 71 [2020-07-01 13:04:17,110 INFO L226 Difference]: Without dead ends: 70 [2020-07-01 13:04:17,111 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=450, Invalid=1272, Unknown=0, NotChecked=0, Total=1722 [2020-07-01 13:04:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-01 13:04:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 43. [2020-07-01 13:04:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 13:04:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2020-07-01 13:04:17,121 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 16 [2020-07-01 13:04:17,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:17,121 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2020-07-01 13:04:17,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 13:04:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2020-07-01 13:04:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-01 13:04:17,122 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:04:17,122 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:04:17,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:17,323 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 13:04:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash -787519795, now seen corresponding path program 1 times [2020-07-01 13:04:17,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:17,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007511338] [2020-07-01 13:04:17,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-01 13:04:17,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007511338] [2020-07-01 13:04:17,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59248897] [2020-07-01 13:04:17,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:17,486 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 13:04:17,488 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:04:17,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 13:04:17,495 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:04:17,501 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:04:17,501 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:04:17,501 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 13:04:17,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 13:04:17,509 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:04:17,512 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:04:17,512 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:04:17,512 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 13:04:17,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:04:17,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 13:04:17,546 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:04:17,547 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:04:17,563 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:04:17,564 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:04:17,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 13:04:17,590 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:04:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 13:04:17,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:04:17,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-07-01 13:04:17,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295223941] [2020-07-01 13:04:17,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 13:04:17,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:17,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 13:04:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-01 13:04:17,607 INFO L87 Difference]: Start difference. First operand 43 states and 66 transitions. Second operand 11 states. [2020-07-01 13:04:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:17,777 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2020-07-01 13:04:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 13:04:17,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-07-01 13:04:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:04:17,778 INFO L225 Difference]: With dead ends: 43 [2020-07-01 13:04:17,778 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:04:17,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-07-01 13:04:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:04:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:04:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:04:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:04:17,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2020-07-01 13:04:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:04:17,780 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:04:17,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 13:04:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:04:17,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:04:17,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:04:17,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:04:18,626 WARN L192 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 46 [2020-07-01 13:04:18,630 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-01 13:04:18,630 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-07-01 13:04:18,630 INFO L268 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2020-07-01 13:04:18,630 INFO L268 CegarLoopResult]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2020-07-01 13:04:18,630 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:04:18,631 INFO L268 CegarLoopResult]: For program point L9-1(lines 9 15) no Hoare annotation was computed. [2020-07-01 13:04:18,631 INFO L264 CegarLoopResult]: At program point L9-3(lines 9 15) the Hoare annotation is: (let ((.cse7 (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base)) (.cse1 (select |#memory_int| ULTIMATE.start_cstrreplace_~p~0.base)) (.cse9 (select |#length| ULTIMATE.start_cstrreplace_~p~0.base)) (.cse12 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (= .cse12 ULTIMATE.start_main_~length1~0)) (.cse2 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse10 (= 0 (select .cse1 (+ .cse9 (- 1))))) (.cse3 (<= 1 .cse9)) (.cse11 (= 0 (select .cse7 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse12 (- 1))))) (.cse4 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse5 (= 0 ULTIMATE.start_cstrreplace_~p~0.offset)) (.cse6 (= 1 (select |#valid| ULTIMATE.start_cstrreplace_~p~0.base))) (.cse8 (<= (+ ULTIMATE.start_main_~nondetString1~0.offset 1) .cse12))) (or (and .cse0 (= 0 (select .cse1 ULTIMATE.start_cstrreplace_~p~0.offset)) .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_main_~length1~0 1) .cse6 (= 0 (select .cse7 ULTIMATE.start_main_~nondetString1~0.offset)) .cse8) (and (<= (+ ULTIMATE.start_cstrreplace_~p~0.offset 1) .cse9) (<= 1 ULTIMATE.start_cstrreplace_~p~0.offset) .cse0 .cse2 .cse10 .cse11 .cse4 .cse6 .cse8) (and .cse0 .cse2 .cse10 .cse3 .cse11 .cse4 .cse5 .cse6 .cse8)))) [2020-07-01 13:04:18,631 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:04:18,631 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:04:18,631 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:04:18,631 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:04:18,632 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:04:18,632 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:04:18,632 INFO L268 CegarLoopResult]: For program point L10-1(lines 10 13) no Hoare annotation was computed. [2020-07-01 13:04:18,632 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:04:18,632 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:04:18,632 INFO L268 CegarLoopResult]: For program point L10-3(lines 10 13) no Hoare annotation was computed. [2020-07-01 13:04:18,632 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:04:18,632 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:04:18,635 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:04:18,646 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,647 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,652 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:04:18 BasicIcfg [2020-07-01 13:04:18,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:04:18,669 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:04:18,669 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:04:18,673 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:04:18,674 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:18,674 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:03:52" (1/5) ... [2020-07-01 13:04:18,675 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a332725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:04:18, skipping insertion in model container [2020-07-01 13:04:18,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:18,675 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:03:53" (2/5) ... [2020-07-01 13:04:18,675 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a332725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:04:18, skipping insertion in model container [2020-07-01 13:04:18,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:18,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:03:53" (3/5) ... [2020-07-01 13:04:18,676 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a332725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:04:18, skipping insertion in model container [2020-07-01 13:04:18,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:18,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:03:53" (4/5) ... [2020-07-01 13:04:18,676 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a332725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:04:18, skipping insertion in model container [2020-07-01 13:04:18,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:04:18,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:04:18" (5/5) ... [2020-07-01 13:04:18,678 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:04:18,701 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:04:18,701 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:04:18,701 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:04:18,701 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:04:18,701 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:04:18,701 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:04:18,701 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:04:18,701 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:04:18,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-01 13:04:18,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 13:04:18,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:04:18,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:04:18,715 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:18,715 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:18,715 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:04:18,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-01 13:04:18,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 13:04:18,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:04:18,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:04:18,717 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:18,717 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 13:04:18,722 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [117] ULTIMATE.startENTRY-->L21: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_15| (store |v_#valid_16| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_5|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_4|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_4|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_#t~ret8=|v_ULTIMATE.start_main_#t~ret8_4|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~nondet7, #NULL.base, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~ret8, ULTIMATE.start_main_#t~malloc5.offset] 15#L21true [78] L21-->L21-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 9#L21-2true [92] L21-2-->L25: Formula: (and (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc5.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc5.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (> 0 |v_ULTIMATE.start_main_#t~malloc5.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc5.base_2|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_2|, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_#t~malloc5.offset] 21#L25true [65] L25-->L25-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= 1 .cse0))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 20#L25-1true [100] L25-1-->L9-3: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~nondet7_2| 256)) (.cse1 (mod |v_ULTIMATE.start_main_#t~nondet6_2| 256))) (and (= v_ULTIMATE.start_cstrreplace_~s.base_1 |v_ULTIMATE.start_cstrreplace_#in~s.base_1|) (= v_ULTIMATE.start_cstrreplace_~old_1 |v_ULTIMATE.start_cstrreplace_#in~old_1|) (= |v_ULTIMATE.start_cstrreplace_#in~s.offset_1| v_ULTIMATE.start_main_~nondetString1~0.offset_5) (= v_ULTIMATE.start_cstrreplace_~p~0.base_1 v_ULTIMATE.start_cstrreplace_~s.base_1) (= v_ULTIMATE.start_cstrreplace_~new_1 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= v_ULTIMATE.start_cstrreplace_~p~0.offset_1 v_ULTIMATE.start_cstrreplace_~s.offset_1) (= |v_ULTIMATE.start_cstrreplace_#in~s.base_1| v_ULTIMATE.start_main_~nondetString1~0.base_6) (<= .cse0 127) (= v_ULTIMATE.start_cstrreplace_~s.offset_1 |v_ULTIMATE.start_cstrreplace_#in~s.offset_1|) (= .cse0 |v_ULTIMATE.start_cstrreplace_#in~new_1|) (= |v_ULTIMATE.start_cstrreplace_#in~old_1| .cse1) (= v_ULTIMATE.start_cstrreplace_~numReplaced~0_1 0) (<= .cse1 127))) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_1, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_2|, ULTIMATE.start_cstrreplace_#in~old=|v_ULTIMATE.start_cstrreplace_#in~old_1|, ULTIMATE.start_cstrreplace_#res=|v_ULTIMATE.start_cstrreplace_#res_1|, ULTIMATE.start_main_#t~nondet7=|v_ULTIMATE.start_main_#t~nondet7_2|, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_1, ULTIMATE.start_cstrreplace_~numReplaced~0=v_ULTIMATE.start_cstrreplace_~numReplaced~0_1, ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_1|, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_1|, ULTIMATE.start_cstrreplace_~s.base=v_ULTIMATE.start_cstrreplace_~s.base_1, ULTIMATE.start_cstrreplace_~new=v_ULTIMATE.start_cstrreplace_~new_1, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_1|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_6, ULTIMATE.start_cstrreplace_#in~s.offset=|v_ULTIMATE.start_cstrreplace_#in~s.offset_1|, ULTIMATE.start_cstrreplace_#in~s.base=|v_ULTIMATE.start_cstrreplace_#in~s.base_1|, ULTIMATE.start_cstrreplace_#t~post2=|v_ULTIMATE.start_cstrreplace_#t~post2_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_5, ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_1|, ULTIMATE.start_cstrreplace_~s.offset=v_ULTIMATE.start_cstrreplace_~s.offset_1, ULTIMATE.start_cstrreplace_#in~new=|v_ULTIMATE.start_cstrreplace_#in~new_1|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_~old, ULTIMATE.start_cstrreplace_#in~old, ULTIMATE.start_cstrreplace_#res, ULTIMATE.start_cstrreplace_~p~0.offset, ULTIMATE.start_cstrreplace_~numReplaced~0, ULTIMATE.start_cstrreplace_#t~mem0, ULTIMATE.start_cstrreplace_#t~mem1, ULTIMATE.start_cstrreplace_~s.base, ULTIMATE.start_cstrreplace_~new, ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#in~s.offset, ULTIMATE.start_cstrreplace_#in~s.base, ULTIMATE.start_cstrreplace_#t~post2, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~s.offset, ULTIMATE.start_cstrreplace_#in~new, ULTIMATE.start_cstrreplace_~p~0.base] 5#L9-3true [2020-07-01 13:04:18,723 INFO L796 eck$LassoCheckResult]: Loop: 5#L9-3true [52] L9-3-->L9-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrreplace_~p~0.base_3)) (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrreplace_~p~0.base_3) v_ULTIMATE.start_cstrreplace_~p~0.offset_3) |v_ULTIMATE.start_cstrreplace_#t~mem0_2|)) InVars {#memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_2|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_3, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 8#L9-1true [105] L9-1-->L10: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem0_6| 0) InVars {ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_6|} OutVars{ULTIMATE.start_cstrreplace_#t~mem0=|v_ULTIMATE.start_cstrreplace_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem0] 14#L10true [58] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrreplace_~p~0.offset_5) (= 1 (select |v_#valid_9| v_ULTIMATE.start_cstrreplace_~p~0.base_6)) (= |v_ULTIMATE.start_cstrreplace_#t~mem1_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_cstrreplace_~p~0.base_6) v_ULTIMATE.start_cstrreplace_~p~0.offset_5)) (<= (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_5 1) (select |v_#length_7| v_ULTIMATE.start_cstrreplace_~p~0.base_6))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_2|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_6, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 11#L10-1true [112] L10-1-->L10-3: Formula: (< |v_ULTIMATE.start_cstrreplace_#t~mem1_6| v_ULTIMATE.start_cstrreplace_~old_4) InVars {ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_6|} OutVars{ULTIMATE.start_cstrreplace_~old=v_ULTIMATE.start_cstrreplace_~old_4, ULTIMATE.start_cstrreplace_#t~mem1=|v_ULTIMATE.start_cstrreplace_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~mem1] 6#L10-3true [69] L10-3-->L9-3: Formula: (and (= v_ULTIMATE.start_cstrreplace_~p~0.offset_9 (+ v_ULTIMATE.start_cstrreplace_~p~0.offset_10 1)) (= v_ULTIMATE.start_cstrreplace_~p~0.base_12 v_ULTIMATE.start_cstrreplace_~p~0.base_13)) InVars {ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_10, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_13} OutVars{ULTIMATE.start_cstrreplace_#t~post3.base=|v_ULTIMATE.start_cstrreplace_#t~post3.base_2|, ULTIMATE.start_cstrreplace_#t~post3.offset=|v_ULTIMATE.start_cstrreplace_#t~post3.offset_2|, ULTIMATE.start_cstrreplace_~p~0.base=v_ULTIMATE.start_cstrreplace_~p~0.base_12, ULTIMATE.start_cstrreplace_~p~0.offset=v_ULTIMATE.start_cstrreplace_~p~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_cstrreplace_#t~post3.offset, ULTIMATE.start_cstrreplace_#t~post3.base, ULTIMATE.start_cstrreplace_~p~0.base, ULTIMATE.start_cstrreplace_~p~0.offset] 5#L9-3true [2020-07-01 13:04:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash 139095333, now seen corresponding path program 1 times [2020-07-01 13:04:18,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:18,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515618179] [2020-07-01 13:04:18,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:04:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:04:18,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515618179] [2020-07-01 13:04:18,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:04:18,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:04:18,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761457723] [2020-07-01 13:04:18,754 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:04:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:04:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash 79839577, now seen corresponding path program 1 times [2020-07-01 13:04:18,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:04:18,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307105670] [2020-07-01 13:04:18,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:04:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:04:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:04:18,780 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:04:18,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:04:18,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:04:18,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:04:18,821 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-07-01 13:04:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:04:18,852 INFO L93 Difference]: Finished difference Result 19 states and 34 transitions. [2020-07-01 13:04:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:04:18,855 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:04:18,859 INFO L168 Benchmark]: Toolchain (without parser) took 25917.11 ms. Allocated memory was 514.9 MB in the beginning and 654.8 MB in the end (delta: 140.0 MB). Free memory was 438.9 MB in the beginning and 607.2 MB in the end (delta: -168.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:04:18,859 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:04:18,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.93 ms. Allocated memory was 514.9 MB in the beginning and 558.4 MB in the end (delta: 43.5 MB). Free memory was 438.3 MB in the beginning and 525.2 MB in the end (delta: -86.9 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:18,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.93 ms. Allocated memory is still 558.4 MB. Free memory was 524.6 MB in the beginning and 523.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:18,861 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 ms. Allocated memory is still 558.4 MB. Free memory was 523.0 MB in the beginning and 521.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:18,861 INFO L168 Benchmark]: RCFGBuilder took 324.77 ms. Allocated memory is still 558.4 MB. Free memory was 521.4 MB in the beginning and 502.2 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:18,861 INFO L168 Benchmark]: BlockEncodingV2 took 118.37 ms. Allocated memory is still 558.4 MB. Free memory was 502.2 MB in the beginning and 494.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:18,862 INFO L168 Benchmark]: TraceAbstraction took 24898.13 ms. Allocated memory was 558.4 MB in the beginning and 654.8 MB in the end (delta: 96.5 MB). Free memory was 493.5 MB in the beginning and 397.4 MB in the end (delta: 96.1 MB). Peak memory consumption was 192.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:04:18,862 INFO L168 Benchmark]: BuchiAutomizer took 188.26 ms. Allocated memory is still 654.8 MB. Free memory was 397.4 MB in the beginning and 607.2 MB in the end (delta: -209.7 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:04:18,865 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 26 locations, 29 edges - StatisticsResult: Encoded RCFG 19 locations, 35 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 314.93 ms. Allocated memory was 514.9 MB in the beginning and 558.4 MB in the end (delta: 43.5 MB). Free memory was 438.3 MB in the beginning and 525.2 MB in the end (delta: -86.9 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.93 ms. Allocated memory is still 558.4 MB. Free memory was 524.6 MB in the beginning and 523.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.50 ms. Allocated memory is still 558.4 MB. Free memory was 523.0 MB in the beginning and 521.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 324.77 ms. Allocated memory is still 558.4 MB. Free memory was 521.4 MB in the beginning and 502.2 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 118.37 ms. Allocated memory is still 558.4 MB. Free memory was 502.2 MB in the beginning and 494.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 24898.13 ms. Allocated memory was 558.4 MB in the beginning and 654.8 MB in the end (delta: 96.5 MB). Free memory was 493.5 MB in the beginning and 397.4 MB in the end (delta: 96.1 MB). Peak memory consumption was 192.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 188.26 ms. Allocated memory is still 654.8 MB. Free memory was 397.4 MB in the beginning and 607.2 MB in the end (delta: -209.7 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-07-01 13:04:18,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,876 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,877 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,878 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,879 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:04:18,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:04:18,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == unknown-#memory_int-unknown[p][p]) && 0 == nondetString1) && 1 <= unknown-#length-unknown[p]) && 1 == \valid[nondetString1]) && 0 == p) && length1 <= 1) && 1 == \valid[p]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) || ((((((((p + 1 <= unknown-#length-unknown[p] && 1 <= p) && unknown-#length-unknown[nondetString1] == length1) && 0 == nondetString1) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && 1 == \valid[nondetString1]) && 1 == \valid[p]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1])) || ((((((((unknown-#length-unknown[nondetString1] == length1 && 0 == nondetString1) && 0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1]) && 1 <= unknown-#length-unknown[p]) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && 1 == \valid[nondetString1]) && 0 == p) && 1 == \valid[p]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 24.1s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 36 SDtfs, 859 SDslu, 165 SDs, 0 SdLazy, 707 SolverSat, 357 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 9 NumberOfFragments, 168 HoareAnnotationTreeSize, 1 FomulaSimplifications, 750 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 2512 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 139 ConstructedInterpolants, 15 QuantifiedInterpolants, 20272 SizeOfPredicates, 31 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 17/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:03:49.688 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_gLleXq/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:04:19.111 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check