/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/bhmr2007.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:31:46,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:31:46,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:31:46,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:31:46,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:31:46,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:31:46,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:31:46,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:31:46,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:31:46,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:31:46,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:31:46,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:31:46,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:31:46,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:31:46,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:31:46,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:31:46,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:31:46,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:31:46,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:31:46,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:31:46,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:31:46,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:31:46,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:31:46,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:31:46,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:31:46,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:31:46,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:31:46,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:31:46,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:31:46,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:31:46,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:31:46,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:31:46,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:31:46,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:31:46,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:31:46,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:31:46,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:31:46,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:31:46,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:31:46,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:31:46,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:31:46,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:31:46,123 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:31:46,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:31:46,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:31:46,124 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:31:46,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:31:46,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:31:46,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:31:46,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:31:46,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:31:46,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:31:46,126 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:31:46,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:31:46,126 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:31:46,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:31:46,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:31:46,127 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:31:46,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:31:46,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:31:46,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:31:46,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:31:46,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:31:46,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:31:46,128 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:31:46,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:31:46,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:31:46,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:31:46,484 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:31:46,484 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:31:46,485 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007.i [2020-07-11 02:31:46,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c03371c/d502b745ad804925a78c7dd017c5b228/FLAG1c436e7f7 [2020-07-11 02:31:46,974 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:31:46,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007.i [2020-07-11 02:31:46,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c03371c/d502b745ad804925a78c7dd017c5b228/FLAG1c436e7f7 [2020-07-11 02:31:47,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c03371c/d502b745ad804925a78c7dd017c5b228 [2020-07-11 02:31:47,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:31:47,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:31:47,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:47,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:31:47,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:31:47,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:47" (1/1) ... [2020-07-11 02:31:47,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@667a5e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47, skipping insertion in model container [2020-07-11 02:31:47,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:31:47" (1/1) ... [2020-07-11 02:31:47,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:31:47,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:31:47,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:47,631 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:31:47,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:31:47,662 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:31:47,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47 WrapperNode [2020-07-11 02:31:47,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:31:47,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:31:47,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:31:47,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:31:47,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47" (1/1) ... [2020-07-11 02:31:47,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47" (1/1) ... [2020-07-11 02:31:47,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47" (1/1) ... [2020-07-11 02:31:47,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47" (1/1) ... [2020-07-11 02:31:47,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47" (1/1) ... [2020-07-11 02:31:47,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47" (1/1) ... [2020-07-11 02:31:47,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47" (1/1) ... [2020-07-11 02:31:47,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:31:47,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:31:47,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:31:47,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:31:47,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47" (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-11 02:31:47,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:31:47,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:31:47,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:31:47,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:31:47,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:31:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:31:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:31:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:31:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:31:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:31:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:31:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:31:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:31:48,182 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:31:48,183 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:31:48,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:48 BoogieIcfgContainer [2020-07-11 02:31:48,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:31:48,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:31:48,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:31:48,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:31:48,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:31:47" (1/3) ... [2020-07-11 02:31:48,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b1b182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:48, skipping insertion in model container [2020-07-11 02:31:48,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:31:47" (2/3) ... [2020-07-11 02:31:48,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b1b182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:31:48, skipping insertion in model container [2020-07-11 02:31:48,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:31:48" (3/3) ... [2020-07-11 02:31:48,194 INFO L109 eAbstractionObserver]: Analyzing ICFG bhmr2007.i [2020-07-11 02:31:48,203 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:31:48,210 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:31:48,223 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:31:48,244 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:31:48,245 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:31:48,245 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:31:48,245 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:31:48,245 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:31:48,245 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:31:48,245 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:31:48,246 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:31:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-11 02:31:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-11 02:31:48,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:48,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:48,271 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash 317967837, now seen corresponding path program 1 times [2020-07-11 02:31:48,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:48,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484345606] [2020-07-11 02:31:48,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:48,697 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-11 02:31:48,698 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {41#true} {41#true} #69#return; {41#true} is VALID [2020-07-11 02:31:48,700 INFO L263 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2020-07-11 02:31:48,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2020-07-11 02:31:48,700 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #69#return; {41#true} is VALID [2020-07-11 02:31:48,701 INFO L263 TraceCheckUtils]: 3: Hoare triple {41#true} call #t~ret2 := main(); {41#true} is VALID [2020-07-11 02:31:48,701 INFO L280 TraceCheckUtils]: 4: Hoare triple {41#true} havoc ~i~0; {41#true} is VALID [2020-07-11 02:31:48,702 INFO L280 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0; {41#true} is VALID [2020-07-11 02:31:48,702 INFO L280 TraceCheckUtils]: 6: Hoare triple {41#true} havoc ~a~0; {41#true} is VALID [2020-07-11 02:31:48,702 INFO L280 TraceCheckUtils]: 7: Hoare triple {41#true} havoc ~b~0; {41#true} is VALID [2020-07-11 02:31:48,704 INFO L280 TraceCheckUtils]: 8: Hoare triple {41#true} ~i~0 := 0; {45#(<= main_~i~0 0)} is VALID [2020-07-11 02:31:48,705 INFO L280 TraceCheckUtils]: 9: Hoare triple {45#(<= main_~i~0 0)} ~a~0 := 0; {46#(and (<= main_~a~0 0) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-11 02:31:48,706 INFO L280 TraceCheckUtils]: 10: Hoare triple {46#(and (<= main_~a~0 0) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:48,708 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:48,709 INFO L280 TraceCheckUtils]: 12: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~n~0 := #t~nondet0; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:48,710 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet0; {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:48,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#(and (<= (+ main_~a~0 main_~b~0) 0) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {48#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:48,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {48#(and (or (< (* 3 main_~n~0) (+ main_~a~0 main_~b~0 1)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {49#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:48,716 INFO L263 TraceCheckUtils]: 16: Hoare triple {49#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:48,718 INFO L280 TraceCheckUtils]: 17: Hoare triple {50#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {51#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:48,719 INFO L280 TraceCheckUtils]: 18: Hoare triple {51#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {42#false} is VALID [2020-07-11 02:31:48,719 INFO L280 TraceCheckUtils]: 19: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-11 02:31:48,724 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-11 02:31:48,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484345606] [2020-07-11 02:31:48,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:31:48,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-11 02:31:48,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20706413] [2020-07-11 02:31:48,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-11 02:31:48,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:48,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:31:48,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:48,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:31:48,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:31:48,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:31:48,791 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 9 states. [2020-07-11 02:31:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:49,463 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-07-11 02:31:49,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 02:31:49,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-11 02:31:49,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:31:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-11 02:31:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:31:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2020-07-11 02:31:49,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2020-07-11 02:31:49,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:49,597 INFO L225 Difference]: With dead ends: 70 [2020-07-11 02:31:49,598 INFO L226 Difference]: Without dead ends: 40 [2020-07-11 02:31:49,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:31:49,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-11 02:31:49,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2020-07-11 02:31:49,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:49,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2020-07-11 02:31:49,665 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2020-07-11 02:31:49,665 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2020-07-11 02:31:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:49,670 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-11 02:31:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-11 02:31:49,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:49,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:49,672 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2020-07-11 02:31:49,672 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2020-07-11 02:31:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:49,676 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-11 02:31:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-11 02:31:49,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:49,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:49,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:49,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:49,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-11 02:31:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-07-11 02:31:49,682 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 20 [2020-07-11 02:31:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:49,683 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-07-11 02:31:49,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:31:49,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2020-07-11 02:31:49,723 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-11 02:31:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-11 02:31:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 02:31:49,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:49,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:49,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:31:49,725 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash -628039010, now seen corresponding path program 1 times [2020-07-11 02:31:49,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:49,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [843208695] [2020-07-11 02:31:49,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:50,166 INFO L280 TraceCheckUtils]: 0: Hoare triple {344#true} assume true; {344#true} is VALID [2020-07-11 02:31:50,166 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {344#true} {344#true} #69#return; {344#true} is VALID [2020-07-11 02:31:50,167 INFO L263 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {344#true} is VALID [2020-07-11 02:31:50,167 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#true} assume true; {344#true} is VALID [2020-07-11 02:31:50,167 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {344#true} {344#true} #69#return; {344#true} is VALID [2020-07-11 02:31:50,168 INFO L263 TraceCheckUtils]: 3: Hoare triple {344#true} call #t~ret2 := main(); {344#true} is VALID [2020-07-11 02:31:50,168 INFO L280 TraceCheckUtils]: 4: Hoare triple {344#true} havoc ~i~0; {344#true} is VALID [2020-07-11 02:31:50,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#true} havoc ~n~0; {344#true} is VALID [2020-07-11 02:31:50,168 INFO L280 TraceCheckUtils]: 6: Hoare triple {344#true} havoc ~a~0; {344#true} is VALID [2020-07-11 02:31:50,169 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#true} havoc ~b~0; {344#true} is VALID [2020-07-11 02:31:50,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {344#true} ~i~0 := 0; {348#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-11 02:31:50,171 INFO L280 TraceCheckUtils]: 9: Hoare triple {348#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {349#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-11 02:31:50,172 INFO L280 TraceCheckUtils]: 10: Hoare triple {349#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:50,173 INFO L280 TraceCheckUtils]: 11: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:50,173 INFO L280 TraceCheckUtils]: 12: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:50,174 INFO L280 TraceCheckUtils]: 13: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:50,175 INFO L280 TraceCheckUtils]: 14: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:50,176 INFO L280 TraceCheckUtils]: 15: Hoare triple {350#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:50,177 INFO L280 TraceCheckUtils]: 16: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:50,178 INFO L280 TraceCheckUtils]: 17: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:50,179 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:50,180 INFO L280 TraceCheckUtils]: 19: Hoare triple {351#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {352#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:50,181 INFO L280 TraceCheckUtils]: 20: Hoare triple {352#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {353#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:50,182 INFO L280 TraceCheckUtils]: 21: Hoare triple {353#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {354#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:50,183 INFO L280 TraceCheckUtils]: 22: Hoare triple {354#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {355#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:50,185 INFO L263 TraceCheckUtils]: 23: Hoare triple {355#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {356#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:50,185 INFO L280 TraceCheckUtils]: 24: Hoare triple {356#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {357#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:50,186 INFO L280 TraceCheckUtils]: 25: Hoare triple {357#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {345#false} is VALID [2020-07-11 02:31:50,186 INFO L280 TraceCheckUtils]: 26: Hoare triple {345#false} assume !false; {345#false} is VALID [2020-07-11 02:31:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:31:50,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [843208695] [2020-07-11 02:31:50,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:50,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 02:31:50,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022910318] [2020-07-11 02:31:50,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-11 02:31:50,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:50,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 02:31:50,224 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-11 02:31:50,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 02:31:50,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:50,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 02:31:50,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:31:50,226 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2020-07-11 02:31:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:51,025 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2020-07-11 02:31:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 02:31:51,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-11 02:31:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:31:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-11 02:31:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:31:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-11 02:31:51,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2020-07-11 02:31:51,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:51,109 INFO L225 Difference]: With dead ends: 53 [2020-07-11 02:31:51,109 INFO L226 Difference]: Without dead ends: 48 [2020-07-11 02:31:51,110 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2020-07-11 02:31:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-11 02:31:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2020-07-11 02:31:51,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:51,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 38 states. [2020-07-11 02:31:51,168 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 38 states. [2020-07-11 02:31:51,168 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 38 states. [2020-07-11 02:31:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:51,171 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-11 02:31:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-11 02:31:51,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:51,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:51,173 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 48 states. [2020-07-11 02:31:51,173 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 48 states. [2020-07-11 02:31:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:51,176 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2020-07-11 02:31:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-07-11 02:31:51,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:51,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:51,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:51,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-11 02:31:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2020-07-11 02:31:51,182 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2020-07-11 02:31:51,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:51,183 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2020-07-11 02:31:51,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 02:31:51,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2020-07-11 02:31:51,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-11 02:31:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 02:31:51,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:51,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:51,244 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:31:51,244 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1791276066, now seen corresponding path program 1 times [2020-07-11 02:31:51,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:51,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [229863255] [2020-07-11 02:31:51,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:51,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {654#true} assume true; {654#true} is VALID [2020-07-11 02:31:51,566 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {654#true} {654#true} #69#return; {654#true} is VALID [2020-07-11 02:31:51,566 INFO L263 TraceCheckUtils]: 0: Hoare triple {654#true} call ULTIMATE.init(); {654#true} is VALID [2020-07-11 02:31:51,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {654#true} assume true; {654#true} is VALID [2020-07-11 02:31:51,566 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {654#true} {654#true} #69#return; {654#true} is VALID [2020-07-11 02:31:51,567 INFO L263 TraceCheckUtils]: 3: Hoare triple {654#true} call #t~ret2 := main(); {654#true} is VALID [2020-07-11 02:31:51,567 INFO L280 TraceCheckUtils]: 4: Hoare triple {654#true} havoc ~i~0; {654#true} is VALID [2020-07-11 02:31:51,567 INFO L280 TraceCheckUtils]: 5: Hoare triple {654#true} havoc ~n~0; {654#true} is VALID [2020-07-11 02:31:51,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {654#true} havoc ~a~0; {654#true} is VALID [2020-07-11 02:31:51,568 INFO L280 TraceCheckUtils]: 7: Hoare triple {654#true} havoc ~b~0; {654#true} is VALID [2020-07-11 02:31:51,569 INFO L280 TraceCheckUtils]: 8: Hoare triple {654#true} ~i~0 := 0; {658#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-11 02:31:51,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {658#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {659#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-11 02:31:51,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {659#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:51,575 INFO L280 TraceCheckUtils]: 11: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:51,576 INFO L280 TraceCheckUtils]: 12: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:51,577 INFO L280 TraceCheckUtils]: 13: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:51,577 INFO L280 TraceCheckUtils]: 14: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:51,578 INFO L280 TraceCheckUtils]: 15: Hoare triple {660#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {661#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:51,579 INFO L280 TraceCheckUtils]: 16: Hoare triple {661#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {661#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:51,579 INFO L280 TraceCheckUtils]: 17: Hoare triple {661#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !(0 != #t~nondet1); {661#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:51,580 INFO L280 TraceCheckUtils]: 18: Hoare triple {661#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {661#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:51,580 INFO L280 TraceCheckUtils]: 19: Hoare triple {661#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 2 + ~a~0; {662#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 1) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:51,581 INFO L280 TraceCheckUtils]: 20: Hoare triple {662#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 1) (* 3 main_~n~0)))} ~b~0 := 1 + ~b~0; {663#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:51,582 INFO L280 TraceCheckUtils]: 21: Hoare triple {663#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {664#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:51,583 INFO L280 TraceCheckUtils]: 22: Hoare triple {664#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {665#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:51,584 INFO L263 TraceCheckUtils]: 23: Hoare triple {665#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {666#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:51,584 INFO L280 TraceCheckUtils]: 24: Hoare triple {666#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {667#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:51,585 INFO L280 TraceCheckUtils]: 25: Hoare triple {667#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {655#false} is VALID [2020-07-11 02:31:51,585 INFO L280 TraceCheckUtils]: 26: Hoare triple {655#false} assume !false; {655#false} is VALID [2020-07-11 02:31:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:31:51,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [229863255] [2020-07-11 02:31:51,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:51,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-11 02:31:51,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907690246] [2020-07-11 02:31:51,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-11 02:31:51,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:51,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-11 02:31:51,638 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-11 02:31:51,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-11 02:31:51,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:51,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-11 02:31:51,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-07-11 02:31:51,640 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 12 states. [2020-07-11 02:31:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:52,451 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-07-11 02:31:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-11 02:31:52,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-11 02:31:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:31:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-11 02:31:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-11 02:31:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2020-07-11 02:31:52,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2020-07-11 02:31:52,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:52,522 INFO L225 Difference]: With dead ends: 54 [2020-07-11 02:31:52,522 INFO L226 Difference]: Without dead ends: 49 [2020-07-11 02:31:52,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2020-07-11 02:31:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-11 02:31:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2020-07-11 02:31:52,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:52,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 41 states. [2020-07-11 02:31:52,592 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 41 states. [2020-07-11 02:31:52,592 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 41 states. [2020-07-11 02:31:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:52,596 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-11 02:31:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-11 02:31:52,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:52,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:52,597 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 49 states. [2020-07-11 02:31:52,597 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 49 states. [2020-07-11 02:31:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:52,600 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-11 02:31:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-07-11 02:31:52,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:52,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:52,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:52,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-11 02:31:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-07-11 02:31:52,604 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 27 [2020-07-11 02:31:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:52,604 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-07-11 02:31:52,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-11 02:31:52,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2020-07-11 02:31:52,658 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-11 02:31:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-11 02:31:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 02:31:52,659 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:52,659 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:52,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:31:52,660 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1600642371, now seen corresponding path program 2 times [2020-07-11 02:31:52,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:52,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260914633] [2020-07-11 02:31:52,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:53,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {974#true} assume true; {974#true} is VALID [2020-07-11 02:31:53,034 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {974#true} {974#true} #69#return; {974#true} is VALID [2020-07-11 02:31:53,034 INFO L263 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2020-07-11 02:31:53,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {974#true} assume true; {974#true} is VALID [2020-07-11 02:31:53,035 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {974#true} {974#true} #69#return; {974#true} is VALID [2020-07-11 02:31:53,035 INFO L263 TraceCheckUtils]: 3: Hoare triple {974#true} call #t~ret2 := main(); {974#true} is VALID [2020-07-11 02:31:53,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {974#true} havoc ~i~0; {974#true} is VALID [2020-07-11 02:31:53,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {974#true} havoc ~n~0; {974#true} is VALID [2020-07-11 02:31:53,036 INFO L280 TraceCheckUtils]: 6: Hoare triple {974#true} havoc ~a~0; {974#true} is VALID [2020-07-11 02:31:53,036 INFO L280 TraceCheckUtils]: 7: Hoare triple {974#true} havoc ~b~0; {974#true} is VALID [2020-07-11 02:31:53,036 INFO L280 TraceCheckUtils]: 8: Hoare triple {974#true} ~i~0 := 0; {978#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-11 02:31:53,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {978#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {979#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-11 02:31:53,037 INFO L280 TraceCheckUtils]: 10: Hoare triple {979#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,039 INFO L280 TraceCheckUtils]: 12: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,039 INFO L280 TraceCheckUtils]: 13: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,040 INFO L280 TraceCheckUtils]: 14: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,040 INFO L280 TraceCheckUtils]: 15: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,041 INFO L280 TraceCheckUtils]: 16: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,042 INFO L280 TraceCheckUtils]: 17: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume 0 != #t~nondet1; {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,043 INFO L280 TraceCheckUtils]: 18: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,044 INFO L280 TraceCheckUtils]: 19: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 1 + ~a~0; {981#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:53,045 INFO L280 TraceCheckUtils]: 20: Hoare triple {981#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} ~b~0 := 2 + ~b~0; {982#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-11 02:31:53,046 INFO L280 TraceCheckUtils]: 21: Hoare triple {982#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:53,047 INFO L280 TraceCheckUtils]: 22: Hoare triple {980#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {983#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:53,053 INFO L280 TraceCheckUtils]: 23: Hoare triple {983#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {983#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:53,054 INFO L280 TraceCheckUtils]: 24: Hoare triple {983#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {983#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:53,054 INFO L280 TraceCheckUtils]: 25: Hoare triple {983#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {983#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:53,055 INFO L280 TraceCheckUtils]: 26: Hoare triple {983#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {984#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:53,056 INFO L280 TraceCheckUtils]: 27: Hoare triple {984#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {985#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:53,057 INFO L280 TraceCheckUtils]: 28: Hoare triple {985#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {986#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:53,058 INFO L280 TraceCheckUtils]: 29: Hoare triple {986#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {987#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:53,059 INFO L263 TraceCheckUtils]: 30: Hoare triple {987#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {988#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:53,059 INFO L280 TraceCheckUtils]: 31: Hoare triple {988#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {989#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:53,060 INFO L280 TraceCheckUtils]: 32: Hoare triple {989#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {975#false} is VALID [2020-07-11 02:31:53,060 INFO L280 TraceCheckUtils]: 33: Hoare triple {975#false} assume !false; {975#false} is VALID [2020-07-11 02:31:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 02:31:53,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260914633] [2020-07-11 02:31:53,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:53,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-11 02:31:53,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354674435] [2020-07-11 02:31:53,065 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-11 02:31:53,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:53,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 02:31:53,105 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-11 02:31:53,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 02:31:53,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:53,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 02:31:53,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-11 02:31:53,107 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 14 states. [2020-07-11 02:31:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:54,067 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2020-07-11 02:31:54,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 02:31:54,067 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-11 02:31:54,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:54,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:31:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2020-07-11 02:31:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:31:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 59 transitions. [2020-07-11 02:31:54,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 59 transitions. [2020-07-11 02:31:54,179 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-11 02:31:54,180 INFO L225 Difference]: With dead ends: 58 [2020-07-11 02:31:54,181 INFO L226 Difference]: Without dead ends: 53 [2020-07-11 02:31:54,182 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2020-07-11 02:31:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-11 02:31:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2020-07-11 02:31:54,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:54,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 45 states. [2020-07-11 02:31:54,262 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 45 states. [2020-07-11 02:31:54,263 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 45 states. [2020-07-11 02:31:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:54,269 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2020-07-11 02:31:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2020-07-11 02:31:54,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:54,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:54,273 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 53 states. [2020-07-11 02:31:54,273 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 53 states. [2020-07-11 02:31:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:54,276 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2020-07-11 02:31:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2020-07-11 02:31:54,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:54,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:54,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:54,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-11 02:31:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-11 02:31:54,279 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 34 [2020-07-11 02:31:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:54,280 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-11 02:31:54,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 02:31:54,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 48 transitions. [2020-07-11 02:31:54,337 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-11 02:31:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-11 02:31:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 02:31:54,339 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:54,339 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:54,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:31:54,340 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:54,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1531087869, now seen corresponding path program 1 times [2020-07-11 02:31:54,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:54,341 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108821334] [2020-07-11 02:31:54,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:54,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {1330#true} assume true; {1330#true} is VALID [2020-07-11 02:31:54,718 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1330#true} {1330#true} #69#return; {1330#true} is VALID [2020-07-11 02:31:54,719 INFO L263 TraceCheckUtils]: 0: Hoare triple {1330#true} call ULTIMATE.init(); {1330#true} is VALID [2020-07-11 02:31:54,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {1330#true} assume true; {1330#true} is VALID [2020-07-11 02:31:54,719 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1330#true} {1330#true} #69#return; {1330#true} is VALID [2020-07-11 02:31:54,719 INFO L263 TraceCheckUtils]: 3: Hoare triple {1330#true} call #t~ret2 := main(); {1330#true} is VALID [2020-07-11 02:31:54,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {1330#true} havoc ~i~0; {1330#true} is VALID [2020-07-11 02:31:54,720 INFO L280 TraceCheckUtils]: 5: Hoare triple {1330#true} havoc ~n~0; {1330#true} is VALID [2020-07-11 02:31:54,720 INFO L280 TraceCheckUtils]: 6: Hoare triple {1330#true} havoc ~a~0; {1330#true} is VALID [2020-07-11 02:31:54,720 INFO L280 TraceCheckUtils]: 7: Hoare triple {1330#true} havoc ~b~0; {1330#true} is VALID [2020-07-11 02:31:54,736 INFO L280 TraceCheckUtils]: 8: Hoare triple {1330#true} ~i~0 := 0; {1334#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-11 02:31:54,737 INFO L280 TraceCheckUtils]: 9: Hoare triple {1334#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1335#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-11 02:31:54,737 INFO L280 TraceCheckUtils]: 10: Hoare triple {1335#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,738 INFO L280 TraceCheckUtils]: 11: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,739 INFO L280 TraceCheckUtils]: 12: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,739 INFO L280 TraceCheckUtils]: 13: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,742 INFO L280 TraceCheckUtils]: 16: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,742 INFO L280 TraceCheckUtils]: 17: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume 0 != #t~nondet1; {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 1 + ~a~0; {1337#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:54,745 INFO L280 TraceCheckUtils]: 20: Hoare triple {1337#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} ~b~0 := 2 + ~b~0; {1338#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-11 02:31:54,746 INFO L280 TraceCheckUtils]: 21: Hoare triple {1338#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:54,747 INFO L280 TraceCheckUtils]: 22: Hoare triple {1336#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1339#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:54,747 INFO L280 TraceCheckUtils]: 23: Hoare triple {1339#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1339#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:54,748 INFO L280 TraceCheckUtils]: 24: Hoare triple {1339#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume !(0 != #t~nondet1); {1339#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:54,749 INFO L280 TraceCheckUtils]: 25: Hoare triple {1339#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {1339#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:54,749 INFO L280 TraceCheckUtils]: 26: Hoare triple {1339#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 2 + ~a~0; {1340#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 1) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:54,750 INFO L280 TraceCheckUtils]: 27: Hoare triple {1340#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 1) (* 3 main_~n~0)))} ~b~0 := 1 + ~b~0; {1341#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:54,751 INFO L280 TraceCheckUtils]: 28: Hoare triple {1341#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {1342#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:54,752 INFO L280 TraceCheckUtils]: 29: Hoare triple {1342#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {1343#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:54,753 INFO L263 TraceCheckUtils]: 30: Hoare triple {1343#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {1344#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:54,754 INFO L280 TraceCheckUtils]: 31: Hoare triple {1344#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1345#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:54,755 INFO L280 TraceCheckUtils]: 32: Hoare triple {1345#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1331#false} is VALID [2020-07-11 02:31:54,755 INFO L280 TraceCheckUtils]: 33: Hoare triple {1331#false} assume !false; {1331#false} is VALID [2020-07-11 02:31:54,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 02:31:54,759 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108821334] [2020-07-11 02:31:54,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:54,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-11 02:31:54,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759950388] [2020-07-11 02:31:54,760 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-11 02:31:54,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:54,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 02:31:54,803 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-11 02:31:54,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 02:31:54,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:54,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 02:31:54,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-11 02:31:54,804 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2020-07-11 02:31:55,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:55,887 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-11 02:31:55,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-11 02:31:55,887 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-11 02:31:55,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:31:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-11 02:31:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:31:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2020-07-11 02:31:55,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2020-07-11 02:31:55,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:55,990 INFO L225 Difference]: With dead ends: 65 [2020-07-11 02:31:55,990 INFO L226 Difference]: Without dead ends: 60 [2020-07-11 02:31:55,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2020-07-11 02:31:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-11 02:31:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2020-07-11 02:31:56,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:56,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 42 states. [2020-07-11 02:31:56,058 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 42 states. [2020-07-11 02:31:56,058 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 42 states. [2020-07-11 02:31:56,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:56,061 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-11 02:31:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-11 02:31:56,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:56,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:56,062 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 60 states. [2020-07-11 02:31:56,063 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 60 states. [2020-07-11 02:31:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:56,065 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-11 02:31:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2020-07-11 02:31:56,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:56,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:56,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:56,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 02:31:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-11 02:31:56,068 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 34 [2020-07-11 02:31:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:56,068 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-11 02:31:56,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 02:31:56,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-11 02:31:56,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-11 02:31:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-11 02:31:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-11 02:31:56,132 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:56,132 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:56,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:31:56,133 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:56,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:56,133 INFO L82 PathProgramCache]: Analyzing trace with hash -966733443, now seen corresponding path program 2 times [2020-07-11 02:31:56,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:56,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201461578] [2020-07-11 02:31:56,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:56,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {1708#true} assume true; {1708#true} is VALID [2020-07-11 02:31:56,496 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1708#true} {1708#true} #69#return; {1708#true} is VALID [2020-07-11 02:31:56,497 INFO L263 TraceCheckUtils]: 0: Hoare triple {1708#true} call ULTIMATE.init(); {1708#true} is VALID [2020-07-11 02:31:56,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {1708#true} assume true; {1708#true} is VALID [2020-07-11 02:31:56,497 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1708#true} {1708#true} #69#return; {1708#true} is VALID [2020-07-11 02:31:56,497 INFO L263 TraceCheckUtils]: 3: Hoare triple {1708#true} call #t~ret2 := main(); {1708#true} is VALID [2020-07-11 02:31:56,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {1708#true} havoc ~i~0; {1708#true} is VALID [2020-07-11 02:31:56,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {1708#true} havoc ~n~0; {1708#true} is VALID [2020-07-11 02:31:56,498 INFO L280 TraceCheckUtils]: 6: Hoare triple {1708#true} havoc ~a~0; {1708#true} is VALID [2020-07-11 02:31:56,498 INFO L280 TraceCheckUtils]: 7: Hoare triple {1708#true} havoc ~b~0; {1708#true} is VALID [2020-07-11 02:31:56,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {1708#true} ~i~0 := 0; {1712#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-11 02:31:56,504 INFO L280 TraceCheckUtils]: 9: Hoare triple {1712#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {1713#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-11 02:31:56,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {1713#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,506 INFO L280 TraceCheckUtils]: 11: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,508 INFO L280 TraceCheckUtils]: 15: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,509 INFO L280 TraceCheckUtils]: 16: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,510 INFO L280 TraceCheckUtils]: 17: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !(0 != #t~nondet1); {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,510 INFO L280 TraceCheckUtils]: 18: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,512 INFO L280 TraceCheckUtils]: 19: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 2 + ~a~0; {1715#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} is VALID [2020-07-11 02:31:56,513 INFO L280 TraceCheckUtils]: 20: Hoare triple {1715#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} ~b~0 := 1 + ~b~0; {1716#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-11 02:31:56,513 INFO L280 TraceCheckUtils]: 21: Hoare triple {1716#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:56,514 INFO L280 TraceCheckUtils]: 22: Hoare triple {1714#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {1717#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:56,515 INFO L280 TraceCheckUtils]: 23: Hoare triple {1717#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1717#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:56,516 INFO L280 TraceCheckUtils]: 24: Hoare triple {1717#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {1717#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:56,517 INFO L280 TraceCheckUtils]: 25: Hoare triple {1717#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {1717#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:56,518 INFO L280 TraceCheckUtils]: 26: Hoare triple {1717#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {1718#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:56,520 INFO L280 TraceCheckUtils]: 27: Hoare triple {1718#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {1719#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:56,521 INFO L280 TraceCheckUtils]: 28: Hoare triple {1719#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {1720#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:56,521 INFO L280 TraceCheckUtils]: 29: Hoare triple {1720#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {1721#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:56,523 INFO L263 TraceCheckUtils]: 30: Hoare triple {1721#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {1722#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:56,523 INFO L280 TraceCheckUtils]: 31: Hoare triple {1722#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1723#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:56,525 INFO L280 TraceCheckUtils]: 32: Hoare triple {1723#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1709#false} is VALID [2020-07-11 02:31:56,525 INFO L280 TraceCheckUtils]: 33: Hoare triple {1709#false} assume !false; {1709#false} is VALID [2020-07-11 02:31:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-11 02:31:56,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201461578] [2020-07-11 02:31:56,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:56,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-11 02:31:56,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195934658] [2020-07-11 02:31:56,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-11 02:31:56,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:56,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-11 02:31:56,571 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-11 02:31:56,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-11 02:31:56,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-11 02:31:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-07-11 02:31:56,573 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 14 states. [2020-07-11 02:31:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:57,767 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2020-07-11 02:31:57,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-11 02:31:57,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2020-07-11 02:31:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:31:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 70 transitions. [2020-07-11 02:31:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-11 02:31:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 70 transitions. [2020-07-11 02:31:57,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 70 transitions. [2020-07-11 02:31:57,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:31:57,867 INFO L225 Difference]: With dead ends: 85 [2020-07-11 02:31:57,867 INFO L226 Difference]: Without dead ends: 79 [2020-07-11 02:31:57,868 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2020-07-11 02:31:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-11 02:31:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2020-07-11 02:31:57,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:57,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 55 states. [2020-07-11 02:31:57,981 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 55 states. [2020-07-11 02:31:57,982 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 55 states. [2020-07-11 02:31:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:57,985 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2020-07-11 02:31:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2020-07-11 02:31:57,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:57,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:57,986 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 79 states. [2020-07-11 02:31:57,986 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 79 states. [2020-07-11 02:31:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:57,989 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2020-07-11 02:31:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2020-07-11 02:31:57,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:57,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:57,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:57,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-11 02:31:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-11 02:31:57,992 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 34 [2020-07-11 02:31:57,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:57,993 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-11 02:31:57,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-11 02:31:57,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 59 transitions. [2020-07-11 02:31:58,079 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-11 02:31:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-11 02:31:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-11 02:31:58,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:31:58,081 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:31:58,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:31:58,081 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:31:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:31:58,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1509294206, now seen corresponding path program 3 times [2020-07-11 02:31:58,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:31:58,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [681093483] [2020-07-11 02:31:58,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:31:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:31:58,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {2192#true} assume true; {2192#true} is VALID [2020-07-11 02:31:58,542 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2192#true} {2192#true} #69#return; {2192#true} is VALID [2020-07-11 02:31:58,542 INFO L263 TraceCheckUtils]: 0: Hoare triple {2192#true} call ULTIMATE.init(); {2192#true} is VALID [2020-07-11 02:31:58,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {2192#true} assume true; {2192#true} is VALID [2020-07-11 02:31:58,542 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2192#true} {2192#true} #69#return; {2192#true} is VALID [2020-07-11 02:31:58,543 INFO L263 TraceCheckUtils]: 3: Hoare triple {2192#true} call #t~ret2 := main(); {2192#true} is VALID [2020-07-11 02:31:58,543 INFO L280 TraceCheckUtils]: 4: Hoare triple {2192#true} havoc ~i~0; {2192#true} is VALID [2020-07-11 02:31:58,543 INFO L280 TraceCheckUtils]: 5: Hoare triple {2192#true} havoc ~n~0; {2192#true} is VALID [2020-07-11 02:31:58,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {2192#true} havoc ~a~0; {2192#true} is VALID [2020-07-11 02:31:58,544 INFO L280 TraceCheckUtils]: 7: Hoare triple {2192#true} havoc ~b~0; {2192#true} is VALID [2020-07-11 02:31:58,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {2192#true} ~i~0 := 0; {2196#(and (<= main_~i~0 0) (<= 0 main_~i~0))} is VALID [2020-07-11 02:31:58,545 INFO L280 TraceCheckUtils]: 9: Hoare triple {2196#(and (<= main_~i~0 0) (<= 0 main_~i~0))} ~a~0 := 0; {2197#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} is VALID [2020-07-11 02:31:58,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {2197#(and (<= main_~a~0 (* 3 main_~i~0)) (<= (* 3 main_~i~0) main_~a~0))} ~b~0 := 0; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,546 INFO L280 TraceCheckUtils]: 11: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,551 INFO L280 TraceCheckUtils]: 12: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~n~0 := #t~nondet0; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,552 INFO L280 TraceCheckUtils]: 13: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet0; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,552 INFO L280 TraceCheckUtils]: 14: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~n~0 >= 0 && ~n~0 <= 1000000); {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,553 INFO L280 TraceCheckUtils]: 15: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,553 INFO L280 TraceCheckUtils]: 16: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,554 INFO L280 TraceCheckUtils]: 17: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume 0 != #t~nondet1; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,555 INFO L280 TraceCheckUtils]: 18: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,556 INFO L280 TraceCheckUtils]: 19: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 1 + ~a~0; {2199#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:58,556 INFO L280 TraceCheckUtils]: 20: Hoare triple {2199#(and (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 1)) (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)))} ~b~0 := 2 + ~b~0; {2200#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-11 02:31:58,557 INFO L280 TraceCheckUtils]: 21: Hoare triple {2200#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,558 INFO L280 TraceCheckUtils]: 22: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,558 INFO L280 TraceCheckUtils]: 23: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,559 INFO L280 TraceCheckUtils]: 24: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !(0 != #t~nondet1); {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,559 INFO L280 TraceCheckUtils]: 25: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} havoc #t~nondet1; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,560 INFO L280 TraceCheckUtils]: 26: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} ~a~0 := 2 + ~a~0; {2201#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} is VALID [2020-07-11 02:31:58,561 INFO L280 TraceCheckUtils]: 27: Hoare triple {2201#(and (<= (+ (* 3 main_~i~0) 2) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 2)))} ~b~0 := 1 + ~b~0; {2200#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} is VALID [2020-07-11 02:31:58,561 INFO L280 TraceCheckUtils]: 28: Hoare triple {2200#(and (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (+ (* 3 main_~i~0) 3)))} ~i~0 := 1 + ~i~0; {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} is VALID [2020-07-11 02:31:58,562 INFO L280 TraceCheckUtils]: 29: Hoare triple {2198#(and (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~i~0)))} assume !!(~i~0 < ~n~0); {2202#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:58,563 INFO L280 TraceCheckUtils]: 30: Hoare triple {2202#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2202#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:58,564 INFO L280 TraceCheckUtils]: 31: Hoare triple {2202#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} assume 0 != #t~nondet1; {2202#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:58,564 INFO L280 TraceCheckUtils]: 32: Hoare triple {2202#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} havoc #t~nondet1; {2202#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-11 02:31:58,565 INFO L280 TraceCheckUtils]: 33: Hoare triple {2202#(and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0)))} ~a~0 := 1 + ~a~0; {2203#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:58,566 INFO L280 TraceCheckUtils]: 34: Hoare triple {2203#(and (<= (+ (* 3 main_~i~0) 1) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))} ~b~0 := 2 + ~b~0; {2204#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:58,567 INFO L280 TraceCheckUtils]: 35: Hoare triple {2204#(and (or (<= (+ (* 3 main_~i~0) 3) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} ~i~0 := 1 + ~i~0; {2205#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:58,567 INFO L280 TraceCheckUtils]: 36: Hoare triple {2205#(and (or (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (* 3 main_~i~0) (+ main_~a~0 main_~b~0))) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} assume !(~i~0 < ~n~0); {2206#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} is VALID [2020-07-11 02:31:58,568 INFO L263 TraceCheckUtils]: 37: Hoare triple {2206#(and (<= (* 3 main_~n~0) (+ main_~a~0 main_~b~0)) (<= (+ main_~a~0 main_~b~0) (* 3 main_~n~0)))} call __VERIFIER_assert((if ~a~0 + ~b~0 == 3 * ~n~0 then 1 else 0)); {2207#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:31:58,569 INFO L280 TraceCheckUtils]: 38: Hoare triple {2207#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2208#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:31:58,570 INFO L280 TraceCheckUtils]: 39: Hoare triple {2208#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2193#false} is VALID [2020-07-11 02:31:58,570 INFO L280 TraceCheckUtils]: 40: Hoare triple {2193#false} assume !false; {2193#false} is VALID [2020-07-11 02:31:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-11 02:31:58,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [681093483] [2020-07-11 02:31:58,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:31:58,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 02:31:58,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113523351] [2020-07-11 02:31:58,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-11 02:31:58,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:31:58,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 02:31:58,623 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-11 02:31:58,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 02:31:58,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:31:58,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 02:31:58,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-07-11 02:31:58,624 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 15 states. [2020-07-11 02:31:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:59,690 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2020-07-11 02:31:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 02:31:59,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-11 02:31:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:31:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:31:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2020-07-11 02:31:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:31:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2020-07-11 02:31:59,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 42 transitions. [2020-07-11 02:31:59,752 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-11 02:31:59,752 INFO L225 Difference]: With dead ends: 63 [2020-07-11 02:31:59,752 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:31:59,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2020-07-11 02:31:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:31:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:31:59,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:31:59,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:59,755 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:59,755 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:59,755 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:59,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:59,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:59,756 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:59,756 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:31:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:31:59,756 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:31:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:59,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:59,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:31:59,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:31:59,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:31:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:31:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:31:59,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-11 02:31:59,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:31:59,758 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:31:59,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 02:31:59,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:31:59,758 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-11 02:31:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:31:59,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:31:59,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:31:59,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:32:00,310 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:00,311 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:00,311 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:32:00,311 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:32:00,311 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:32:00,311 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:32:00,311 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:00,311 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:00,311 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:32:00,311 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:32:00,311 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:32:00,312 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-11 02:32:00,312 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 29) the Hoare annotation is: true [2020-07-11 02:32:00,312 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (+ (* 3 main_~i~0) 2)) (.cse1 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 (* 3 main_~n~0)))) [2020-07-11 02:32:00,312 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-11 02:32:00,312 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-11 02:32:00,312 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 26) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0)) (.cse1 (* 3 main_~i~0))) (and (<= .cse0 (* 3 main_~n~0)) (<= .cse1 .cse0) (<= .cse0 .cse1))) [2020-07-11 02:32:00,312 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (<= main_~i~0 0) (<= 0 main_~i~0)) [2020-07-11 02:32:00,313 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 26) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~n~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-11 02:32:00,313 INFO L264 CegarLoopResult]: At program point L15-2(line 15) the Hoare annotation is: (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= (* 3 main_~i~0) main_~a~0)) [2020-07-11 02:32:00,313 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 29) the Hoare annotation is: true [2020-07-11 02:32:00,314 INFO L264 CegarLoopResult]: At program point L15-3(line 15) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 main_~a~0))) [2020-07-11 02:32:00,314 INFO L264 CegarLoopResult]: At program point L15-4(line 15) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 main_~a~0))) [2020-07-11 02:32:00,314 INFO L264 CegarLoopResult]: At program point L15-5(line 15) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 main_~a~0))) [2020-07-11 02:32:00,314 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 29) the Hoare annotation is: true [2020-07-11 02:32:00,315 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-11 02:32:00,315 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse1 (+ (* 3 main_~i~0) 1)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= (+ main_~a~0 main_~b~0 2) (* 3 main_~n~0)))) [2020-07-11 02:32:00,315 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-11 02:32:00,315 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 24) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-11 02:32:00,315 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= 0 main_~i~0) (<= main_~a~0 0) (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse0 main_~a~0))) [2020-07-11 02:32:00,315 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-11 02:32:00,315 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0)) (.cse1 (* 3 main_~i~0))) (and (<= .cse0 0) (<= main_~a~0 0) (<= .cse1 .cse0) (<= .cse1 main_~a~0))) [2020-07-11 02:32:00,315 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-11 02:32:00,315 INFO L264 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0)) (.cse0 (* 3 main_~i~0))) (and (<= (+ main_~a~0 main_~b~0 3) (* 3 main_~n~0)) (<= .cse0 .cse1) (<= .cse1 .cse0))) [2020-07-11 02:32:00,316 INFO L271 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: true [2020-07-11 02:32:00,316 INFO L264 CegarLoopResult]: At program point L18-5(lines 18 24) the Hoare annotation is: (let ((.cse0 (+ (* 3 main_~i~0) 3)) (.cse1 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (<= .cse1 (* 3 main_~n~0)))) [2020-07-11 02:32:00,316 INFO L271 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: true [2020-07-11 02:32:00,316 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:32:00,316 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:32:00,316 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:00,316 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:32:00,316 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:32:00,316 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:32:00,320 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:32:00,321 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:00,321 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:32:00,321 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:32:00,321 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:32:00,335 INFO L163 areAnnotationChecker]: CFG has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:32:00,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:32:00 BoogieIcfgContainer [2020-07-11 02:32:00,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:32:00,352 INFO L168 Benchmark]: Toolchain (without parser) took 12968.41 ms. Allocated memory was 148.4 MB in the beginning and 320.9 MB in the end (delta: 172.5 MB). Free memory was 106.5 MB in the beginning and 137.9 MB in the end (delta: -31.4 MB). Peak memory consumption was 141.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:00,353 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 148.4 MB. Free memory was 125.0 MB in the beginning and 124.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-11 02:32:00,353 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.62 ms. Allocated memory is still 148.4 MB. Free memory was 106.1 MB in the beginning and 96.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:00,354 INFO L168 Benchmark]: Boogie Preprocessor took 116.59 ms. Allocated memory was 148.4 MB in the beginning and 203.4 MB in the end (delta: 55.1 MB). Free memory was 96.4 MB in the beginning and 183.3 MB in the end (delta: -86.8 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:00,355 INFO L168 Benchmark]: RCFGBuilder took 406.68 ms. Allocated memory is still 203.4 MB. Free memory was 183.3 MB in the beginning and 163.2 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:00,356 INFO L168 Benchmark]: TraceAbstraction took 12161.15 ms. Allocated memory was 203.4 MB in the beginning and 320.9 MB in the end (delta: 117.4 MB). Free memory was 162.5 MB in the beginning and 137.9 MB in the end (delta: 24.6 MB). Peak memory consumption was 142.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:32:00,359 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.20 ms. Allocated memory is still 148.4 MB. Free memory was 125.0 MB in the beginning and 124.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 278.62 ms. Allocated memory is still 148.4 MB. Free memory was 106.1 MB in the beginning and 96.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.59 ms. Allocated memory was 148.4 MB in the beginning and 203.4 MB in the end (delta: 55.1 MB). Free memory was 96.4 MB in the beginning and 183.3 MB in the end (delta: -86.8 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 406.68 ms. Allocated memory is still 203.4 MB. Free memory was 183.3 MB in the beginning and 163.2 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12161.15 ms. Allocated memory was 203.4 MB in the beginning and 320.9 MB in the end (delta: 117.4 MB). Free memory was 162.5 MB in the beginning and 137.9 MB in the end (delta: 24.6 MB). Peak memory consumption was 142.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (a + b <= 3 * n && 3 * i <= a + b) && a + b <= 3 * i - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.5s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 172 SDtfs, 317 SDslu, 1129 SDs, 0 SdLazy, 952 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=6, 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, 7 MinimizatonAttempts, 77 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 86 PreInvPairs, 143 NumberOfFragments, 443 HoareAnnotationTreeSize, 86 FomulaSimplifications, 7566 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 38 FomulaSimplificationsInter, 93 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 71212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 9/41 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...