/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:49:03,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:49:03,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:49:03,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:49:03,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:49:03,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:49:03,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:49:03,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:49:03,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:49:03,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:49:03,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:49:03,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:49:03,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:49:03,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:49:03,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:49:03,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:49:03,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:49:03,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:49:03,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:49:03,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:49:03,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:49:03,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:49:03,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:49:03,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:49:03,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:49:03,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:49:03,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:49:03,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:49:03,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:49:03,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:49:03,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:49:03,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:49:03,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:49:03,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:49:03,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:49:03,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:49:03,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:49:03,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:49:03,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:49:03,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:49:03,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:49:03,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:49:03,341 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:49:03,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:49:03,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:49:03,343 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:49:03,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:49:03,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:49:03,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:49:03,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:49:03,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:49:03,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:49:03,344 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:49:03,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:49:03,344 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:49:03,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:49:03,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:49:03,345 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:49:03,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:49:03,345 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:49:03,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:49:03,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:49:03,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:49:03,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:49:03,347 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:49:03,625 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:49:03,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:49:03,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:49:03,650 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:49:03,651 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:49:03,652 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005.i [2020-07-18 00:49:03,727 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1636baa/c2f8555eb9b44979b1e8157adb858aae/FLAG40ab6c27b [2020-07-18 00:49:04,209 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:49:04,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005.i [2020-07-18 00:49:04,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1636baa/c2f8555eb9b44979b1e8157adb858aae/FLAG40ab6c27b [2020-07-18 00:49:04,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1636baa/c2f8555eb9b44979b1e8157adb858aae [2020-07-18 00:49:04,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:49:04,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:49:04,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:04,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:49:04,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:49:04,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:04" (1/1) ... [2020-07-18 00:49:04,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7227971a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04, skipping insertion in model container [2020-07-18 00:49:04,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:04" (1/1) ... [2020-07-18 00:49:04,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:49:04,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:49:04,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:04,794 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:49:04,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:04,826 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:49:04,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04 WrapperNode [2020-07-18 00:49:04,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:04,828 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:49:04,828 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:49:04,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:49:04,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04" (1/1) ... [2020-07-18 00:49:04,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04" (1/1) ... [2020-07-18 00:49:04,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04" (1/1) ... [2020-07-18 00:49:04,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04" (1/1) ... [2020-07-18 00:49:04,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04" (1/1) ... [2020-07-18 00:49:04,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04" (1/1) ... [2020-07-18 00:49:04,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04" (1/1) ... [2020-07-18 00:49:04,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:49:04,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:49:04,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:49:04,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:49:04,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04" (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 [2020-07-18 00:49:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:49:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:49:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:49:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:49:05,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:49:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:49:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:49:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:49:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:49:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:49:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:49:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:49:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:49:05,272 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:49:05,273 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:49:05,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:05 BoogieIcfgContainer [2020-07-18 00:49:05,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:49:05,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:49:05,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:49:05,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:49:05,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:49:04" (1/3) ... [2020-07-18 00:49:05,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1768e7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:05, skipping insertion in model container [2020-07-18 00:49:05,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:04" (2/3) ... [2020-07-18 00:49:05,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1768e7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:05, skipping insertion in model container [2020-07-18 00:49:05,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:05" (3/3) ... [2020-07-18 00:49:05,294 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005.i [2020-07-18 00:49:05,302 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:49:05,308 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:49:05,322 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:49:05,345 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:49:05,346 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:49:05,346 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:49:05,346 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:49:05,346 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:49:05,346 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:49:05,347 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:49:05,347 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:49:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-18 00:49:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-18 00:49:05,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:05,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:05,374 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:05,381 INFO L82 PathProgramCache]: Analyzing trace with hash -714485069, now seen corresponding path program 1 times [2020-07-18 00:49:05,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:05,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409183436] [2020-07-18 00:49:05,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:05,638 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-18 00:49:05,639 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #46#return; {26#true} is VALID [2020-07-18 00:49:05,641 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-18 00:49:05,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-18 00:49:05,642 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #46#return; {26#true} is VALID [2020-07-18 00:49:05,642 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret0 := main(); {26#true} is VALID [2020-07-18 00:49:05,642 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~i~0; {26#true} is VALID [2020-07-18 00:49:05,643 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~j~0; {26#true} is VALID [2020-07-18 00:49:05,644 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} ~i~0 := 1; {30#(<= main_~i~0 1)} is VALID [2020-07-18 00:49:05,645 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#(<= main_~i~0 1)} ~j~0 := 10; {31#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-18 00:49:05,648 INFO L280 TraceCheckUtils]: 8: Hoare triple {31#(<= (+ main_~i~0 9) main_~j~0)} assume !(~j~0 >= ~i~0); {27#false} is VALID [2020-07-18 00:49:05,649 INFO L263 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {27#false} is VALID [2020-07-18 00:49:05,649 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-18 00:49:05,649 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-18 00:49:05,650 INFO L280 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-18 00:49:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:49:05,659 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:05,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409183436] [2020-07-18 00:49:05,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:05,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:49:05,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634147747] [2020-07-18 00:49:05,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-18 00:49:05,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:05,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:49:05,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:05,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:49:05,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:05,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:49:05,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:49:05,724 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2020-07-18 00:49:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:05,907 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-18 00:49:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:49:05,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-18 00:49:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:49:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-18 00:49:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:49:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2020-07-18 00:49:05,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2020-07-18 00:49:06,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:06,034 INFO L225 Difference]: With dead ends: 37 [2020-07-18 00:49:06,035 INFO L226 Difference]: Without dead ends: 18 [2020-07-18 00:49:06,040 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:49:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-18 00:49:06,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-18 00:49:06,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:06,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2020-07-18 00:49:06,087 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2020-07-18 00:49:06,087 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2020-07-18 00:49:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:06,090 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-18 00:49:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-18 00:49:06,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:06,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:06,092 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2020-07-18 00:49:06,092 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2020-07-18 00:49:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:06,095 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-18 00:49:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-18 00:49:06,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:06,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:06,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:06,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 00:49:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-18 00:49:06,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2020-07-18 00:49:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:06,101 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-18 00:49:06,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:49:06,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2020-07-18 00:49:06,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-18 00:49:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-18 00:49:06,129 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:06,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:06,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:49:06,130 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash 673132007, now seen corresponding path program 1 times [2020-07-18 00:49:06,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:06,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2026028781] [2020-07-18 00:49:06,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:08,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-18 00:49:08,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2020-07-18 00:49:08,749 INFO L263 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2020-07-18 00:49:08,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {180#true} assume true; {180#true} is VALID [2020-07-18 00:49:08,749 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {180#true} {180#true} #46#return; {180#true} is VALID [2020-07-18 00:49:08,750 INFO L263 TraceCheckUtils]: 3: Hoare triple {180#true} call #t~ret0 := main(); {180#true} is VALID [2020-07-18 00:49:08,750 INFO L280 TraceCheckUtils]: 4: Hoare triple {180#true} havoc ~i~0; {180#true} is VALID [2020-07-18 00:49:08,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {180#true} havoc ~j~0; {180#true} is VALID [2020-07-18 00:49:08,751 INFO L280 TraceCheckUtils]: 6: Hoare triple {180#true} ~i~0 := 1; {184#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-18 00:49:08,752 INFO L280 TraceCheckUtils]: 7: Hoare triple {184#(and (<= main_~i~0 1) (<= 1 main_~i~0))} ~j~0 := 10; {185#(and (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= 21 (+ main_~i~0 (* 2 main_~j~0))) (<= (+ main_~i~0 9) main_~j~0))} is VALID [2020-07-18 00:49:08,755 INFO L280 TraceCheckUtils]: 8: Hoare triple {185#(and (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= 21 (+ main_~i~0 (* 2 main_~j~0))) (<= (+ main_~i~0 9) main_~j~0))} [52] L17-2-->L17-3_primed: Formula: (or (let ((.cse1 (* v_oct_main_~i~0_in_1 (- 1)))) (let ((.cse0 (div (+ (* v_oct_main_~i~0_out_1 (- 1)) v_oct_main_~i~0_in_1 4) (- 2))) (.cse2 (div (+ v_oct_main_~i~0_out_1 .cse1 (- 4)) 2))) (and (<= .cse0 (div (+ v_oct_main_~j~0_in_1 .cse1 (- 3)) 3)) (<= (+ .cse0 v_oct_main_~j~0_out_1 2) v_oct_main_~j~0_in_1) (<= 0 .cse2) (<= v_oct_main_~j~0_in_1 (+ v_oct_main_~j~0_out_1 .cse2 2))))) (let ((.cse3 (* (- 1) v_oct_main_~j~0_in_1))) (and (<= (+ .cse3 v_oct_main_~i~0_in_1) 0) (<= (+ .cse3 v_oct_main_~j~0_out_1) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_out_1) v_oct_main_~i~0_in_1) (- 2)) (<= (+ (* (- 1) v_oct_main_~j~0_out_1) v_oct_main_~j~0_in_1) 1) (<= (+ (* (- 1) v_oct_main_~i~0_in_1) v_oct_main_~i~0_out_1) 2)))) InVars {main_~i~0=v_oct_main_~i~0_in_1, main_~j~0=v_oct_main_~j~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_~j~0=v_oct_main_~j~0_out_1} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {186#(or (<= (+ main_~i~0 6) main_~j~0) (and (or (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= main_~j~0 6)) (< 5 main_~j~0)))} is VALID [2020-07-18 00:49:08,757 INFO L280 TraceCheckUtils]: 9: Hoare triple {186#(or (<= (+ main_~i~0 6) main_~j~0) (and (or (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= main_~j~0 6)) (< 5 main_~j~0)))} [51] L17-3_primed-->L17-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~j~0=v_main_~j~0_2, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {187#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-18 00:49:08,758 INFO L263 TraceCheckUtils]: 10: Hoare triple {187#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {188#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:08,759 INFO L280 TraceCheckUtils]: 11: Hoare triple {188#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {189#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:08,760 INFO L280 TraceCheckUtils]: 12: Hoare triple {189#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {181#false} is VALID [2020-07-18 00:49:08,760 INFO L280 TraceCheckUtils]: 13: Hoare triple {181#false} assume !false; {181#false} is VALID [2020-07-18 00:49:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:49:08,862 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:08,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2026028781] [2020-07-18 00:49:08,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:08,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:49:08,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280670647] [2020-07-18 00:49:08,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-18 00:49:08,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:08,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:49:08,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:08,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:49:08,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:49:08,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:49:08,887 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2020-07-18 00:49:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:09,129 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-18 00:49:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:49:09,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-18 00:49:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-18 00:49:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-18 00:49:09,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-18 00:49:09,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:09,180 INFO L225 Difference]: With dead ends: 26 [2020-07-18 00:49:09,181 INFO L226 Difference]: Without dead ends: 21 [2020-07-18 00:49:09,183 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:49:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-18 00:49:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-18 00:49:09,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:09,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2020-07-18 00:49:09,218 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2020-07-18 00:49:09,219 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2020-07-18 00:49:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:09,222 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-18 00:49:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-18 00:49:09,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:09,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:09,223 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2020-07-18 00:49:09,224 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2020-07-18 00:49:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:09,227 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-18 00:49:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-18 00:49:09,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:09,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:09,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:09,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 00:49:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-18 00:49:09,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2020-07-18 00:49:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:09,233 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-18 00:49:09,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:49:09,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2020-07-18 00:49:09,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-18 00:49:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-18 00:49:09,260 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:09,260 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:09,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:49:09,261 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash 113219123, now seen corresponding path program 2 times [2020-07-18 00:49:09,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:09,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [48613226] [2020-07-18 00:49:09,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:11,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {330#true} assume true; {330#true} is VALID [2020-07-18 00:49:11,648 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {330#true} {330#true} #46#return; {330#true} is VALID [2020-07-18 00:49:11,648 INFO L263 TraceCheckUtils]: 0: Hoare triple {330#true} call ULTIMATE.init(); {330#true} is VALID [2020-07-18 00:49:11,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {330#true} assume true; {330#true} is VALID [2020-07-18 00:49:11,649 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {330#true} {330#true} #46#return; {330#true} is VALID [2020-07-18 00:49:11,649 INFO L263 TraceCheckUtils]: 3: Hoare triple {330#true} call #t~ret0 := main(); {330#true} is VALID [2020-07-18 00:49:11,650 INFO L280 TraceCheckUtils]: 4: Hoare triple {330#true} havoc ~i~0; {330#true} is VALID [2020-07-18 00:49:11,650 INFO L280 TraceCheckUtils]: 5: Hoare triple {330#true} havoc ~j~0; {330#true} is VALID [2020-07-18 00:49:11,651 INFO L280 TraceCheckUtils]: 6: Hoare triple {330#true} ~i~0 := 1; {334#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-18 00:49:11,652 INFO L280 TraceCheckUtils]: 7: Hoare triple {334#(and (<= main_~i~0 1) (<= 1 main_~i~0))} ~j~0 := 10; {335#(and (<= (+ main_~i~0 9) main_~j~0) (<= 12 (+ (* 2 main_~i~0) main_~j~0)) (<= (+ main_~i~0 main_~j~0) 11))} is VALID [2020-07-18 00:49:11,655 INFO L280 TraceCheckUtils]: 8: Hoare triple {335#(and (<= (+ main_~i~0 9) main_~j~0) (<= 12 (+ (* 2 main_~i~0) main_~j~0)) (<= (+ main_~i~0 main_~j~0) 11))} [54] L17-2-->L17-3_primed: Formula: (or (let ((.cse0 (div (+ (* v_oct_main_~i~0_out_2 (- 1)) v_oct_main_~i~0_in_2 4) (- 2))) (.cse1 (* v_oct_main_~i~0_in_2 (- 1)))) (and (<= (+ v_oct_main_~j~0_out_2 2) v_oct_main_~j~0_in_2) (<= (+ .cse0 v_oct_main_~j~0_out_2 2) v_oct_main_~j~0_in_2) (<= v_oct_main_~j~0_in_2 (+ v_oct_main_~j~0_out_2 (div (+ v_oct_main_~i~0_out_2 .cse1 (- 4)) 2) 2)) (<= .cse0 (div (+ .cse1 v_oct_main_~j~0_in_2 (- 3)) 3)))) (let ((.cse2 (* (- 1) v_oct_main_~j~0_in_2))) (and (<= (+ (* (- 1) v_oct_main_~i~0_out_2) v_oct_main_~i~0_in_2) (- 2)) (<= (+ (* (- 1) v_oct_main_~i~0_in_2) v_oct_main_~i~0_out_2) 2) (<= (+ .cse2 v_oct_main_~i~0_in_2) 0) (<= (+ .cse2 v_oct_main_~j~0_out_2) (- 1)) (<= (+ (* (- 1) v_oct_main_~j~0_out_2) v_oct_main_~j~0_in_2) 1)))) InVars {main_~i~0=v_oct_main_~i~0_in_2, main_~j~0=v_oct_main_~j~0_in_2} OutVars{main_~i~0=v_oct_main_~i~0_out_2, main_~j~0=v_oct_main_~j~0_out_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {336#(or (and (<= main_~j~0 6) (< 5 main_~j~0)) (<= main_~i~0 main_~j~0))} is VALID [2020-07-18 00:49:11,656 INFO L280 TraceCheckUtils]: 9: Hoare triple {336#(or (and (<= main_~j~0 6) (< 5 main_~j~0)) (<= main_~i~0 main_~j~0))} [53] L17-3_primed-->L17-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~j~0=v_main_~j~0_2, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {337#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-18 00:49:11,658 INFO L263 TraceCheckUtils]: 10: Hoare triple {337#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {338#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:11,658 INFO L280 TraceCheckUtils]: 11: Hoare triple {338#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {339#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:11,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {339#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {331#false} is VALID [2020-07-18 00:49:11,659 INFO L280 TraceCheckUtils]: 13: Hoare triple {331#false} assume !false; {331#false} is VALID [2020-07-18 00:49:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:49:11,842 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:11,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [48613226] [2020-07-18 00:49:11,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:11,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-18 00:49:11,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581324041] [2020-07-18 00:49:11,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-07-18 00:49:11,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:11,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 00:49:11,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:11,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 00:49:11,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:11,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 00:49:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:49:11,871 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2020-07-18 00:49:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:12,241 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-18 00:49:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:49:12,241 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-07-18 00:49:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-18 00:49:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:49:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-18 00:49:12,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-18 00:49:12,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:12,286 INFO L225 Difference]: With dead ends: 29 [2020-07-18 00:49:12,286 INFO L226 Difference]: Without dead ends: 24 [2020-07-18 00:49:12,287 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:49:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-18 00:49:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-18 00:49:12,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:12,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-18 00:49:12,323 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-18 00:49:12,323 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-18 00:49:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:12,325 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-18 00:49:12,325 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-18 00:49:12,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:12,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:12,326 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-18 00:49:12,326 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-18 00:49:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:12,329 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-18 00:49:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-18 00:49:12,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:12,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:12,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:12,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-18 00:49:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-18 00:49:12,332 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2020-07-18 00:49:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:12,332 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-18 00:49:12,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 00:49:12,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2020-07-18 00:49:12,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-18 00:49:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-18 00:49:12,361 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:12,361 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:12,362 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:49:12,362 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:12,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:12,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1401469543, now seen corresponding path program 3 times [2020-07-18 00:49:12,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:12,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1466748979] [2020-07-18 00:49:12,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:14,721 INFO L280 TraceCheckUtils]: 0: Hoare triple {498#true} assume true; {498#true} is VALID [2020-07-18 00:49:14,721 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {498#true} {498#true} #46#return; {498#true} is VALID [2020-07-18 00:49:14,722 INFO L263 TraceCheckUtils]: 0: Hoare triple {498#true} call ULTIMATE.init(); {498#true} is VALID [2020-07-18 00:49:14,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {498#true} assume true; {498#true} is VALID [2020-07-18 00:49:14,722 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {498#true} {498#true} #46#return; {498#true} is VALID [2020-07-18 00:49:14,723 INFO L263 TraceCheckUtils]: 3: Hoare triple {498#true} call #t~ret0 := main(); {498#true} is VALID [2020-07-18 00:49:14,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {498#true} havoc ~i~0; {498#true} is VALID [2020-07-18 00:49:14,723 INFO L280 TraceCheckUtils]: 5: Hoare triple {498#true} havoc ~j~0; {498#true} is VALID [2020-07-18 00:49:14,724 INFO L280 TraceCheckUtils]: 6: Hoare triple {498#true} ~i~0 := 1; {502#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-18 00:49:14,725 INFO L280 TraceCheckUtils]: 7: Hoare triple {502#(and (<= main_~i~0 1) (<= 1 main_~i~0))} ~j~0 := 10; {503#(and (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= 21 (+ main_~i~0 (* 2 main_~j~0))) (<= (+ main_~i~0 9) main_~j~0))} is VALID [2020-07-18 00:49:14,728 INFO L280 TraceCheckUtils]: 8: Hoare triple {503#(and (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= 21 (+ main_~i~0 (* 2 main_~j~0))) (<= (+ main_~i~0 9) main_~j~0))} [56] L17-2-->L17-3_primed: Formula: (or (let ((.cse0 (* v_oct_main_~i~0_in_3 (- 1)))) (and (<= v_oct_main_~j~0_in_3 (+ v_oct_main_~j~0_out_3 (div (+ v_oct_main_~i~0_out_3 .cse0 (- 4)) 2) 2)) (<= (+ v_oct_main_~j~0_out_3 (div (+ (* v_oct_main_~i~0_out_3 (- 1)) v_oct_main_~i~0_in_3 4) (- 2)) 2) v_oct_main_~j~0_in_3) (<= v_oct_main_~j~0_in_3 (+ v_oct_main_~j~0_out_3 (div (+ v_oct_main_~j~0_in_3 .cse0 (- 3)) 3) 2)) (<= (+ v_oct_main_~j~0_out_3 2) v_oct_main_~j~0_in_3))) (let ((.cse1 (* (- 1) v_oct_main_~j~0_in_3))) (and (<= (+ (* (- 1) v_oct_main_~i~0_in_3) v_oct_main_~i~0_out_3) 2) (<= (+ .cse1 v_oct_main_~j~0_out_3) (- 1)) (<= (+ (* (- 1) v_oct_main_~j~0_out_3) v_oct_main_~j~0_in_3) 1) (<= (+ .cse1 v_oct_main_~i~0_in_3) 0) (<= (+ (* (- 1) v_oct_main_~i~0_out_3) v_oct_main_~i~0_in_3) (- 2))))) InVars {main_~i~0=v_oct_main_~i~0_in_3, main_~j~0=v_oct_main_~j~0_in_3} OutVars{main_~i~0=v_oct_main_~i~0_out_3, main_~j~0=v_oct_main_~j~0_out_3} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {504#(or (<= (+ main_~i~0 6) main_~j~0) (and (or (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= main_~j~0 6)) (< 5 main_~j~0)))} is VALID [2020-07-18 00:49:14,729 INFO L280 TraceCheckUtils]: 9: Hoare triple {504#(or (<= (+ main_~i~0 6) main_~j~0) (and (or (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= main_~j~0 6)) (< 5 main_~j~0)))} [55] L17-3_primed-->L17-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~j~0=v_main_~j~0_2, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-18 00:49:14,730 INFO L263 TraceCheckUtils]: 10: Hoare triple {505#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {506#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:14,731 INFO L280 TraceCheckUtils]: 11: Hoare triple {506#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {507#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:14,734 INFO L280 TraceCheckUtils]: 12: Hoare triple {507#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {499#false} is VALID [2020-07-18 00:49:14,734 INFO L280 TraceCheckUtils]: 13: Hoare triple {499#false} assume !false; {499#false} is VALID [2020-07-18 00:49:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:49:15,031 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:15,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1466748979] [2020-07-18 00:49:15,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:15,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-18 00:49:15,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323340131] [2020-07-18 00:49:15,032 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-07-18 00:49:15,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:15,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 00:49:15,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:15,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 00:49:15,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:15,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 00:49:15,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:49:15,071 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 13 states. [2020-07-18 00:49:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:15,332 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2020-07-18 00:49:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:49:15,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-07-18 00:49:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:49:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2020-07-18 00:49:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 00:49:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2020-07-18 00:49:15,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2020-07-18 00:49:15,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:15,392 INFO L225 Difference]: With dead ends: 32 [2020-07-18 00:49:15,392 INFO L226 Difference]: Without dead ends: 27 [2020-07-18 00:49:15,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:49:15,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-18 00:49:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-07-18 00:49:15,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:15,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2020-07-18 00:49:15,442 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2020-07-18 00:49:15,442 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2020-07-18 00:49:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:15,446 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-18 00:49:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-18 00:49:15,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:15,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:15,448 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2020-07-18 00:49:15,448 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2020-07-18 00:49:15,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:15,455 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-18 00:49:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-18 00:49:15,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:15,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:15,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:15,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-18 00:49:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-18 00:49:15,459 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2020-07-18 00:49:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:15,460 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-18 00:49:15,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 00:49:15,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2020-07-18 00:49:15,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-18 00:49:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-18 00:49:15,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:15,506 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:15,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:49:15,506 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:15,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash -158025293, now seen corresponding path program 4 times [2020-07-18 00:49:15,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:15,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [827301212] [2020-07-18 00:49:15,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:17,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-18 00:49:17,883 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {688#true} {688#true} #46#return; {688#true} is VALID [2020-07-18 00:49:17,884 INFO L263 TraceCheckUtils]: 0: Hoare triple {688#true} call ULTIMATE.init(); {688#true} is VALID [2020-07-18 00:49:17,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {688#true} assume true; {688#true} is VALID [2020-07-18 00:49:17,884 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {688#true} {688#true} #46#return; {688#true} is VALID [2020-07-18 00:49:17,885 INFO L263 TraceCheckUtils]: 3: Hoare triple {688#true} call #t~ret0 := main(); {688#true} is VALID [2020-07-18 00:49:17,885 INFO L280 TraceCheckUtils]: 4: Hoare triple {688#true} havoc ~i~0; {688#true} is VALID [2020-07-18 00:49:17,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {688#true} havoc ~j~0; {688#true} is VALID [2020-07-18 00:49:17,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {688#true} ~i~0 := 1; {692#(and (<= main_~i~0 1) (<= 1 main_~i~0))} is VALID [2020-07-18 00:49:17,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {692#(and (<= main_~i~0 1) (<= 1 main_~i~0))} ~j~0 := 10; {693#(and (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= 21 (+ main_~i~0 (* 2 main_~j~0))) (<= (+ main_~i~0 9) main_~j~0))} is VALID [2020-07-18 00:49:17,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {693#(and (<= (+ main_~i~0 (* 2 main_~j~0)) 21) (<= 21 (+ main_~i~0 (* 2 main_~j~0))) (<= (+ main_~i~0 9) main_~j~0))} [58] L17-2-->L17-3_primed: Formula: (or (let ((.cse0 (* (- 1) v_oct_main_~j~0_in_4))) (and (<= (+ .cse0 v_oct_main_~j~0_out_4) (- 1)) (<= (+ (* (- 1) v_oct_main_~i~0_out_4) v_oct_main_~i~0_in_4) (- 2)) (<= (+ (* (- 1) v_oct_main_~i~0_in_4) v_oct_main_~i~0_out_4) 2) (<= (+ .cse0 v_oct_main_~i~0_in_4) 0) (<= (+ (* (- 1) v_oct_main_~j~0_out_4) v_oct_main_~j~0_in_4) 1))) (let ((.cse3 (* v_oct_main_~i~0_in_4 (- 1)))) (let ((.cse1 (div (+ v_oct_main_~i~0_out_4 .cse3 (- 4)) 2)) (.cse2 (div (+ (* v_oct_main_~i~0_out_4 (- 1)) v_oct_main_~i~0_in_4 4) (- 2)))) (and (<= v_oct_main_~j~0_in_4 (+ .cse1 v_oct_main_~j~0_out_4 2)) (<= 0 .cse1) (<= (+ .cse2 v_oct_main_~j~0_out_4 2) v_oct_main_~j~0_in_4) (<= .cse2 (div (+ .cse3 v_oct_main_~j~0_in_4 (- 3)) 3)))))) InVars {main_~i~0=v_oct_main_~i~0_in_4, main_~j~0=v_oct_main_~j~0_in_4} OutVars{main_~i~0=v_oct_main_~i~0_out_4, main_~j~0=v_oct_main_~j~0_out_4} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {694#(or (and (<= main_~j~0 6) (< 5 main_~j~0)) (<= main_~i~0 main_~j~0))} is VALID [2020-07-18 00:49:17,893 INFO L280 TraceCheckUtils]: 9: Hoare triple {694#(or (and (<= main_~j~0 6) (< 5 main_~j~0)) (<= main_~i~0 main_~j~0))} [57] L17-3_primed-->L17-3: Formula: (not (<= v_main_~i~0_1 v_main_~j~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~i~0=v_main_~i~0_1} OutVars{main_~j~0=v_main_~j~0_2, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {695#(and (<= main_~j~0 6) (< 5 main_~j~0))} is VALID [2020-07-18 00:49:17,896 INFO L263 TraceCheckUtils]: 10: Hoare triple {695#(and (<= main_~j~0 6) (< 5 main_~j~0))} call __VERIFIER_assert((if 6 == ~j~0 then 1 else 0)); {696#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:17,896 INFO L280 TraceCheckUtils]: 11: Hoare triple {696#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {697#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:17,899 INFO L280 TraceCheckUtils]: 12: Hoare triple {697#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {689#false} is VALID [2020-07-18 00:49:17,900 INFO L280 TraceCheckUtils]: 13: Hoare triple {689#false} assume !false; {689#false} is VALID [2020-07-18 00:49:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:49:18,293 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:18,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [827301212] [2020-07-18 00:49:18,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:18,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:49:18,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965927660] [2020-07-18 00:49:18,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2020-07-18 00:49:18,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:18,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:49:18,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:18,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:49:18,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:18,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:49:18,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-07-18 00:49:18,334 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 15 states. [2020-07-18 00:49:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:18,628 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-18 00:49:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-18 00:49:18,628 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2020-07-18 00:49:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:49:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2020-07-18 00:49:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:49:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 26 transitions. [2020-07-18 00:49:18,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 26 transitions. [2020-07-18 00:49:18,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:18,684 INFO L225 Difference]: With dead ends: 26 [2020-07-18 00:49:18,684 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:49:18,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2020-07-18 00:49:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:49:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:49:18,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:18,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:18,687 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:18,687 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:18,687 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:18,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:18,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:18,688 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:18,688 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:18,689 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:18,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:18,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:18,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:18,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:49:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:49:18,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-18 00:49:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:18,690 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:49:18,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:49:18,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:49:18,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:18,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:18,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:49:18,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:49:18,928 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:18,928 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:18,929 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:18,929 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:49:18,929 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:49:18,929 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:18,929 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:18,929 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:18,929 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 00:49:18,929 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 00:49:18,930 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:18,930 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 23) the Hoare annotation is: true [2020-07-18 00:49:18,930 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 23) the Hoare annotation is: true [2020-07-18 00:49:18,930 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-18 00:49:18,930 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* 2 main_~j~0)))) (and (<= 23 .cse0) (<= .cse0 23) (<= main_~i~0 (+ main_~j~0 2)))) [2020-07-18 00:49:18,930 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* 2 main_~j~0)))) (and (<= .cse0 21) (<= 21 .cse0) (<= main_~i~0 main_~j~0))) [2020-07-18 00:49:18,930 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~i~0 1) (<= 1 main_~i~0)) [2020-07-18 00:49:18,930 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-18 00:49:18,930 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 20) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* 2 main_~j~0)))) (and (<= .cse0 21) (<= 21 .cse0) (<= main_~i~0 (+ main_~j~0 3)))) [2020-07-18 00:49:18,931 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-18 00:49:18,931 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 20) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 (* 2 main_~j~0)))) (and (<= .cse0 21) (<= 21 .cse0) (<= main_~i~0 (+ main_~j~0 3)) (< main_~j~0 main_~i~0))) [2020-07-18 00:49:18,931 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 23) the Hoare annotation is: true [2020-07-18 00:49:18,931 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:18,931 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:18,931 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:18,931 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:18,931 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:18,932 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:18,935 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 00:49:18,936 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:18,936 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:18,937 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 00:49:18,937 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 00:49:18,940 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:49:18,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:49:18 BoogieIcfgContainer [2020-07-18 00:49:18,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:49:18,955 INFO L168 Benchmark]: Toolchain (without parser) took 14384.56 ms. Allocated memory was 144.7 MB in the beginning and 278.9 MB in the end (delta: 134.2 MB). Free memory was 103.2 MB in the beginning and 213.2 MB in the end (delta: -109.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:18,956 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:49:18,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.74 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 93.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:18,958 INFO L168 Benchmark]: Boogie Preprocessor took 33.10 ms. Allocated memory is still 144.7 MB. Free memory was 93.3 MB in the beginning and 91.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:18,959 INFO L168 Benchmark]: RCFGBuilder took 415.49 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 91.7 MB in the beginning and 165.4 MB in the end (delta: -73.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:18,960 INFO L168 Benchmark]: TraceAbstraction took 13667.69 ms. Allocated memory was 201.3 MB in the beginning and 278.9 MB in the end (delta: 77.6 MB). Free memory was 164.7 MB in the beginning and 213.2 MB in the end (delta: -48.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:18,964 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 252.74 ms. Allocated memory is still 144.7 MB. Free memory was 102.8 MB in the beginning and 93.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.10 ms. Allocated memory is still 144.7 MB. Free memory was 93.3 MB in the beginning and 91.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 415.49 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 91.7 MB in the beginning and 165.4 MB in the end (delta: -73.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13667.69 ms. Allocated memory was 201.3 MB in the beginning and 278.9 MB in the end (delta: 77.6 MB). Free memory was 164.7 MB in the beginning and 213.2 MB in the end (delta: -48.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 17]: Loop Invariant Derived loop invariant: (i + 2 * j <= 21 && 21 <= i + 2 * j) && i <= j + 3 - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 13.3s, OverallIterations: 5, TraceHistogramMax: 4, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 69 SDtfs, 25 SDslu, 267 SDs, 0 SdLazy, 253 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 47 PreInvPairs, 71 NumberOfFragments, 117 HoareAnnotationTreeSize, 47 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 285 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...