./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test25-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test25-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5d33db1882917813547794c8974f871f0a78640e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:53:24,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:53:24,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:53:24,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:53:24,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:53:24,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:53:24,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:53:24,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:53:24,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:53:24,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:53:24,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:53:24,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:53:24,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:53:24,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:53:24,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:53:24,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:53:24,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:53:24,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:53:24,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:53:24,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:53:24,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:53:24,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:53:24,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:53:24,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:53:24,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:53:24,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:53:24,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:53:24,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:53:24,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:53:24,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:53:24,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:53:24,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:53:24,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:53:24,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:53:24,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:53:24,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:53:24,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:53:24,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:53:24,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:53:24,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:53:24,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:53:24,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:53:25,024 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:53:25,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:53:25,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:53:25,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:53:25,027 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:53:25,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:53:25,027 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:53:25,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:53:25,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:53:25,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:53:25,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:53:25,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:53:25,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:53:25,030 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:53:25,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:53:25,030 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:53:25,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:53:25,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:53:25,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:53:25,031 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:53:25,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:53:25,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:53:25,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:53:25,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:53:25,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:53:25,033 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:53:25,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:53:25,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:53:25,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5d33db1882917813547794c8974f871f0a78640e [2019-11-27 23:53:25,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:53:25,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:53:25,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:53:25,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:53:25,370 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:53:25,371 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test25-2.c [2019-11-27 23:53:25,467 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275992db0/07f64618dfdb4250a063fb9b2dc16287/FLAG0f45729ef [2019-11-27 23:53:25,945 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:53:25,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test25-2.c [2019-11-27 23:53:25,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275992db0/07f64618dfdb4250a063fb9b2dc16287/FLAG0f45729ef [2019-11-27 23:53:26,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275992db0/07f64618dfdb4250a063fb9b2dc16287 [2019-11-27 23:53:26,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:53:26,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:53:26,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:26,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:53:26,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:53:26,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e301d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26, skipping insertion in model container [2019-11-27 23:53:26,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:53:26,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:53:26,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:26,570 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:53:26,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:26,606 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:53:26,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26 WrapperNode [2019-11-27 23:53:26,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:26,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:26,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:53:26,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:53:26,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:26,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:53:26,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:53:26,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:53:26,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... [2019-11-27 23:53:26,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:53:26,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:53:26,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:53:26,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:53:26,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:53:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:53:26,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:53:26,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:53:26,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:53:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:53:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:53:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:53:26,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:53:27,141 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:53:27,142 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-27 23:53:27,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:27 BoogieIcfgContainer [2019-11-27 23:53:27,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:53:27,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:53:27,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:53:27,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:53:27,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:53:26" (1/3) ... [2019-11-27 23:53:27,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75256d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:27, skipping insertion in model container [2019-11-27 23:53:27,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:26" (2/3) ... [2019-11-27 23:53:27,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75256d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:27, skipping insertion in model container [2019-11-27 23:53:27,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:27" (3/3) ... [2019-11-27 23:53:27,152 INFO L109 eAbstractionObserver]: Analyzing ICFG test25-2.c [2019-11-27 23:53:27,167 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:53:27,185 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:53:27,195 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:53:27,215 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:53:27,215 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:53:27,215 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:53:27,215 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:53:27,216 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:53:27,216 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:53:27,216 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:53:27,216 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:53:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-11-27 23:53:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:53:27,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:27,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:27,240 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:27,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:27,246 INFO L82 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2019-11-27 23:53:27,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:27,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59408535] [2019-11-27 23:53:27,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:27,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59408535] [2019-11-27 23:53:27,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:27,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:53:27,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522457386] [2019-11-27 23:53:27,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:53:27,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:27,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:53:27,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:53:27,437 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-11-27 23:53:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:27,458 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-11-27 23:53:27,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:53:27,459 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 23:53:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:27,468 INFO L225 Difference]: With dead ends: 30 [2019-11-27 23:53:27,468 INFO L226 Difference]: Without dead ends: 13 [2019-11-27 23:53:27,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:53:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-27 23:53:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-27 23:53:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-27 23:53:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-27 23:53:27,501 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-11-27 23:53:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:27,502 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-27 23:53:27,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:53:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-11-27 23:53:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:53:27,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:27,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:27,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:27,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2019-11-27 23:53:27,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:27,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796364937] [2019-11-27 23:53:27,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:27,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796364937] [2019-11-27 23:53:27,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:27,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:53:27,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62695543] [2019-11-27 23:53:27,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:53:27,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:27,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:53:27,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:27,595 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-11-27 23:53:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:27,628 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-11-27 23:53:27,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:53:27,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-27 23:53:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:27,629 INFO L225 Difference]: With dead ends: 24 [2019-11-27 23:53:27,630 INFO L226 Difference]: Without dead ends: 15 [2019-11-27 23:53:27,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-27 23:53:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-27 23:53:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-27 23:53:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-27 23:53:27,636 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2019-11-27 23:53:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:27,637 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-27 23:53:27,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:53:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-27 23:53:27,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-27 23:53:27,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:27,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:27,638 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:27,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:27,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1434190826, now seen corresponding path program 1 times [2019-11-27 23:53:27,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:27,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067783795] [2019-11-27 23:53:27,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:27,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067783795] [2019-11-27 23:53:27,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211541969] [2019-11-27 23:53:27,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 23:53:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:27,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:53:27,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:27,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:27,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-27 23:53:27,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677966749] [2019-11-27 23:53:27,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:27,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:27,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:27,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:27,882 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-11-27 23:53:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:27,926 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-11-27 23:53:27,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:53:27,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-27 23:53:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:27,928 INFO L225 Difference]: With dead ends: 26 [2019-11-27 23:53:27,928 INFO L226 Difference]: Without dead ends: 17 [2019-11-27 23:53:27,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-27 23:53:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-27 23:53:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-27 23:53:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-11-27 23:53:27,934 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2019-11-27 23:53:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:27,934 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-11-27 23:53:27,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-11-27 23:53:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:53:27,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:27,936 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:28,141 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:28,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:28,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:28,141 INFO L82 PathProgramCache]: Analyzing trace with hash 201480788, now seen corresponding path program 2 times [2019-11-27 23:53:28,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:28,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494070152] [2019-11-27 23:53:28,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:53:28,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494070152] [2019-11-27 23:53:28,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938191628] [2019-11-27 23:53:28,252 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 23:53:28,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 23:53:28,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:28,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 23:53:28,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:28,450 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:53:28,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:53:28,458 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 28 treesize of output 12 [2019-11-27 23:53:28,460 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:53:28,468 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:53:28,472 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:53:28,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-11-27 23:53:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 23:53:28,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:53:28,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-11-27 23:53:28,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708925919] [2019-11-27 23:53:28,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:28,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:53:28,489 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 5 states. [2019-11-27 23:53:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:28,574 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-11-27 23:53:28,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:53:28,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-27 23:53:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:28,576 INFO L225 Difference]: With dead ends: 23 [2019-11-27 23:53:28,576 INFO L226 Difference]: Without dead ends: 18 [2019-11-27 23:53:28,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:53:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-27 23:53:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-27 23:53:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-27 23:53:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-11-27 23:53:28,583 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-11-27 23:53:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:28,583 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-11-27 23:53:28,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-11-27 23:53:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 23:53:28,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:28,585 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:28,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:28,791 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:28,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1859304665, now seen corresponding path program 1 times [2019-11-27 23:53:28,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:28,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765427941] [2019-11-27 23:53:28,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:53:28,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765427941] [2019-11-27 23:53:28,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187616032] [2019-11-27 23:53:28,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 23:53:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:28,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 23:53:28,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:53:28,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:28,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-27 23:53:28,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179367543] [2019-11-27 23:53:28,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:53:28,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:28,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:53:28,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:53:28,991 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-11-27 23:53:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:29,026 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-27 23:53:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:53:29,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-27 23:53:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:29,028 INFO L225 Difference]: With dead ends: 32 [2019-11-27 23:53:29,028 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 23:53:29,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:53:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 23:53:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-27 23:53:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-27 23:53:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-27 23:53:29,034 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-11-27 23:53:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:29,035 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-27 23:53:29,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:53:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-27 23:53:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:53:29,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:29,037 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:29,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:29,249 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:29,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:29,249 INFO L82 PathProgramCache]: Analyzing trace with hash 291228695, now seen corresponding path program 2 times [2019-11-27 23:53:29,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:29,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179051274] [2019-11-27 23:53:29,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:53:29,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179051274] [2019-11-27 23:53:29,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673494595] [2019-11-27 23:53:29,333 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-27 23:53:29,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:53:29,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:29,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:53:29,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:53:29,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:29,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-27 23:53:29,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975528950] [2019-11-27 23:53:29,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:53:29,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:29,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:53:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:53:29,419 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2019-11-27 23:53:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:29,476 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-11-27 23:53:29,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:53:29,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-27 23:53:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:29,482 INFO L225 Difference]: With dead ends: 34 [2019-11-27 23:53:29,482 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 23:53:29,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:53:29,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 23:53:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-27 23:53:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-27 23:53:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-11-27 23:53:29,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2019-11-27 23:53:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:29,493 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-11-27 23:53:29,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:53:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-11-27 23:53:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:53:29,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:29,494 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:29,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:29,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:29,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:29,699 INFO L82 PathProgramCache]: Analyzing trace with hash 903742421, now seen corresponding path program 3 times [2019-11-27 23:53:29,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:29,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195813462] [2019-11-27 23:53:29,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 23:53:29,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195813462] [2019-11-27 23:53:29,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542603315] [2019-11-27 23:53:29,814 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:29,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-27 23:53:29,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:29,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-27 23:53:29,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:29,979 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:53:29,983 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:53:29,984 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 28 treesize of output 12 [2019-11-27 23:53:29,985 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:53:29,991 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:53:29,993 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:53:29,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-11-27 23:53:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 23:53:30,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:30,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-11-27 23:53:30,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194335416] [2019-11-27 23:53:30,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:53:30,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:53:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:53:30,011 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2019-11-27 23:53:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:32,215 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-27 23:53:32,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:53:32,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-27 23:53:32,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:32,228 INFO L225 Difference]: With dead ends: 38 [2019-11-27 23:53:32,229 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:53:32,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:53:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:53:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-27 23:53:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 23:53:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-27 23:53:32,240 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2019-11-27 23:53:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:32,241 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-27 23:53:32,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:53:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-27 23:53:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:32,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:32,243 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:32,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:32,447 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:32,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1251069224, now seen corresponding path program 4 times [2019-11-27 23:53:32,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:32,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337067507] [2019-11-27 23:53:32,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-27 23:53:32,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337067507] [2019-11-27 23:53:32,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770003772] [2019-11-27 23:53:32,548 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:32,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 23:53:32,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:32,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-27 23:53:32,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:38,136 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-27 23:53:38,138 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:53:38,139 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 28 treesize of output 12 [2019-11-27 23:53:38,140 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:53:38,154 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:53:38,156 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:53:38,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-11-27 23:53:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-27 23:53:38,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:38,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-27 23:53:38,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330902052] [2019-11-27 23:53:38,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 23:53:38,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:38,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 23:53:38,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=115, Unknown=2, NotChecked=0, Total=156 [2019-11-27 23:53:38,176 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2019-11-27 23:53:48,350 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-27 23:53:52,405 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-27 23:53:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:54,488 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-27 23:53:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 23:53:54,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-27 23:53:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:54,489 INFO L225 Difference]: With dead ends: 44 [2019-11-27 23:53:54,489 INFO L226 Difference]: Without dead ends: 31 [2019-11-27 23:53:54,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=60, Invalid=207, Unknown=5, NotChecked=0, Total=272 [2019-11-27 23:53:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-27 23:53:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-11-27 23:53:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:53:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-27 23:53:54,496 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2019-11-27 23:53:54,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:54,497 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-27 23:53:54,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 23:53:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-27 23:53:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:53:54,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:54,498 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:54,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:54,701 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:54,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1378869733, now seen corresponding path program 5 times [2019-11-27 23:53:54,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:54,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656251018] [2019-11-27 23:53:54,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-27 23:53:54,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656251018] [2019-11-27 23:53:54,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045113349] [2019-11-27 23:53:54,823 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:55,948 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-27 23:53:55,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:55,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:53:55,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-27 23:53:55,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:55,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-27 23:53:55,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270893773] [2019-11-27 23:53:55,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:53:55,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:55,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:53:55,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:53:55,967 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2019-11-27 23:53:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:56,033 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-11-27 23:53:56,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:53:56,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-27 23:53:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:56,035 INFO L225 Difference]: With dead ends: 48 [2019-11-27 23:53:56,035 INFO L226 Difference]: Without dead ends: 33 [2019-11-27 23:53:56,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:53:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-27 23:53:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-11-27 23:53:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 23:53:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-27 23:53:56,040 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2019-11-27 23:53:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:56,041 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-27 23:53:56,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:53:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-27 23:53:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 23:53:56,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:56,042 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:56,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:56,248 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:56,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1005994073, now seen corresponding path program 6 times [2019-11-27 23:53:56,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:56,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289406743] [2019-11-27 23:53:56,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-27 23:53:56,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289406743] [2019-11-27 23:53:56,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485081040] [2019-11-27 23:53:56,372 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:56,514 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-27 23:53:56,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:53:56,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-27 23:53:56,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:53:56,541 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 [2019-11-27 23:53:56,542 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:53:56,555 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:53:56,565 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 [2019-11-27 23:53:56,565 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:53:56,580 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:53:56,581 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:53:56,581 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:20 [2019-11-27 23:53:56,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:53:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-27 23:53:56,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:53:56,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-27 23:53:56,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553143344] [2019-11-27 23:53:56,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 23:53:56,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 23:53:56,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:53:56,791 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 18 states. [2019-11-27 23:53:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:57,266 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-27 23:53:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-27 23:53:57,266 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2019-11-27 23:53:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:57,267 INFO L225 Difference]: With dead ends: 48 [2019-11-27 23:53:57,267 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:53:57,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-11-27 23:53:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:53:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:53:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:53:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:53:57,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-11-27 23:53:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:57,270 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:53:57,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 23:53:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:53:57,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:53:57,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:53:57,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:53:57,565 INFO L246 CegarLoopResult]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2019-11-27 23:53:57,566 INFO L242 CegarLoopResult]: At program point L27-3(lines 27 30) the Hoare annotation is: (= 0 |ULTIMATE.start_main_~#cont~0.offset|) [2019-11-27 23:53:57,566 INFO L246 CegarLoopResult]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2019-11-27 23:53:57,566 INFO L246 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2019-11-27 23:53:57,566 INFO L246 CegarLoopResult]: For program point L32(lines 32 44) no Hoare annotation was computed. [2019-11-27 23:53:57,566 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:53:57,566 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:53:57,566 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:53:57,566 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-27 23:53:57,567 INFO L249 CegarLoopResult]: At program point L49(lines 20 50) the Hoare annotation is: true [2019-11-27 23:53:57,567 INFO L242 CegarLoopResult]: At program point L41(lines 21 50) the Hoare annotation is: false [2019-11-27 23:53:57,567 INFO L246 CegarLoopResult]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2019-11-27 23:53:57,567 INFO L242 CegarLoopResult]: At program point L37-3(lines 37 39) the Hoare annotation is: (and (= ULTIMATE.start_main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) ULTIMATE.start_main_~pa~0.base) (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= 0 |ULTIMATE.start_main_~#cont~0.offset|)) [2019-11-27 23:53:57,567 INFO L246 CegarLoopResult]: For program point L37-4(lines 37 39) no Hoare annotation was computed. [2019-11-27 23:53:57,567 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:53:57,567 INFO L242 CegarLoopResult]: At program point L17(lines 15 18) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#cont~0.base|) |ULTIMATE.start_main_~#cont~0.offset|) 4))) (let ((.cse0 (select (select |#memory_int| .cse2) .cse1))) (and (<= .cse0 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~pa~0.offset .cse1) (= .cse2 ULTIMATE.start_main_~pa~0.base) (= 1 |ULTIMATE.start_check_#res|) (<= ULTIMATE.start_main_~i~0 .cse0) (= 0 |ULTIMATE.start_main_~#cont~0.offset|)))) [2019-11-27 23:53:57,567 INFO L246 CegarLoopResult]: For program point L35(lines 35 43) no Hoare annotation was computed. [2019-11-27 23:53:57,580 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,581 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,581 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,582 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,582 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,582 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,585 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,586 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,587 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,588 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,588 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,588 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,589 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,589 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,590 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,591 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,592 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,592 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,594 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,594 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:53:57 BoogieIcfgContainer [2019-11-27 23:53:57,598 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:53:57,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:53:57,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:53:57,599 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:53:57,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:27" (3/4) ... [2019-11-27 23:53:57,605 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:53:57,617 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-27 23:53:57,618 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 23:53:57,618 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 23:53:57,650 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4] <= i && pa == #memory_$Pointer$[cont][cont] + 4) && #memory_$Pointer$[cont][cont] == pa) && 1 == \result) && i <= unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4]) && 0 == cont [2019-11-27 23:53:57,674 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:53:57,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:53:57,677 INFO L168 Benchmark]: Toolchain (without parser) took 31374.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 959.0 MB in the beginning and 1.0 GB in the end (delta: -83.2 MB). Peak memory consumption was 112.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:57,677 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:53:57,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.01 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:57,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:57,679 INFO L168 Benchmark]: Boogie Preprocessor took 30.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:53:57,680 INFO L168 Benchmark]: RCFGBuilder took 398.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:57,680 INFO L168 Benchmark]: TraceAbstraction took 30454.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 117.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:57,681 INFO L168 Benchmark]: Witness Printer took 75.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:57,684 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.47 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.01 ms. Allocated memory is still 1.0 GB. Free memory was 959.0 MB in the beginning and 948.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.3 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.68 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 398.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30454.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 117.6 MB. Max. memory is 11.5 GB. * Witness Printer took 75.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 15]: Loop Invariant [2019-11-27 23:53:57,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,699 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,700 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,701 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,703 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,704 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,705 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,705 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4] <= i && pa == #memory_$Pointer$[cont][cont] + 4) && #memory_$Pointer$[cont][cont] == pa) && 1 == \result) && i <= unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4]) && 0 == cont - InvariantResult [Line: 37]: Loop Invariant [2019-11-27 23:53:57,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,708 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-27 23:53:57,710 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-27 23:53:57,710 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-27 23:53:57,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-27 23:53:57,711 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((pa == #memory_$Pointer$[cont][cont] + 4 && #memory_$Pointer$[cont][cont] == pa) && i <= unknown-#memory_int-unknown[pa][pa]) && 0 == cont - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == cont - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Result: SAFE, OverallTime: 30.2s, OverallIterations: 10, TraceHistogramMax: 7, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 53 SDslu, 302 SDs, 0 SdLazy, 331 SolverSat, 12 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 19 NumberOfFragments, 89 HoareAnnotationTreeSize, 5 FomulaSimplifications, 237 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 87 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 361 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 343 ConstructedInterpolants, 9 QuantifiedInterpolants, 26877 SizeOfPredicates, 57 NumberOfNonLiveVariables, 808 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 155/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...