/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/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:22:04,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:22:04,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:22:04,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:22:04,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:22:04,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:22:04,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:22:04,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:22:04,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:22:04,974 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:22:04,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:22:04,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:22:04,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:22:04,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:22:04,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:22:04,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:22:04,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:22:04,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:22:04,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:22:04,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:22:04,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:22:04,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:22:04,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:22:04,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:22:04,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:22:04,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:22:04,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:22:04,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:22:04,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:22:04,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:22:04,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:22:04,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:22:04,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:22:04,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:22:04,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:22:04,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:22:05,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:22:05,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:22:05,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:22:05,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:22:05,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:22:05,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:22:05,012 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:22:05,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:22:05,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:22:05,014 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:22:05,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:22:05,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:22:05,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:22:05,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:22:05,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:22:05,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:22:05,016 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:22:05,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:22:05,016 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:22:05,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:22:05,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:22:05,017 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:22:05,017 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:22:05,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:22:05,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:05,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:22:05,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:22:05,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:22:05,018 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:22:05,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:22:05,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:22:05,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:22:05,336 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:22:05,337 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:22:05,337 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2020-07-10 20:22:05,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455f1db87/1646669e99cf4e51a2c0afdd9962d46f/FLAG12ac4dbe8 [2020-07-10 20:22:05,863 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:22:05,864 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2020-07-10 20:22:05,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455f1db87/1646669e99cf4e51a2c0afdd9962d46f/FLAG12ac4dbe8 [2020-07-10 20:22:06,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/455f1db87/1646669e99cf4e51a2c0afdd9962d46f [2020-07-10 20:22:06,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:22:06,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:22:06,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:06,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:22:06,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:22:06,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:06" (1/1) ... [2020-07-10 20:22:06,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480d702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06, skipping insertion in model container [2020-07-10 20:22:06,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:06" (1/1) ... [2020-07-10 20:22:06,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:06,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:06,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:06,537 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:06,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:06,571 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:06,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06 WrapperNode [2020-07-10 20:22:06,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:06,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:06,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:06,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:06,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06" (1/1) ... [2020-07-10 20:22:06,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06" (1/1) ... [2020-07-10 20:22:06,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06" (1/1) ... [2020-07-10 20:22:06,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06" (1/1) ... [2020-07-10 20:22:06,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06" (1/1) ... [2020-07-10 20:22:06,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06" (1/1) ... [2020-07-10 20:22:06,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06" (1/1) ... [2020-07-10 20:22:06,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:06,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:06,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:06,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:06,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06" (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-10 20:22:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:06,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:06,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:06,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:06,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:07,053 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:07,054 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:22:07,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:07 BoogieIcfgContainer [2020-07-10 20:22:07,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:07,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:07,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:07,080 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:07,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:22:06" (1/3) ... [2020-07-10 20:22:07,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437e70c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:07, skipping insertion in model container [2020-07-10 20:22:07,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:06" (2/3) ... [2020-07-10 20:22:07,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437e70c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:07, skipping insertion in model container [2020-07-10 20:22:07,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:07" (3/3) ... [2020-07-10 20:22:07,084 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2020-07-10 20:22:07,096 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:07,104 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:07,119 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:07,143 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:07,143 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:07,143 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:07,143 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:07,143 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:07,144 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:07,144 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:07,144 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-10 20:22:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 20:22:07,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:07,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:07,173 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:07,179 INFO L82 PathProgramCache]: Analyzing trace with hash 129992897, now seen corresponding path program 1 times [2020-07-10 20:22:07,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:07,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [32215816] [2020-07-10 20:22:07,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,332 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 20:22:07,333 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #37#return; {26#true} is VALID [2020-07-10 20:22:07,335 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-10 20:22:07,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-10 20:22:07,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #37#return; {26#true} is VALID [2020-07-10 20:22:07,337 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret1 := main(); {26#true} is VALID [2020-07-10 20:22:07,337 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~i~0; {26#true} is VALID [2020-07-10 20:22:07,338 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} ~sn~0 := 0; {26#true} is VALID [2020-07-10 20:22:07,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} ~i~0 := 1; {26#true} is VALID [2020-07-10 20:22:07,345 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#true} assume !true; {27#false} is VALID [2020-07-10 20:22:07,345 INFO L263 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {27#false} is VALID [2020-07-10 20:22:07,346 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-10 20:22:07,346 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-10 20:22:07,346 INFO L280 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-10 20:22:07,347 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-10 20:22:07,348 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:07,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [32215816] [2020-07-10 20:22:07,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:07,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:22:07,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953662630] [2020-07-10 20:22:07,361 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-10 20:22:07,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:07,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:22:07,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:07,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:22:07,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:22:07,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:22:07,437 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2020-07-10 20:22:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,528 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-10 20:22:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:22:07,529 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-10 20:22:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2020-07-10 20:22:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:22:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2020-07-10 20:22:07,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2020-07-10 20:22:07,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:07,635 INFO L225 Difference]: With dead ends: 34 [2020-07-10 20:22:07,635 INFO L226 Difference]: Without dead ends: 17 [2020-07-10 20:22:07,640 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:22:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-10 20:22:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-10 20:22:07,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:07,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-10 20:22:07,696 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-10 20:22:07,696 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-10 20:22:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,700 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-10 20:22:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-10 20:22:07,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:07,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:07,701 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-10 20:22:07,702 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-10 20:22:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,705 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-10 20:22:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-10 20:22:07,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:07,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:07,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:07,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 20:22:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-10 20:22:07,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2020-07-10 20:22:07,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:07,712 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-10 20:22:07,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:22:07,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2020-07-10 20:22:07,747 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-10 20:22:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-10 20:22:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 20:22:07,748 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:07,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:07,749 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:07,749 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:07,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:07,750 INFO L82 PathProgramCache]: Analyzing trace with hash 121681208, now seen corresponding path program 1 times [2020-07-10 20:22:07,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:07,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [51143510] [2020-07-10 20:22:07,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:07,811 INFO L280 TraceCheckUtils]: 0: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-10 20:22:07,811 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {168#true} {168#true} #37#return; {168#true} is VALID [2020-07-10 20:22:07,812 INFO L263 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID [2020-07-10 20:22:07,812 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#true} assume true; {168#true} is VALID [2020-07-10 20:22:07,812 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {168#true} {168#true} #37#return; {168#true} is VALID [2020-07-10 20:22:07,813 INFO L263 TraceCheckUtils]: 3: Hoare triple {168#true} call #t~ret1 := main(); {168#true} is VALID [2020-07-10 20:22:07,813 INFO L280 TraceCheckUtils]: 4: Hoare triple {168#true} havoc ~i~0; {168#true} is VALID [2020-07-10 20:22:07,813 INFO L280 TraceCheckUtils]: 5: Hoare triple {168#true} ~sn~0 := 0; {168#true} is VALID [2020-07-10 20:22:07,815 INFO L280 TraceCheckUtils]: 6: Hoare triple {168#true} ~i~0 := 1; {172#(<= main_~i~0 1)} is VALID [2020-07-10 20:22:07,816 INFO L280 TraceCheckUtils]: 7: Hoare triple {172#(<= main_~i~0 1)} assume !(~i~0 <= 8); {169#false} is VALID [2020-07-10 20:22:07,817 INFO L263 TraceCheckUtils]: 8: Hoare triple {169#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {169#false} is VALID [2020-07-10 20:22:07,817 INFO L280 TraceCheckUtils]: 9: Hoare triple {169#false} ~cond := #in~cond; {169#false} is VALID [2020-07-10 20:22:07,817 INFO L280 TraceCheckUtils]: 10: Hoare triple {169#false} assume 0 == ~cond; {169#false} is VALID [2020-07-10 20:22:07,818 INFO L280 TraceCheckUtils]: 11: Hoare triple {169#false} assume !false; {169#false} is VALID [2020-07-10 20:22:07,819 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-10 20:22:07,819 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:07,820 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [51143510] [2020-07-10 20:22:07,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:07,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:22:07,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264497780] [2020-07-10 20:22:07,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-10 20:22:07,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:07,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:22:07,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:07,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:22:07,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:22:07,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:22:07,849 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2020-07-10 20:22:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:07,927 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-10 20:22:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:22:07,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-10 20:22:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:22:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-10 20:22:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:22:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2020-07-10 20:22:07,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2020-07-10 20:22:07,982 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-10 20:22:07,984 INFO L225 Difference]: With dead ends: 26 [2020-07-10 20:22:07,985 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 20:22:07,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:22:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 20:22:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2020-07-10 20:22:08,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:08,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 18 states. [2020-07-10 20:22:08,007 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 18 states. [2020-07-10 20:22:08,007 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 18 states. [2020-07-10 20:22:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,010 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 20:22:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 20:22:08,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:08,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:08,011 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 21 states. [2020-07-10 20:22:08,012 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 21 states. [2020-07-10 20:22:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:08,014 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 20:22:08,014 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 20:22:08,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:08,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:08,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:08,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 20:22:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-07-10 20:22:08,018 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2020-07-10 20:22:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:08,018 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-07-10 20:22:08,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:22:08,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2020-07-10 20:22:08,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-10 20:22:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 20:22:08,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:08,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:08,056 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:08,056 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash -917865259, now seen corresponding path program 1 times [2020-07-10 20:22:08,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:08,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [944395663] [2020-07-10 20:22:08,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-10 20:22:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:10,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-10 20:22:10,684 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {305#true} {305#true} #37#return; {305#true} is VALID [2020-07-10 20:22:10,685 INFO L263 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {305#true} is VALID [2020-07-10 20:22:10,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-10 20:22:10,685 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} #37#return; {305#true} is VALID [2020-07-10 20:22:10,686 INFO L263 TraceCheckUtils]: 3: Hoare triple {305#true} call #t~ret1 := main(); {305#true} is VALID [2020-07-10 20:22:10,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {305#true} havoc ~i~0; {305#true} is VALID [2020-07-10 20:22:10,688 INFO L280 TraceCheckUtils]: 5: Hoare triple {305#true} ~sn~0 := 0; {309#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:10,689 INFO L280 TraceCheckUtils]: 6: Hoare triple {309#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {310#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-10 20:22:10,692 INFO L280 TraceCheckUtils]: 7: Hoare triple {310#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [43] L13-6-->L13-7_primed: Formula: (let ((.cse0 (div (+ (* v_oct_main_~sn~0_in_1 (- 1)) v_oct_main_~sn~0_out_1 (- 4)) 2)) (.cse6 (div (+ v_oct_main_~sn~0_in_1 (* v_oct_main_~sn~0_out_1 (- 1)) 4) (- 2)))) (let ((.cse3 (+ .cse6 v_oct_main_~i~0_in_1 2)) (.cse2 (+ .cse6 v_oct_main_~i~0_in_1)) (.cse1 (+ v_oct_main_~i~0_in_1 .cse0 2))) (or (and (<= 0 .cse0) (<= v_oct_main_~i~0_out_1 .cse1) (<= .cse2 7) (<= .cse3 v_oct_main_~i~0_out_1)) (let ((.cse4 (+ v_oct_main_~i~0_in_1 1)) (.cse5 (+ v_oct_main_~sn~0_in_1 2))) (and (or (< v_oct_main_~i~0_out_1 .cse3) (< 7 .cse2) (< .cse0 0) (< .cse1 v_oct_main_~i~0_out_1)) (<= .cse4 v_oct_main_~i~0_out_1) (<= v_oct_main_~i~0_out_1 .cse4) (<= v_oct_main_~sn~0_out_1 .cse5) (<= .cse5 v_oct_main_~sn~0_out_1) (<= (* 2 v_oct_main_~i~0_in_1) 16)))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_1, main_~i~0=v_oct_main_~i~0_in_1} OutVars{main_~i~0=v_oct_main_~i~0_out_1, main_#t~post0=|v_oct_main_#t~post0_out_1|, main_~sn~0=v_oct_main_~sn~0_out_1} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {311#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-10 20:22:10,694 INFO L280 TraceCheckUtils]: 8: Hoare triple {311#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [42] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {312#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 20:22:10,695 INFO L263 TraceCheckUtils]: 9: Hoare triple {312#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {313#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:10,698 INFO L280 TraceCheckUtils]: 10: Hoare triple {313#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {314#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:10,698 INFO L280 TraceCheckUtils]: 11: Hoare triple {314#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {306#false} is VALID [2020-07-10 20:22:10,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {306#false} assume !false; {306#false} is VALID [2020-07-10 20:22:10,700 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-10 20:22:10,894 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:10,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [944395663] [2020-07-10 20:22:10,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:10,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:22:10,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872019945] [2020-07-10 20:22:10,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-07-10 20:22:10,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:10,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:22:10,924 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-10 20:22:10,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:22:10,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:22:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:22:10,926 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2020-07-10 20:22:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:11,242 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-10 20:22:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 20:22:11,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-07-10 20:22:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:22:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 20:22:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:22:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 20:22:11,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-10 20:22:11,283 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-10 20:22:11,285 INFO L225 Difference]: With dead ends: 29 [2020-07-10 20:22:11,285 INFO L226 Difference]: Without dead ends: 24 [2020-07-10 20:22:11,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:22:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-10 20:22:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-10 20:22:11,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:11,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-10 20:22:11,322 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-10 20:22:11,322 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-10 20:22:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:11,324 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-10 20:22:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-10 20:22:11,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:11,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:11,326 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-10 20:22:11,326 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-10 20:22:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:11,329 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-10 20:22:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-10 20:22:11,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:11,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:11,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:11,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 20:22:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-07-10 20:22:11,332 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2020-07-10 20:22:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:11,333 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-07-10 20:22:11,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:22:11,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2020-07-10 20:22:11,375 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-10 20:22:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-10 20:22:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 20:22:11,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:11,377 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:11,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:11,378 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2060587176, now seen corresponding path program 2 times [2020-07-10 20:22:11,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:11,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [634605364] [2020-07-10 20:22:11,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-10 20:22:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:13,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {475#true} assume true; {475#true} is VALID [2020-07-10 20:22:13,758 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {475#true} {475#true} #37#return; {475#true} is VALID [2020-07-10 20:22:13,759 INFO L263 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {475#true} is VALID [2020-07-10 20:22:13,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2020-07-10 20:22:13,760 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #37#return; {475#true} is VALID [2020-07-10 20:22:13,760 INFO L263 TraceCheckUtils]: 3: Hoare triple {475#true} call #t~ret1 := main(); {475#true} is VALID [2020-07-10 20:22:13,760 INFO L280 TraceCheckUtils]: 4: Hoare triple {475#true} havoc ~i~0; {475#true} is VALID [2020-07-10 20:22:13,761 INFO L280 TraceCheckUtils]: 5: Hoare triple {475#true} ~sn~0 := 0; {479#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:13,762 INFO L280 TraceCheckUtils]: 6: Hoare triple {479#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {480#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-10 20:22:13,764 INFO L280 TraceCheckUtils]: 7: Hoare triple {480#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [45] L13-6-->L13-7_primed: Formula: (let ((.cse1 (div (+ (* v_oct_main_~sn~0_in_2 (- 1)) v_oct_main_~sn~0_out_2 (- 4)) 2)) (.cse4 (div (+ v_oct_main_~sn~0_in_2 (* v_oct_main_~sn~0_out_2 (- 1)) 4) (- 2)))) (let ((.cse2 (+ v_oct_main_~i~0_in_2 .cse4 2)) (.cse0 (+ .cse1 v_oct_main_~i~0_in_2 2))) (or (and (<= v_oct_main_~i~0_out_2 .cse0) (<= 0 .cse1) (<= v_oct_main_~i~0_out_2 9) (<= .cse2 v_oct_main_~i~0_out_2)) (let ((.cse3 (+ v_oct_main_~sn~0_in_2 2)) (.cse5 (+ v_oct_main_~i~0_in_2 1))) (and (<= .cse3 v_oct_main_~sn~0_out_2) (or (< v_oct_main_~i~0_out_2 .cse2) (< 7 (+ v_oct_main_~i~0_in_2 .cse4)) (< .cse0 v_oct_main_~i~0_out_2) (< .cse1 0)) (<= v_oct_main_~sn~0_out_2 .cse3) (<= (* 2 v_oct_main_~i~0_in_2) 16) (<= .cse5 v_oct_main_~i~0_out_2) (<= v_oct_main_~i~0_out_2 .cse5)))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_2, main_~i~0=v_oct_main_~i~0_in_2} OutVars{main_~i~0=v_oct_main_~i~0_out_2, main_#t~post0=|v_oct_main_#t~post0_out_2|, main_~sn~0=v_oct_main_~sn~0_out_2} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {481#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-10 20:22:13,765 INFO L280 TraceCheckUtils]: 8: Hoare triple {481#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [44] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {482#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 20:22:13,767 INFO L263 TraceCheckUtils]: 9: Hoare triple {482#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {483#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:13,767 INFO L280 TraceCheckUtils]: 10: Hoare triple {483#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {484#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:13,768 INFO L280 TraceCheckUtils]: 11: Hoare triple {484#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {476#false} is VALID [2020-07-10 20:22:13,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {476#false} assume !false; {476#false} is VALID [2020-07-10 20:22:13,769 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-10 20:22:14,062 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:14,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [634605364] [2020-07-10 20:22:14,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:14,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 20:22:14,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931670128] [2020-07-10 20:22:14,064 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-07-10 20:22:14,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:14,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 20:22:14,109 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-10 20:22:14,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 20:22:14,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 20:22:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-10 20:22:14,111 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 15 states. [2020-07-10 20:22:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:14,541 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 20:22:14,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 20:22:14,541 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-07-10 20:22:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:22:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2020-07-10 20:22:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:22:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 34 transitions. [2020-07-10 20:22:14,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 34 transitions. [2020-07-10 20:22:14,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:14,606 INFO L225 Difference]: With dead ends: 34 [2020-07-10 20:22:14,606 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 20:22:14,607 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-07-10 20:22:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 20:22:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-07-10 20:22:14,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:14,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2020-07-10 20:22:14,655 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2020-07-10 20:22:14,655 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2020-07-10 20:22:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:14,658 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-10 20:22:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-10 20:22:14,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:14,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:14,659 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2020-07-10 20:22:14,659 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2020-07-10 20:22:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:14,661 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-10 20:22:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2020-07-10 20:22:14,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:14,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:14,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:14,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 20:22:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2020-07-10 20:22:14,665 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2020-07-10 20:22:14,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:14,665 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2020-07-10 20:22:14,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 20:22:14,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2020-07-10 20:22:14,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 20:22:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 20:22:14,700 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:14,700 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:14,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:22:14,700 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:14,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:14,701 INFO L82 PathProgramCache]: Analyzing trace with hash 657233589, now seen corresponding path program 3 times [2020-07-10 20:22:14,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:14,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [857418657] [2020-07-10 20:22:14,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 19 to 37 [2020-07-10 20:22:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:17,089 INFO L280 TraceCheckUtils]: 0: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-10 20:22:17,090 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {679#true} {679#true} #37#return; {679#true} is VALID [2020-07-10 20:22:17,090 INFO L263 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2020-07-10 20:22:17,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {679#true} assume true; {679#true} is VALID [2020-07-10 20:22:17,091 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {679#true} {679#true} #37#return; {679#true} is VALID [2020-07-10 20:22:17,091 INFO L263 TraceCheckUtils]: 3: Hoare triple {679#true} call #t~ret1 := main(); {679#true} is VALID [2020-07-10 20:22:17,091 INFO L280 TraceCheckUtils]: 4: Hoare triple {679#true} havoc ~i~0; {679#true} is VALID [2020-07-10 20:22:17,100 INFO L280 TraceCheckUtils]: 5: Hoare triple {679#true} ~sn~0 := 0; {683#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:17,101 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {684#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-10 20:22:17,104 INFO L280 TraceCheckUtils]: 7: Hoare triple {684#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [47] L13-6-->L13-7_primed: Formula: (let ((.cse4 (div (+ (* v_oct_main_~sn~0_out_3 (- 1)) v_oct_main_~sn~0_in_3 4) (- 2)))) (let ((.cse0 (+ .cse4 v_oct_main_~i~0_in_3 2)) (.cse1 (div (+ (* v_oct_main_~sn~0_in_3 (- 1)) v_oct_main_~sn~0_out_3 (- 4)) 2))) (or (and (<= .cse0 v_oct_main_~i~0_out_3) (<= 0 .cse1) (<= v_oct_main_~i~0_out_3 9) (<= v_oct_main_~i~0_out_3 (+ v_oct_main_~i~0_in_3 .cse1 2))) (let ((.cse2 (+ v_oct_main_~sn~0_in_3 2)) (.cse3 (+ v_oct_main_~i~0_in_3 1))) (and (<= (* 2 v_oct_main_~i~0_in_3) 16) (<= .cse2 v_oct_main_~sn~0_out_3) (<= v_oct_main_~sn~0_out_3 .cse2) (<= .cse3 v_oct_main_~i~0_out_3) (or (< .cse1 0) (< 7 (+ .cse4 v_oct_main_~i~0_in_3)) (< v_oct_main_~i~0_out_3 .cse0) (< (+ .cse1 v_oct_main_~i~0_in_3 2) v_oct_main_~i~0_out_3)) (<= v_oct_main_~i~0_out_3 .cse3)))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_3, main_~i~0=v_oct_main_~i~0_in_3} OutVars{main_~i~0=v_oct_main_~i~0_out_3, main_#t~post0=|v_oct_main_#t~post0_out_3|, main_~sn~0=v_oct_main_~sn~0_out_3} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {685#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-10 20:22:17,105 INFO L280 TraceCheckUtils]: 8: Hoare triple {685#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [46] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {686#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 20:22:17,106 INFO L263 TraceCheckUtils]: 9: Hoare triple {686#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {687#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:17,107 INFO L280 TraceCheckUtils]: 10: Hoare triple {687#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {688#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:17,110 INFO L280 TraceCheckUtils]: 11: Hoare triple {688#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {680#false} is VALID [2020-07-10 20:22:17,110 INFO L280 TraceCheckUtils]: 12: Hoare triple {680#false} assume !false; {680#false} is VALID [2020-07-10 20:22:17,111 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-10 20:22:17,602 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:17,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [857418657] [2020-07-10 20:22:17,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:17,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-10 20:22:17,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012676267] [2020-07-10 20:22:17,604 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-07-10 20:22:17,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:17,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 20:22:17,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:17,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 20:22:17,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:17,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 20:22:17,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-07-10 20:22:17,654 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 19 states. [2020-07-10 20:22:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:18,125 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-10 20:22:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 20:22:18,125 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2020-07-10 20:22:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 20:22:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2020-07-10 20:22:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 20:22:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2020-07-10 20:22:18,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 39 transitions. [2020-07-10 20:22:18,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:18,183 INFO L225 Difference]: With dead ends: 39 [2020-07-10 20:22:18,183 INFO L226 Difference]: Without dead ends: 34 [2020-07-10 20:22:18,184 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2020-07-10 20:22:18,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-10 20:22:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-10 20:22:18,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:18,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-10 20:22:18,229 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-10 20:22:18,229 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-10 20:22:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:18,231 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 20:22:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 20:22:18,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:18,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:18,233 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-10 20:22:18,233 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-10 20:22:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:18,235 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-10 20:22:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 20:22:18,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:18,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:18,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:18,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 20:22:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2020-07-10 20:22:18,238 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2020-07-10 20:22:18,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:18,239 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2020-07-10 20:22:18,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 20:22:18,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2020-07-10 20:22:18,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2020-07-10 20:22:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-10 20:22:18,290 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:18,291 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:18,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:22:18,291 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:18,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1410268808, now seen corresponding path program 4 times [2020-07-10 20:22:18,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:18,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [289788893] [2020-07-10 20:22:18,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-10 20:22:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:20,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {917#true} assume true; {917#true} is VALID [2020-07-10 20:22:20,687 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {917#true} {917#true} #37#return; {917#true} is VALID [2020-07-10 20:22:20,687 INFO L263 TraceCheckUtils]: 0: Hoare triple {917#true} call ULTIMATE.init(); {917#true} is VALID [2020-07-10 20:22:20,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {917#true} assume true; {917#true} is VALID [2020-07-10 20:22:20,688 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {917#true} {917#true} #37#return; {917#true} is VALID [2020-07-10 20:22:20,688 INFO L263 TraceCheckUtils]: 3: Hoare triple {917#true} call #t~ret1 := main(); {917#true} is VALID [2020-07-10 20:22:20,688 INFO L280 TraceCheckUtils]: 4: Hoare triple {917#true} havoc ~i~0; {917#true} is VALID [2020-07-10 20:22:20,689 INFO L280 TraceCheckUtils]: 5: Hoare triple {917#true} ~sn~0 := 0; {921#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:20,690 INFO L280 TraceCheckUtils]: 6: Hoare triple {921#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {922#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-10 20:22:20,692 INFO L280 TraceCheckUtils]: 7: Hoare triple {922#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [49] L13-6-->L13-7_primed: Formula: (let ((.cse4 (div (+ v_oct_main_~sn~0_out_4 (* v_oct_main_~sn~0_in_4 (- 1)) (- 4)) 2)) (.cse5 (div (+ (* v_oct_main_~sn~0_out_4 (- 1)) v_oct_main_~sn~0_in_4 4) (- 2)))) (let ((.cse3 (+ v_oct_main_~i~0_in_4 .cse5 2)) (.cse2 (+ v_oct_main_~i~0_in_4 .cse4 2))) (or (let ((.cse1 (+ v_oct_main_~i~0_in_4 1)) (.cse0 (+ v_oct_main_~sn~0_in_4 2))) (and (<= .cse0 v_oct_main_~sn~0_out_4) (<= v_oct_main_~i~0_out_4 .cse1) (or (< .cse2 v_oct_main_~i~0_out_4) (< v_oct_main_~i~0_out_4 .cse3) (< .cse4 0) (< 9 v_oct_main_~i~0_out_4)) (<= .cse1 v_oct_main_~i~0_out_4) (<= v_oct_main_~sn~0_out_4 .cse0) (<= (* 2 v_oct_main_~i~0_in_4) 16))) (and (<= .cse3 v_oct_main_~i~0_out_4) (<= (+ v_oct_main_~i~0_in_4 .cse5) 7) (<= v_oct_main_~i~0_out_4 .cse2) (<= 0 .cse4))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_4, main_~i~0=v_oct_main_~i~0_in_4} OutVars{main_~i~0=v_oct_main_~i~0_out_4, main_#t~post0=|v_oct_main_#t~post0_out_4|, main_~sn~0=v_oct_main_~sn~0_out_4} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {923#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-10 20:22:20,693 INFO L280 TraceCheckUtils]: 8: Hoare triple {923#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [48] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {924#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 20:22:20,695 INFO L263 TraceCheckUtils]: 9: Hoare triple {924#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {925#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:20,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {925#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {926#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:20,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {926#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {918#false} is VALID [2020-07-10 20:22:20,697 INFO L280 TraceCheckUtils]: 12: Hoare triple {918#false} assume !false; {918#false} is VALID [2020-07-10 20:22:20,698 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-10 20:22:21,402 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:21,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [289788893] [2020-07-10 20:22:21,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:21,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-07-10 20:22:21,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089443800] [2020-07-10 20:22:21,404 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2020-07-10 20:22:21,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:21,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-10 20:22:21,453 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-10 20:22:21,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-10 20:22:21,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:21,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-10 20:22:21,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2020-07-10 20:22:21,455 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 23 states. [2020-07-10 20:22:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:22,040 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-10 20:22:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-10 20:22:22,041 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2020-07-10 20:22:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 20:22:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 44 transitions. [2020-07-10 20:22:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 20:22:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 44 transitions. [2020-07-10 20:22:22,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 44 transitions. [2020-07-10 20:22:22,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:22,131 INFO L225 Difference]: With dead ends: 44 [2020-07-10 20:22:22,131 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 20:22:22,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2020-07-10 20:22:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 20:22:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-07-10 20:22:22,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:22,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2020-07-10 20:22:22,206 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2020-07-10 20:22:22,206 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2020-07-10 20:22:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:22,208 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-10 20:22:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-07-10 20:22:22,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:22,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:22,209 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2020-07-10 20:22:22,209 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2020-07-10 20:22:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:22,212 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-10 20:22:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-07-10 20:22:22,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:22,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:22,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:22,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 20:22:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-10 20:22:22,215 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2020-07-10 20:22:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:22,215 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-10 20:22:22,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-10 20:22:22,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-10 20:22:22,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-10 20:22:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:22:22,272 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:22,273 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:22,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:22:22,273 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1340090219, now seen corresponding path program 5 times [2020-07-10 20:22:22,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:22,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807731034] [2020-07-10 20:22:22,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 19 to 37 [2020-07-10 20:22:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:24,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {1189#true} assume true; {1189#true} is VALID [2020-07-10 20:22:24,633 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1189#true} {1189#true} #37#return; {1189#true} is VALID [2020-07-10 20:22:24,633 INFO L263 TraceCheckUtils]: 0: Hoare triple {1189#true} call ULTIMATE.init(); {1189#true} is VALID [2020-07-10 20:22:24,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {1189#true} assume true; {1189#true} is VALID [2020-07-10 20:22:24,634 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1189#true} {1189#true} #37#return; {1189#true} is VALID [2020-07-10 20:22:24,634 INFO L263 TraceCheckUtils]: 3: Hoare triple {1189#true} call #t~ret1 := main(); {1189#true} is VALID [2020-07-10 20:22:24,635 INFO L280 TraceCheckUtils]: 4: Hoare triple {1189#true} havoc ~i~0; {1189#true} is VALID [2020-07-10 20:22:24,636 INFO L280 TraceCheckUtils]: 5: Hoare triple {1189#true} ~sn~0 := 0; {1193#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:24,637 INFO L280 TraceCheckUtils]: 6: Hoare triple {1193#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {1194#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-10 20:22:24,640 INFO L280 TraceCheckUtils]: 7: Hoare triple {1194#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [51] L13-6-->L13-7_primed: Formula: (let ((.cse5 (div (+ v_oct_main_~sn~0_out_5 (* v_oct_main_~sn~0_in_5 (- 1)) (- 4)) 2)) (.cse6 (div (+ (* v_oct_main_~sn~0_out_5 (- 1)) v_oct_main_~sn~0_in_5 4) (- 2)))) (let ((.cse4 (+ .cse6 v_oct_main_~i~0_in_5 2)) (.cse2 (+ .cse6 v_oct_main_~i~0_in_5)) (.cse3 (+ v_oct_main_~i~0_in_5 .cse5 2))) (or (let ((.cse0 (+ v_oct_main_~sn~0_in_5 2)) (.cse1 (+ v_oct_main_~i~0_in_5 1))) (and (<= v_oct_main_~sn~0_out_5 .cse0) (<= .cse1 v_oct_main_~i~0_out_5) (<= .cse0 v_oct_main_~sn~0_out_5) (<= (* 2 v_oct_main_~i~0_in_5) 16) (or (< 7 .cse2) (< .cse3 v_oct_main_~i~0_out_5) (< v_oct_main_~i~0_out_5 .cse4) (< .cse5 0)) (<= v_oct_main_~i~0_out_5 .cse1))) (and (<= .cse4 v_oct_main_~i~0_out_5) (<= 0 .cse5) (<= .cse2 7) (<= v_oct_main_~i~0_out_5 .cse3))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_5, main_~i~0=v_oct_main_~i~0_in_5} OutVars{main_~i~0=v_oct_main_~i~0_out_5, main_#t~post0=|v_oct_main_#t~post0_out_5|, main_~sn~0=v_oct_main_~sn~0_out_5} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {1195#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-10 20:22:24,641 INFO L280 TraceCheckUtils]: 8: Hoare triple {1195#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [50] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1196#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 20:22:24,643 INFO L263 TraceCheckUtils]: 9: Hoare triple {1196#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1197#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:24,644 INFO L280 TraceCheckUtils]: 10: Hoare triple {1197#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1198#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:24,645 INFO L280 TraceCheckUtils]: 11: Hoare triple {1198#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1190#false} is VALID [2020-07-10 20:22:24,646 INFO L280 TraceCheckUtils]: 12: Hoare triple {1190#false} assume !false; {1190#false} is VALID [2020-07-10 20:22:24,646 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-10 20:22:25,568 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:25,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807731034] [2020-07-10 20:22:25,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:25,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-07-10 20:22:25,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189740225] [2020-07-10 20:22:25,569 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2020-07-10 20:22:25,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:25,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2020-07-10 20:22:25,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:25,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-10 20:22:25,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:25,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-10 20:22:25,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2020-07-10 20:22:25,633 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 27 states. [2020-07-10 20:22:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:26,141 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-10 20:22:26,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-10 20:22:26,141 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2020-07-10 20:22:26,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 20:22:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 49 transitions. [2020-07-10 20:22:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 20:22:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 49 transitions. [2020-07-10 20:22:26,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 49 transitions. [2020-07-10 20:22:26,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:26,213 INFO L225 Difference]: With dead ends: 49 [2020-07-10 20:22:26,213 INFO L226 Difference]: Without dead ends: 44 [2020-07-10 20:22:26,214 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2020-07-10 20:22:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-10 20:22:26,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-10 20:22:26,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:26,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2020-07-10 20:22:26,274 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2020-07-10 20:22:26,274 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2020-07-10 20:22:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:26,277 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-10 20:22:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-07-10 20:22:26,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:26,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:26,277 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2020-07-10 20:22:26,278 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2020-07-10 20:22:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:26,280 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-07-10 20:22:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-07-10 20:22:26,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:26,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:26,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:26,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 20:22:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2020-07-10 20:22:26,283 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 37 [2020-07-10 20:22:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:26,283 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2020-07-10 20:22:26,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-10 20:22:26,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2020-07-10 20:22:26,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-10 20:22:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 20:22:26,351 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:26,351 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:26,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:22:26,352 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash 740027288, now seen corresponding path program 6 times [2020-07-10 20:22:26,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:26,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [895018291] [2020-07-10 20:22:26,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-10 20:22:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:28,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-10 20:22:28,693 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1495#true} {1495#true} #37#return; {1495#true} is VALID [2020-07-10 20:22:28,693 INFO L263 TraceCheckUtils]: 0: Hoare triple {1495#true} call ULTIMATE.init(); {1495#true} is VALID [2020-07-10 20:22:28,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {1495#true} assume true; {1495#true} is VALID [2020-07-10 20:22:28,694 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1495#true} {1495#true} #37#return; {1495#true} is VALID [2020-07-10 20:22:28,694 INFO L263 TraceCheckUtils]: 3: Hoare triple {1495#true} call #t~ret1 := main(); {1495#true} is VALID [2020-07-10 20:22:28,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {1495#true} havoc ~i~0; {1495#true} is VALID [2020-07-10 20:22:28,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {1495#true} ~sn~0 := 0; {1499#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:28,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {1499#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {1500#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-10 20:22:28,698 INFO L280 TraceCheckUtils]: 7: Hoare triple {1500#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [53] L13-6-->L13-7_primed: Formula: (let ((.cse1 (div (+ (* v_oct_main_~sn~0_out_6 (- 1)) v_oct_main_~sn~0_in_6 4) (- 2))) (.cse3 (div (+ v_oct_main_~sn~0_out_6 (* v_oct_main_~sn~0_in_6 (- 1)) (- 4)) 2))) (let ((.cse0 (+ .cse3 v_oct_main_~i~0_in_6 2)) (.cse2 (+ .cse1 v_oct_main_~i~0_in_6 2))) (or (and (<= v_oct_main_~i~0_out_6 .cse0) (<= (+ .cse1 v_oct_main_~i~0_in_6) 7) (<= .cse2 v_oct_main_~i~0_out_6) (<= 0 .cse3)) (let ((.cse5 (+ v_oct_main_~i~0_in_6 1)) (.cse4 (+ v_oct_main_~sn~0_in_6 2))) (and (<= .cse4 v_oct_main_~sn~0_out_6) (<= v_oct_main_~i~0_out_6 .cse5) (or (< .cse0 v_oct_main_~i~0_out_6) (< v_oct_main_~i~0_out_6 .cse2) (< 9 v_oct_main_~i~0_out_6) (< .cse3 0)) (<= .cse5 v_oct_main_~i~0_out_6) (<= (* 2 v_oct_main_~i~0_in_6) 16) (<= v_oct_main_~sn~0_out_6 .cse4)))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_6, main_~i~0=v_oct_main_~i~0_in_6} OutVars{main_~i~0=v_oct_main_~i~0_out_6, main_#t~post0=|v_oct_main_#t~post0_out_6|, main_~sn~0=v_oct_main_~sn~0_out_6} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {1501#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-10 20:22:28,700 INFO L280 TraceCheckUtils]: 8: Hoare triple {1501#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [52] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1502#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 20:22:28,701 INFO L263 TraceCheckUtils]: 9: Hoare triple {1502#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1503#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:28,701 INFO L280 TraceCheckUtils]: 10: Hoare triple {1503#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1504#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:28,702 INFO L280 TraceCheckUtils]: 11: Hoare triple {1504#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1496#false} is VALID [2020-07-10 20:22:28,702 INFO L280 TraceCheckUtils]: 12: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2020-07-10 20:22:28,702 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-10 20:22:29,811 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:29,811 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [895018291] [2020-07-10 20:22:29,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:29,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2020-07-10 20:22:29,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027883127] [2020-07-10 20:22:29,813 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2020-07-10 20:22:29,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:29,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2020-07-10 20:22:29,875 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-10 20:22:29,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-07-10 20:22:29,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:29,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-07-10 20:22:29,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2020-07-10 20:22:29,877 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 31 states. [2020-07-10 20:22:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:30,620 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-10 20:22:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-10 20:22:30,620 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2020-07-10 20:22:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 20:22:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2020-07-10 20:22:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 20:22:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 54 transitions. [2020-07-10 20:22:30,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 54 transitions. [2020-07-10 20:22:30,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:30,713 INFO L225 Difference]: With dead ends: 54 [2020-07-10 20:22:30,714 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 20:22:30,715 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=850, Unknown=0, NotChecked=0, Total=1056 [2020-07-10 20:22:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 20:22:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2020-07-10 20:22:30,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:30,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2020-07-10 20:22:30,780 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2020-07-10 20:22:30,781 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2020-07-10 20:22:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:30,783 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-10 20:22:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-10 20:22:30,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:30,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:30,784 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2020-07-10 20:22:30,784 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2020-07-10 20:22:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:30,786 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-10 20:22:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-07-10 20:22:30,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:30,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:30,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:30,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 20:22:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-07-10 20:22:30,789 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 42 [2020-07-10 20:22:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:30,789 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-07-10 20:22:30,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-07-10 20:22:30,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2020-07-10 20:22:30,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-10 20:22:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-10 20:22:30,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:30,860 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:30,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:22:30,861 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1053966965, now seen corresponding path program 7 times [2020-07-10 20:22:30,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:30,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1644411114] [2020-07-10 20:22:30,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-10 20:22:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:33,207 INFO L280 TraceCheckUtils]: 0: Hoare triple {1835#true} assume true; {1835#true} is VALID [2020-07-10 20:22:33,207 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1835#true} {1835#true} #37#return; {1835#true} is VALID [2020-07-10 20:22:33,207 INFO L263 TraceCheckUtils]: 0: Hoare triple {1835#true} call ULTIMATE.init(); {1835#true} is VALID [2020-07-10 20:22:33,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {1835#true} assume true; {1835#true} is VALID [2020-07-10 20:22:33,208 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1835#true} {1835#true} #37#return; {1835#true} is VALID [2020-07-10 20:22:33,208 INFO L263 TraceCheckUtils]: 3: Hoare triple {1835#true} call #t~ret1 := main(); {1835#true} is VALID [2020-07-10 20:22:33,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {1835#true} havoc ~i~0; {1835#true} is VALID [2020-07-10 20:22:33,215 INFO L280 TraceCheckUtils]: 5: Hoare triple {1835#true} ~sn~0 := 0; {1839#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:33,221 INFO L280 TraceCheckUtils]: 6: Hoare triple {1839#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {1840#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-10 20:22:33,224 INFO L280 TraceCheckUtils]: 7: Hoare triple {1840#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [55] L13-6-->L13-7_primed: Formula: (let ((.cse2 (div (+ (* v_oct_main_~sn~0_out_7 (- 1)) v_oct_main_~sn~0_in_7 4) (- 2)))) (let ((.cse0 (+ .cse2 v_oct_main_~i~0_in_7 2)) (.cse3 (+ v_oct_main_~i~0_in_7 2)) (.cse1 (+ (div (+ (* v_oct_main_~sn~0_in_7 (- 1)) v_oct_main_~sn~0_out_7 (- 4)) 2) v_oct_main_~i~0_in_7 2))) (or (and (<= .cse0 v_oct_main_~i~0_out_7) (<= v_oct_main_~i~0_out_7 .cse1) (<= (+ .cse2 v_oct_main_~i~0_in_7) 7) (<= .cse3 v_oct_main_~i~0_out_7)) (let ((.cse5 (+ v_oct_main_~i~0_in_7 1)) (.cse4 (+ v_oct_main_~sn~0_in_7 2))) (and (<= .cse4 v_oct_main_~sn~0_out_7) (<= v_oct_main_~i~0_out_7 .cse5) (<= (* 2 v_oct_main_~i~0_in_7) 16) (<= .cse5 v_oct_main_~i~0_out_7) (<= v_oct_main_~sn~0_out_7 .cse4) (or (< v_oct_main_~i~0_out_7 .cse0) (< v_oct_main_~i~0_out_7 .cse3) (< .cse1 v_oct_main_~i~0_out_7) (< 9 v_oct_main_~i~0_out_7))))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_7, main_~i~0=v_oct_main_~i~0_in_7} OutVars{main_~i~0=v_oct_main_~i~0_out_7, main_#t~post0=|v_oct_main_#t~post0_out_7|, main_~sn~0=v_oct_main_~sn~0_out_7} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {1841#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-10 20:22:33,227 INFO L280 TraceCheckUtils]: 8: Hoare triple {1841#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [54] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {1842#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 20:22:33,228 INFO L263 TraceCheckUtils]: 9: Hoare triple {1842#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1843#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:33,228 INFO L280 TraceCheckUtils]: 10: Hoare triple {1843#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1844#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:33,229 INFO L280 TraceCheckUtils]: 11: Hoare triple {1844#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1836#false} is VALID [2020-07-10 20:22:33,229 INFO L280 TraceCheckUtils]: 12: Hoare triple {1836#false} assume !false; {1836#false} is VALID [2020-07-10 20:22:33,230 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-10 20:22:34,547 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:34,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1644411114] [2020-07-10 20:22:34,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:34,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2020-07-10 20:22:34,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054782659] [2020-07-10 20:22:34,549 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2020-07-10 20:22:34,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:34,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2020-07-10 20:22:34,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:34,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-07-10 20:22:34,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:34,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-07-10 20:22:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1014, Unknown=0, NotChecked=0, Total=1260 [2020-07-10 20:22:34,616 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 35 states. [2020-07-10 20:22:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:35,263 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-07-10 20:22:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-10 20:22:35,263 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2020-07-10 20:22:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 20:22:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2020-07-10 20:22:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 20:22:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 59 transitions. [2020-07-10 20:22:35,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 59 transitions. [2020-07-10 20:22:35,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:35,351 INFO L225 Difference]: With dead ends: 59 [2020-07-10 20:22:35,351 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 20:22:35,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=1074, Unknown=0, NotChecked=0, Total=1332 [2020-07-10 20:22:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 20:22:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-07-10 20:22:35,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:35,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2020-07-10 20:22:35,442 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2020-07-10 20:22:35,443 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2020-07-10 20:22:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:35,446 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-10 20:22:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-07-10 20:22:35,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:35,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:35,448 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2020-07-10 20:22:35,448 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2020-07-10 20:22:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:35,450 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-07-10 20:22:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2020-07-10 20:22:35,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:35,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:35,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:35,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-10 20:22:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2020-07-10 20:22:35,453 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2020-07-10 20:22:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:35,454 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2020-07-10 20:22:35,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-07-10 20:22:35,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2020-07-10 20:22:35,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-10 20:22:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-10 20:22:35,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:35,527 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:35,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 20:22:35,528 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:35,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1480544840, now seen corresponding path program 8 times [2020-07-10 20:22:35,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:35,529 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1276758] [2020-07-10 20:22:35,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 11 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 11 to 19 Garbage collection #2: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 [2020-07-10 20:22:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:37,889 INFO L280 TraceCheckUtils]: 0: Hoare triple {2209#true} assume true; {2209#true} is VALID [2020-07-10 20:22:37,890 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2209#true} {2209#true} #37#return; {2209#true} is VALID [2020-07-10 20:22:37,890 INFO L263 TraceCheckUtils]: 0: Hoare triple {2209#true} call ULTIMATE.init(); {2209#true} is VALID [2020-07-10 20:22:37,890 INFO L280 TraceCheckUtils]: 1: Hoare triple {2209#true} assume true; {2209#true} is VALID [2020-07-10 20:22:37,890 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2209#true} {2209#true} #37#return; {2209#true} is VALID [2020-07-10 20:22:37,891 INFO L263 TraceCheckUtils]: 3: Hoare triple {2209#true} call #t~ret1 := main(); {2209#true} is VALID [2020-07-10 20:22:37,891 INFO L280 TraceCheckUtils]: 4: Hoare triple {2209#true} havoc ~i~0; {2209#true} is VALID [2020-07-10 20:22:37,892 INFO L280 TraceCheckUtils]: 5: Hoare triple {2209#true} ~sn~0 := 0; {2213#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-10 20:22:37,892 INFO L280 TraceCheckUtils]: 6: Hoare triple {2213#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {2214#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} is VALID [2020-07-10 20:22:37,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {2214#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (<= main_~i~0 1))} [57] L13-6-->L13-7_primed: Formula: (let ((.cse5 (div (+ v_oct_main_~sn~0_out_8 (* v_oct_main_~sn~0_in_8 (- 1)) (- 4)) 2)) (.cse1 (div (+ (* v_oct_main_~sn~0_out_8 (- 1)) v_oct_main_~sn~0_in_8 4) (- 2)))) (let ((.cse0 (+ .cse1 v_oct_main_~i~0_in_8 2)) (.cse2 (+ .cse5 v_oct_main_~i~0_in_8 2))) (or (and (<= .cse0 v_oct_main_~i~0_out_8) (<= (+ v_oct_main_~i~0_in_8 2) v_oct_main_~i~0_out_8) (<= (+ .cse1 v_oct_main_~i~0_in_8) 7) (<= v_oct_main_~i~0_out_8 .cse2)) (let ((.cse4 (+ v_oct_main_~sn~0_in_8 2)) (.cse3 (+ v_oct_main_~i~0_in_8 1))) (and (<= (* 2 v_oct_main_~i~0_in_8) 16) (<= v_oct_main_~i~0_out_8 .cse3) (<= .cse4 v_oct_main_~sn~0_out_8) (<= v_oct_main_~sn~0_out_8 .cse4) (<= .cse3 v_oct_main_~i~0_out_8) (or (< v_oct_main_~i~0_out_8 .cse0) (< .cse2 v_oct_main_~i~0_out_8) (< 9 v_oct_main_~i~0_out_8) (< .cse5 0))))))) InVars {main_~sn~0=v_oct_main_~sn~0_in_8, main_~i~0=v_oct_main_~i~0_in_8} OutVars{main_~i~0=v_oct_main_~i~0_out_8, main_#t~post0=|v_oct_main_#t~post0_out_8|, main_~sn~0=v_oct_main_~sn~0_out_8} AuxVars[] AssignedVars[main_#t~post0, main_~sn~0, main_~i~0] {2215#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} is VALID [2020-07-10 20:22:37,897 INFO L280 TraceCheckUtils]: 8: Hoare triple {2215#(or (<= main_~i~0 2) (and (<= main_~sn~0 16) (or (<= (* 2 main_~i~0) (+ main_~sn~0 2)) (< 15 main_~sn~0))))} [56] L13-7_primed-->L13-7: Formula: (not (<= v_main_~i~0_5 8)) InVars {main_~i~0=v_main_~i~0_5} OutVars{main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {2216#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} is VALID [2020-07-10 20:22:37,899 INFO L263 TraceCheckUtils]: 9: Hoare triple {2216#(and (<= main_~sn~0 16) (<= 16 main_~sn~0))} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2217#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:37,900 INFO L280 TraceCheckUtils]: 10: Hoare triple {2217#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2218#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:37,900 INFO L280 TraceCheckUtils]: 11: Hoare triple {2218#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2210#false} is VALID [2020-07-10 20:22:37,900 INFO L280 TraceCheckUtils]: 12: Hoare triple {2210#false} assume !false; {2210#false} is VALID [2020-07-10 20:22:37,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-10 20:22:39,529 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:39,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1276758] [2020-07-10 20:22:39,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:39,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2020-07-10 20:22:39,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41248896] [2020-07-10 20:22:39,530 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2020-07-10 20:22:39,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:39,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2020-07-10 20:22:39,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:39,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-07-10 20:22:39,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:39,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-07-10 20:22:39,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1332, Unknown=0, NotChecked=0, Total=1640 [2020-07-10 20:22:39,612 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 39 states. [2020-07-10 20:22:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:40,229 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-07-10 20:22:40,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-07-10 20:22:40,229 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2020-07-10 20:22:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 20:22:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-07-10 20:22:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-10 20:22:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-07-10 20:22:40,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2020-07-10 20:22:40,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:40,314 INFO L225 Difference]: With dead ends: 53 [2020-07-10 20:22:40,314 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:22:40,316 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=325, Invalid=1481, Unknown=0, NotChecked=0, Total=1806 [2020-07-10 20:22:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:22:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:22:40,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:40,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:40,317 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:40,317 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:40,318 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:40,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:40,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:40,318 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:40,318 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:40,318 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:40,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:40,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:40,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:40,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:22:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:22:40,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2020-07-10 20:22:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:40,319 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:22:40,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-07-10 20:22:40,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:22:40,320 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-10 20:22:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:40,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:40,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 20:22:40,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:22:40,708 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:40,708 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:40,708 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:40,708 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:40,708 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:22:40,708 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:40,708 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-10 20:22:40,708 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: true [2020-07-10 20:22:40,709 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= main_~i~0 8) (<= .cse1 .cse0))) [2020-07-10 20:22:40,709 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~sn~0 0) (<= 0 main_~sn~0)) [2020-07-10 20:22:40,709 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 17) the Hoare annotation is: true [2020-07-10 20:22:40,709 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-10 20:22:40,709 INFO L264 CegarLoopResult]: At program point L13-3(lines 13 15) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= main_~sn~0 .cse0) (<= main_~i~0 8) (<= .cse0 main_~sn~0))) [2020-07-10 20:22:40,709 INFO L264 CegarLoopResult]: At program point L13-4(line 13) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (<= main_~sn~0 .cse0) (<= main_~i~0 8) (<= .cse0 main_~sn~0) (= |main_#t~post0| main_~i~0))) [2020-07-10 20:22:40,709 INFO L264 CegarLoopResult]: At program point L13-5(line 13) the Hoare annotation is: (let ((.cse0 (* 2 |main_#t~post0|))) (and (<= main_~sn~0 .cse0) (= main_~i~0 (+ |main_#t~post0| 1)) (<= .cse0 main_~sn~0) (<= |main_#t~post0| 8))) [2020-07-10 20:22:40,709 INFO L264 CegarLoopResult]: At program point L13-6(lines 13 15) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= main_~i~0 9))) [2020-07-10 20:22:40,710 INFO L264 CegarLoopResult]: At program point L13-7(lines 13 15) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (< 8 main_~i~0) (<= main_~i~0 9))) [2020-07-10 20:22:40,710 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 20:22:40,710 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 3 8) the Hoare annotation is: true [2020-07-10 20:22:40,710 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:40,710 INFO L264 CegarLoopResult]: At program point L4(lines 4 6) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:40,710 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:40,710 INFO L271 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: true [2020-07-10 20:22:40,721 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-10 20:22:40,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:22:40 BoogieIcfgContainer [2020-07-10 20:22:40,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:22:40,737 INFO L168 Benchmark]: Toolchain (without parser) took 34415.79 ms. Allocated memory was 134.7 MB in the beginning and 376.4 MB in the end (delta: 241.7 MB). Free memory was 99.7 MB in the beginning and 169.3 MB in the end (delta: -69.6 MB). Peak memory consumption was 172.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:40,738 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:40,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.17 ms. Allocated memory is still 134.7 MB. Free memory was 99.5 MB in the beginning and 89.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:40,739 INFO L168 Benchmark]: Boogie Preprocessor took 129.80 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 89.9 MB in the beginning and 179.3 MB in the end (delta: -89.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:40,740 INFO L168 Benchmark]: RCFGBuilder took 355.00 ms. Allocated memory is still 199.2 MB. Free memory was 179.3 MB in the beginning and 164.1 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:40,740 INFO L168 Benchmark]: TraceAbstraction took 33668.74 ms. Allocated memory was 199.2 MB in the beginning and 376.4 MB in the end (delta: 177.2 MB). Free memory was 163.4 MB in the beginning and 174.6 MB in the end (delta: -11.2 MB). Peak memory consumption was 166.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:40,744 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.22 ms. Allocated memory is still 134.7 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 250.17 ms. Allocated memory is still 134.7 MB. Free memory was 99.5 MB in the beginning and 89.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.80 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 89.9 MB in the beginning and 179.3 MB in the end (delta: -89.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 355.00 ms. Allocated memory is still 199.2 MB. Free memory was 179.3 MB in the beginning and 164.1 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33668.74 ms. Allocated memory was 199.2 MB in the beginning and 376.4 MB in the end (delta: 177.2 MB). Free memory was 163.4 MB in the beginning and 174.6 MB in the end (delta: -11.2 MB). Peak memory consumption was 166.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 13]: Loop Invariant Derived loop invariant: (sn + 2 <= 2 * i && 2 * i <= sn + 2) && i <= 9 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 33.1s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 138 SDtfs, 110 SDslu, 1056 SDs, 0 SdLazy, 948 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 58 SyntacticMatches, 42 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 10 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 77 PreInvPairs, 136 NumberOfFragments, 141 HoareAnnotationTreeSize, 77 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 622 FormulaSimplificationTreeSizeReductionInter, 0.2s 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...