/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/recursive-simple/id_b3_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:07:10,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:07:10,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:07:10,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:07:10,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:07:10,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:07:10,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:07:10,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:07:10,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:07:10,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:07:10,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:07:10,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:07:10,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:07:10,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:07:10,640 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:07:10,641 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:07:10,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:07:10,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:07:10,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:07:10,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:07:10,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:07:10,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:07:10,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:07:10,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:07:10,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:07:10,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:07:10,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:07:10,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:07:10,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:07:10,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:07:10,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:07:10,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:07:10,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:07:10,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:07:10,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:07:10,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:07:10,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:07:10,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:07:10,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:07:10,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:07:10,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:07:10,672 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:07:10,681 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:07:10,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:07:10,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:07:10,682 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:07:10,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:07:10,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:07:10,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:07:10,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:07:10,683 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:07:10,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:07:10,684 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:07:10,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:07:10,684 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:07:10,684 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:07:10,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:07:10,685 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:07:10,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:07:10,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:07:10,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:07:10,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:07:10,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:07:10,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:07:10,686 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-08 22:07:10,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:07:10,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:07:10,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:07:10,997 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:07:10,997 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:07:10,998 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-08 22:07:11,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50cb27a2/be5fbae44a6341e1b668083cce98e5c5/FLAG3a1c5c1b2 [2020-07-08 22:07:11,516 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:07:11,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-08 22:07:11,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50cb27a2/be5fbae44a6341e1b668083cce98e5c5/FLAG3a1c5c1b2 [2020-07-08 22:07:11,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50cb27a2/be5fbae44a6341e1b668083cce98e5c5 [2020-07-08 22:07:11,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:07:11,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:07:11,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:07:11,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:07:11,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:07:11,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:07:11" (1/1) ... [2020-07-08 22:07:11,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ed9dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:11, skipping insertion in model container [2020-07-08 22:07:11,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:07:11" (1/1) ... [2020-07-08 22:07:11,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:07:11,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:07:12,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:07:12,127 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:07:12,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:07:12,171 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:07:12,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12 WrapperNode [2020-07-08 22:07:12,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:07:12,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:07:12,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:07:12,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:07:12,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12" (1/1) ... [2020-07-08 22:07:12,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12" (1/1) ... [2020-07-08 22:07:12,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12" (1/1) ... [2020-07-08 22:07:12,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12" (1/1) ... [2020-07-08 22:07:12,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12" (1/1) ... [2020-07-08 22:07:12,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12" (1/1) ... [2020-07-08 22:07:12,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12" (1/1) ... [2020-07-08 22:07:12,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:07:12,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:07:12,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:07:12,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:07:12,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12" (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-08 22:07:12,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:07:12,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:07:12,362 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-08 22:07:12,362 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:07:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:07:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:07:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-08 22:07:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:07:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:07:12,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:07:12,613 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:07:12,614 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 22:07:12,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:07:12 BoogieIcfgContainer [2020-07-08 22:07:12,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:07:12,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:07:12,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:07:12,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:07:12,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:07:11" (1/3) ... [2020-07-08 22:07:12,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8d291b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:07:12, skipping insertion in model container [2020-07-08 22:07:12,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:07:12" (2/3) ... [2020-07-08 22:07:12,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8d291b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:07:12, skipping insertion in model container [2020-07-08 22:07:12,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:07:12" (3/3) ... [2020-07-08 22:07:12,628 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o5-2.c [2020-07-08 22:07:12,643 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:07:12,653 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 22:07:12,668 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 22:07:12,693 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:07:12,694 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:07:12,694 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:07:12,694 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:07:12,694 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:07:12,694 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:07:12,695 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:07:12,695 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:07:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-08 22:07:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 22:07:12,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:12,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:07:12,725 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:12,737 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-08 22:07:12,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:12,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [498776306] [2020-07-08 22:07:12,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:12,967 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-08 22:07:12,967 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-08 22:07:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:13,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-08 22:07:13,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-08 22:07:13,018 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,019 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,021 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-08 22:07:13,021 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-08 22:07:13,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-08 22:07:13,022 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-08 22:07:13,023 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-08 22:07:13,023 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-08 22:07:13,024 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-08 22:07:13,024 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-08 22:07:13,024 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-08 22:07:13,025 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-08 22:07:13,025 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-08 22:07:13,027 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,028 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,041 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-08 22:07:13,042 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-08 22:07:13,044 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= |main_#t~ret2| 0)} ~result~0 := #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-08 22:07:13,045 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= main_~result~0 0)} havoc #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-08 22:07:13,047 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 5 == ~result~0; {34#false} is VALID [2020-07-08 22:07:13,047 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-08 22:07:13,050 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-08 22:07:13,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [498776306] [2020-07-08 22:07:13,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:07:13,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:07:13,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881743291] [2020-07-08 22:07:13,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 22:07:13,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:13,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:07:13,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:13,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:07:13,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:13,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:07:13,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:07:13,129 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-08 22:07:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:13,378 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-08 22:07:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 22:07:13,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 22:07:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:07:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-08 22:07:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:07:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-08 22:07:13,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-08 22:07:13,468 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-08 22:07:13,481 INFO L225 Difference]: With dead ends: 44 [2020-07-08 22:07:13,481 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 22:07:13,487 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:07:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 22:07:13,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-08 22:07:13,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:13,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-08 22:07:13,572 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 22:07:13,572 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 22:07:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:13,579 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-08 22:07:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-08 22:07:13,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:13,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:13,580 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-08 22:07:13,580 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-08 22:07:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:13,585 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-08 22:07:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-08 22:07:13,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:13,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:13,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:13,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 22:07:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-08 22:07:13,593 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-08 22:07:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:13,593 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-08 22:07:13,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:07:13,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-08 22:07:13,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:13,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-08 22:07:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 22:07:13,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:13,639 INFO L422 BasicCegarLoop]: trace histogram [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-08 22:07:13,639 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:07:13,639 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-08 22:07:13,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:13,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1781185183] [2020-07-08 22:07:13,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:13,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-08 22:07:13,714 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-08 22:07:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:13,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-08 22:07:13,798 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-08 22:07:13,799 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,800 INFO L280 TraceCheckUtils]: 3: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,802 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:13,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-08 22:07:13,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-08 22:07:13,803 INFO L263 TraceCheckUtils]: 2: Hoare triple {249#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {249#true} is VALID [2020-07-08 22:07:13,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-08 22:07:13,804 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-08 22:07:13,805 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,806 INFO L280 TraceCheckUtils]: 6: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,807 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:13,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {273#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:13,809 INFO L280 TraceCheckUtils]: 9: Hoare triple {273#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:13,810 INFO L280 TraceCheckUtils]: 10: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:13,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 3; {250#false} is VALID [2020-07-08 22:07:13,811 INFO L280 TraceCheckUtils]: 12: Hoare triple {250#false} #res := 3; {250#false} is VALID [2020-07-08 22:07:13,811 INFO L280 TraceCheckUtils]: 13: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-08 22:07:13,812 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-08 22:07:13,813 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-08 22:07:13,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-08 22:07:13,813 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-08 22:07:13,814 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-08 22:07:13,814 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-08 22:07:13,814 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-08 22:07:13,814 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-08 22:07:13,815 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-08 22:07:13,815 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-08 22:07:13,815 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-08 22:07:13,816 INFO L263 TraceCheckUtils]: 10: Hoare triple {249#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {249#true} is VALID [2020-07-08 22:07:13,816 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-08 22:07:13,816 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-08 22:07:13,817 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,818 INFO L280 TraceCheckUtils]: 14: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:13,820 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:13,821 INFO L280 TraceCheckUtils]: 16: Hoare triple {273#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:13,822 INFO L280 TraceCheckUtils]: 17: Hoare triple {273#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:13,822 INFO L280 TraceCheckUtils]: 18: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:13,823 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 3; {250#false} is VALID [2020-07-08 22:07:13,824 INFO L280 TraceCheckUtils]: 20: Hoare triple {250#false} #res := 3; {250#false} is VALID [2020-07-08 22:07:13,824 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-08 22:07:13,824 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-08 22:07:13,825 INFO L280 TraceCheckUtils]: 23: Hoare triple {250#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {250#false} is VALID [2020-07-08 22:07:13,825 INFO L280 TraceCheckUtils]: 24: Hoare triple {250#false} ~result~0 := #t~ret2; {250#false} is VALID [2020-07-08 22:07:13,825 INFO L280 TraceCheckUtils]: 25: Hoare triple {250#false} havoc #t~ret2; {250#false} is VALID [2020-07-08 22:07:13,825 INFO L280 TraceCheckUtils]: 26: Hoare triple {250#false} assume 5 == ~result~0; {250#false} is VALID [2020-07-08 22:07:13,826 INFO L280 TraceCheckUtils]: 27: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-08 22:07:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 22:07:13,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1781185183] [2020-07-08 22:07:13,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:07:13,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:07:13,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235170990] [2020-07-08 22:07:13,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-08 22:07:13,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:13,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:07:13,867 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-08 22:07:13,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:07:13,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:13,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:07:13,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:07:13,869 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2020-07-08 22:07:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:14,050 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-08 22:07:14,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 22:07:14,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-08 22:07:14,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:07:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-08 22:07:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:07:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-08 22:07:14,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2020-07-08 22:07:14,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:14,125 INFO L225 Difference]: With dead ends: 49 [2020-07-08 22:07:14,126 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 22:07:14,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:07:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 22:07:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-08 22:07:14,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:14,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-08 22:07:14,152 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-08 22:07:14,152 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-08 22:07:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:14,157 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-08 22:07:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-08 22:07:14,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:14,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:14,158 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-08 22:07:14,159 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-08 22:07:14,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:14,163 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-08 22:07:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-08 22:07:14,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:14,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:14,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:14,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 22:07:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-08 22:07:14,167 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2020-07-08 22:07:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:14,168 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-08 22:07:14,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:07:14,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-08 22:07:14,208 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-08 22:07:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 22:07:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 22:07:14,210 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:14,211 INFO L422 BasicCegarLoop]: trace histogram [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-08 22:07:14,211 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:07:14,211 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:14,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:14,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1645321695, now seen corresponding path program 1 times [2020-07-08 22:07:14,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:14,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1198840504] [2020-07-08 22:07:14,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:14,290 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-08 22:07:14,291 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-08 22:07:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:14,418 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-08 22:07:14,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-08 22:07:14,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:14,422 INFO L280 TraceCheckUtils]: 3: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:14,423 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:14,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-08 22:07:14,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-08 22:07:14,424 INFO L263 TraceCheckUtils]: 2: Hoare triple {512#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {512#true} is VALID [2020-07-08 22:07:14,424 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-08 22:07:14,425 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-08 22:07:14,428 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:14,429 INFO L280 TraceCheckUtils]: 6: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:14,438 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:14,439 INFO L280 TraceCheckUtils]: 8: Hoare triple {538#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:14,446 INFO L280 TraceCheckUtils]: 9: Hoare triple {538#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:14,448 INFO L280 TraceCheckUtils]: 10: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:14,449 INFO L280 TraceCheckUtils]: 11: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {539#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:14,452 INFO L280 TraceCheckUtils]: 12: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:14,454 INFO L280 TraceCheckUtils]: 13: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:14,455 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-08 22:07:14,456 INFO L263 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2020-07-08 22:07:14,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-08 22:07:14,457 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-08 22:07:14,458 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#true} call #t~ret3 := main(); {512#true} is VALID [2020-07-08 22:07:14,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {512#true} is VALID [2020-07-08 22:07:14,458 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} ~input~0 := #t~nondet1; {512#true} is VALID [2020-07-08 22:07:14,458 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#true} havoc #t~nondet1; {512#true} is VALID [2020-07-08 22:07:14,459 INFO L263 TraceCheckUtils]: 7: Hoare triple {512#true} call #t~ret2 := id(~input~0); {512#true} is VALID [2020-07-08 22:07:14,459 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-08 22:07:14,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-08 22:07:14,465 INFO L263 TraceCheckUtils]: 10: Hoare triple {512#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {512#true} is VALID [2020-07-08 22:07:14,465 INFO L280 TraceCheckUtils]: 11: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-08 22:07:14,466 INFO L280 TraceCheckUtils]: 12: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-08 22:07:14,469 INFO L280 TraceCheckUtils]: 13: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:14,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:14,473 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:14,474 INFO L280 TraceCheckUtils]: 16: Hoare triple {538#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:14,475 INFO L280 TraceCheckUtils]: 17: Hoare triple {538#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:14,476 INFO L280 TraceCheckUtils]: 18: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:14,477 INFO L280 TraceCheckUtils]: 19: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {539#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:14,477 INFO L280 TraceCheckUtils]: 20: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:14,478 INFO L280 TraceCheckUtils]: 21: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:14,480 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-08 22:07:14,482 INFO L280 TraceCheckUtils]: 23: Hoare triple {531#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-08 22:07:14,501 INFO L280 TraceCheckUtils]: 24: Hoare triple {531#(<= |main_#t~ret2| 1)} ~result~0 := #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-08 22:07:14,502 INFO L280 TraceCheckUtils]: 25: Hoare triple {532#(<= main_~result~0 1)} havoc #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-08 22:07:14,503 INFO L280 TraceCheckUtils]: 26: Hoare triple {532#(<= main_~result~0 1)} assume 5 == ~result~0; {513#false} is VALID [2020-07-08 22:07:14,503 INFO L280 TraceCheckUtils]: 27: Hoare triple {513#false} assume !false; {513#false} is VALID [2020-07-08 22:07:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 22:07:14,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1198840504] [2020-07-08 22:07:14,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:07:14,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-08 22:07:14,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249892273] [2020-07-08 22:07:14,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-08 22:07:14,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:14,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 22:07:14,561 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-08 22:07:14,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 22:07:14,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:14,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 22:07:14,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:07:14,562 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2020-07-08 22:07:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:14,916 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-08 22:07:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 22:07:14,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-08 22:07:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 22:07:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-08 22:07:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 22:07:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-08 22:07:14,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-08 22:07:14,987 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-08 22:07:14,989 INFO L225 Difference]: With dead ends: 41 [2020-07-08 22:07:14,989 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 22:07:14,990 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-08 22:07:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 22:07:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-08 22:07:15,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:15,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-08 22:07:15,026 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 22:07:15,027 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 22:07:15,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:15,030 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-08 22:07:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-08 22:07:15,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:15,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:15,031 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 22:07:15,031 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 22:07:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:15,034 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-08 22:07:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-08 22:07:15,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:15,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:15,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:15,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 22:07:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-08 22:07:15,038 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-08 22:07:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:15,038 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-08 22:07:15,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 22:07:15,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-08 22:07:15,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-08 22:07:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 22:07:15,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:15,076 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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-08 22:07:15,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:07:15,077 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash 170302224, now seen corresponding path program 1 times [2020-07-08 22:07:15,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:15,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2085117866] [2020-07-08 22:07:15,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-08 22:07:15,129 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-08 22:07:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-08 22:07:15,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-08 22:07:15,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-08 22:07:15,234 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-08 22:07:15,234 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-08 22:07:15,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-08 22:07:15,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-08 22:07:15,235 INFO L263 TraceCheckUtils]: 2: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-08 22:07:15,235 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-08 22:07:15,235 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-08 22:07:15,236 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-08 22:07:15,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-08 22:07:15,236 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-08 22:07:15,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-08 22:07:15,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,240 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-08 22:07:15,241 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-08 22:07:15,241 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-08 22:07:15,241 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-08 22:07:15,242 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-08 22:07:15,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-08 22:07:15,242 INFO L263 TraceCheckUtils]: 2: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-08 22:07:15,242 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-08 22:07:15,243 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-08 22:07:15,243 INFO L263 TraceCheckUtils]: 5: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-08 22:07:15,245 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-08 22:07:15,246 INFO L280 TraceCheckUtils]: 7: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-08 22:07:15,246 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-08 22:07:15,246 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-08 22:07:15,246 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-08 22:07:15,247 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-08 22:07:15,247 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,247 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,247 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-08 22:07:15,248 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-08 22:07:15,248 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-08 22:07:15,251 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-08 22:07:15,251 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-08 22:07:15,251 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,251 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,252 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} assume ~ret~0 > 3; {772#true} is VALID [2020-07-08 22:07:15,253 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} #res := 3; {818#(<= |id_#res| 3)} is VALID [2020-07-08 22:07:15,257 INFO L280 TraceCheckUtils]: 23: Hoare triple {818#(<= |id_#res| 3)} assume true; {818#(<= |id_#res| 3)} is VALID [2020-07-08 22:07:15,258 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {818#(<= |id_#res| 3)} {772#true} #43#return; {801#(<= |main_#t~ret2| 3)} is VALID [2020-07-08 22:07:15,259 INFO L263 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2020-07-08 22:07:15,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-08 22:07:15,259 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-08 22:07:15,260 INFO L263 TraceCheckUtils]: 3: Hoare triple {772#true} call #t~ret3 := main(); {772#true} is VALID [2020-07-08 22:07:15,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {772#true} is VALID [2020-07-08 22:07:15,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} ~input~0 := #t~nondet1; {772#true} is VALID [2020-07-08 22:07:15,260 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} havoc #t~nondet1; {772#true} is VALID [2020-07-08 22:07:15,261 INFO L263 TraceCheckUtils]: 7: Hoare triple {772#true} call #t~ret2 := id(~input~0); {772#true} is VALID [2020-07-08 22:07:15,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-08 22:07:15,261 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-08 22:07:15,261 INFO L263 TraceCheckUtils]: 10: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-08 22:07:15,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-08 22:07:15,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-08 22:07:15,262 INFO L263 TraceCheckUtils]: 13: Hoare triple {772#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {772#true} is VALID [2020-07-08 22:07:15,262 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-08 22:07:15,262 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-08 22:07:15,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-08 22:07:15,263 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-08 22:07:15,263 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-08 22:07:15,263 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-08 22:07:15,264 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,264 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,264 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-08 22:07:15,266 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-08 22:07:15,266 INFO L280 TraceCheckUtils]: 24: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-08 22:07:15,266 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-08 22:07:15,266 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-08 22:07:15,267 INFO L280 TraceCheckUtils]: 27: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,267 INFO L280 TraceCheckUtils]: 28: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-08 22:07:15,267 INFO L280 TraceCheckUtils]: 29: Hoare triple {772#true} assume ~ret~0 > 3; {772#true} is VALID [2020-07-08 22:07:15,268 INFO L280 TraceCheckUtils]: 30: Hoare triple {772#true} #res := 3; {818#(<= |id_#res| 3)} is VALID [2020-07-08 22:07:15,269 INFO L280 TraceCheckUtils]: 31: Hoare triple {818#(<= |id_#res| 3)} assume true; {818#(<= |id_#res| 3)} is VALID [2020-07-08 22:07:15,270 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {818#(<= |id_#res| 3)} {772#true} #43#return; {801#(<= |main_#t~ret2| 3)} is VALID [2020-07-08 22:07:15,271 INFO L280 TraceCheckUtils]: 33: Hoare triple {801#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {801#(<= |main_#t~ret2| 3)} is VALID [2020-07-08 22:07:15,272 INFO L280 TraceCheckUtils]: 34: Hoare triple {801#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {802#(<= main_~result~0 3)} is VALID [2020-07-08 22:07:15,273 INFO L280 TraceCheckUtils]: 35: Hoare triple {802#(<= main_~result~0 3)} havoc #t~ret2; {802#(<= main_~result~0 3)} is VALID [2020-07-08 22:07:15,273 INFO L280 TraceCheckUtils]: 36: Hoare triple {802#(<= main_~result~0 3)} assume 5 == ~result~0; {773#false} is VALID [2020-07-08 22:07:15,273 INFO L280 TraceCheckUtils]: 37: Hoare triple {773#false} assume !false; {773#false} is VALID [2020-07-08 22:07:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-08 22:07:15,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2085117866] [2020-07-08 22:07:15,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:07:15,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 22:07:15,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480451656] [2020-07-08 22:07:15,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-08 22:07:15,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:15,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 22:07:15,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:15,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 22:07:15,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:15,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 22:07:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 22:07:15,309 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2020-07-08 22:07:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:15,446 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-08 22:07:15,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 22:07:15,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-08 22:07:15,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:07:15,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-08 22:07:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 22:07:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-08 22:07:15,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-08 22:07:15,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:15,494 INFO L225 Difference]: With dead ends: 43 [2020-07-08 22:07:15,494 INFO L226 Difference]: Without dead ends: 37 [2020-07-08 22:07:15,495 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:07:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-08 22:07:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-08 22:07:15,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:15,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-08 22:07:15,535 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-08 22:07:15,535 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-08 22:07:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:15,538 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-08 22:07:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-08 22:07:15,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:15,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:15,539 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-08 22:07:15,539 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-08 22:07:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:15,542 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-08 22:07:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-08 22:07:15,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:15,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:15,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:15,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 22:07:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-08 22:07:15,551 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 38 [2020-07-08 22:07:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:15,551 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-08 22:07:15,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 22:07:15,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-08 22:07:15,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-08 22:07:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-08 22:07:15,602 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:15,603 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:07:15,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:07:15,603 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:15,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:15,603 INFO L82 PathProgramCache]: Analyzing trace with hash 41013968, now seen corresponding path program 2 times [2020-07-08 22:07:15,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:15,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255532008] [2020-07-08 22:07:15,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-08 22:07:15,713 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-08 22:07:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:15,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-08 22:07:15,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-08 22:07:15,895 INFO L280 TraceCheckUtils]: 2: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:15,895 INFO L280 TraceCheckUtils]: 3: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:15,897 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:15,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-08 22:07:15,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-08 22:07:15,898 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-08 22:07:15,898 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-08 22:07:15,898 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-08 22:07:15,899 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:15,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:15,901 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:15,902 INFO L280 TraceCheckUtils]: 8: Hoare triple {1112#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:15,903 INFO L280 TraceCheckUtils]: 9: Hoare triple {1112#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:15,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:15,904 INFO L280 TraceCheckUtils]: 11: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1113#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:15,905 INFO L280 TraceCheckUtils]: 12: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:15,905 INFO L280 TraceCheckUtils]: 13: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:15,907 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:15,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-08 22:07:15,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-08 22:07:15,908 INFO L263 TraceCheckUtils]: 2: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-08 22:07:15,908 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-08 22:07:15,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-08 22:07:15,909 INFO L263 TraceCheckUtils]: 5: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-08 22:07:15,909 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-08 22:07:15,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-08 22:07:15,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:15,911 INFO L280 TraceCheckUtils]: 9: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:15,912 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:15,913 INFO L280 TraceCheckUtils]: 11: Hoare triple {1112#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:15,914 INFO L280 TraceCheckUtils]: 12: Hoare triple {1112#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:15,914 INFO L280 TraceCheckUtils]: 13: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:15,915 INFO L280 TraceCheckUtils]: 14: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1113#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:15,916 INFO L280 TraceCheckUtils]: 15: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:15,916 INFO L280 TraceCheckUtils]: 16: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:15,918 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:15,919 INFO L280 TraceCheckUtils]: 18: Hoare triple {1104#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:15,919 INFO L280 TraceCheckUtils]: 19: Hoare triple {1104#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:15,920 INFO L280 TraceCheckUtils]: 20: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:15,921 INFO L280 TraceCheckUtils]: 21: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1105#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:15,922 INFO L280 TraceCheckUtils]: 22: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:15,922 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:15,924 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-08 22:07:15,925 INFO L263 TraceCheckUtils]: 0: Hoare triple {1058#true} call ULTIMATE.init(); {1058#true} is VALID [2020-07-08 22:07:15,925 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-08 22:07:15,925 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-08 22:07:15,926 INFO L263 TraceCheckUtils]: 3: Hoare triple {1058#true} call #t~ret3 := main(); {1058#true} is VALID [2020-07-08 22:07:15,926 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1058#true} is VALID [2020-07-08 22:07:15,926 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} ~input~0 := #t~nondet1; {1058#true} is VALID [2020-07-08 22:07:15,926 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} havoc #t~nondet1; {1058#true} is VALID [2020-07-08 22:07:15,927 INFO L263 TraceCheckUtils]: 7: Hoare triple {1058#true} call #t~ret2 := id(~input~0); {1058#true} is VALID [2020-07-08 22:07:15,927 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-08 22:07:15,927 INFO L280 TraceCheckUtils]: 9: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-08 22:07:15,927 INFO L263 TraceCheckUtils]: 10: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-08 22:07:15,928 INFO L280 TraceCheckUtils]: 11: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-08 22:07:15,928 INFO L280 TraceCheckUtils]: 12: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-08 22:07:15,928 INFO L263 TraceCheckUtils]: 13: Hoare triple {1058#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1058#true} is VALID [2020-07-08 22:07:15,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-08 22:07:15,929 INFO L280 TraceCheckUtils]: 15: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-08 22:07:15,929 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:15,930 INFO L280 TraceCheckUtils]: 17: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:15,931 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:15,932 INFO L280 TraceCheckUtils]: 19: Hoare triple {1112#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:15,933 INFO L280 TraceCheckUtils]: 20: Hoare triple {1112#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:15,934 INFO L280 TraceCheckUtils]: 21: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:15,934 INFO L280 TraceCheckUtils]: 22: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1113#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:15,935 INFO L280 TraceCheckUtils]: 23: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:15,936 INFO L280 TraceCheckUtils]: 24: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:15,937 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:15,938 INFO L280 TraceCheckUtils]: 26: Hoare triple {1104#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:15,938 INFO L280 TraceCheckUtils]: 27: Hoare triple {1104#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:15,939 INFO L280 TraceCheckUtils]: 28: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:15,940 INFO L280 TraceCheckUtils]: 29: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1105#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:15,940 INFO L280 TraceCheckUtils]: 30: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:15,941 INFO L280 TraceCheckUtils]: 31: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:15,942 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-08 22:07:15,943 INFO L280 TraceCheckUtils]: 33: Hoare triple {1087#(<= |main_#t~ret2| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-08 22:07:15,943 INFO L280 TraceCheckUtils]: 34: Hoare triple {1087#(<= |main_#t~ret2| 2)} ~result~0 := #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-08 22:07:15,944 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= main_~result~0 2)} havoc #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-08 22:07:15,945 INFO L280 TraceCheckUtils]: 36: Hoare triple {1088#(<= main_~result~0 2)} assume 5 == ~result~0; {1059#false} is VALID [2020-07-08 22:07:15,945 INFO L280 TraceCheckUtils]: 37: Hoare triple {1059#false} assume !false; {1059#false} is VALID [2020-07-08 22:07:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-08 22:07:15,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255532008] [2020-07-08 22:07:15,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:07:15,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 22:07:15,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752298611] [2020-07-08 22:07:15,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-08 22:07:15,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:15,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 22:07:15,987 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-08 22:07:15,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 22:07:15,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:15,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 22:07:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-08 22:07:15,988 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 11 states. [2020-07-08 22:07:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:16,282 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2020-07-08 22:07:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-08 22:07:16,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-08 22:07:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 22:07:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-08 22:07:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 22:07:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-08 22:07:16,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2020-07-08 22:07:16,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:16,356 INFO L225 Difference]: With dead ends: 64 [2020-07-08 22:07:16,356 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 22:07:16,358 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-08 22:07:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 22:07:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-08 22:07:16,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:16,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-08 22:07:16,399 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-08 22:07:16,399 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-08 22:07:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:16,402 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-08 22:07:16,402 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-08 22:07:16,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:16,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:16,403 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-08 22:07:16,404 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-08 22:07:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:16,407 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-08 22:07:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-08 22:07:16,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:16,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:16,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:16,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 22:07:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-08 22:07:16,411 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 38 [2020-07-08 22:07:16,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:16,411 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-08 22:07:16,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 22:07:16,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-08 22:07:16,466 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-08 22:07:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-08 22:07:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 22:07:16,468 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:07:16,468 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:07:16,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 22:07:16,468 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:07:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:07:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1045014785, now seen corresponding path program 3 times [2020-07-08 22:07:16,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:07:16,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [941323661] [2020-07-08 22:07:16,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:07:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:16,520 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-08 22:07:16,520 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-08 22:07:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:07:16,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-08 22:07:16,720 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,721 INFO L280 TraceCheckUtils]: 3: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,722 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:16,723 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,723 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-08 22:07:16,723 INFO L263 TraceCheckUtils]: 2: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-08 22:07:16,723 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,724 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-08 22:07:16,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,726 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:16,727 INFO L280 TraceCheckUtils]: 8: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:16,728 INFO L280 TraceCheckUtils]: 9: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,729 INFO L280 TraceCheckUtils]: 11: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,730 INFO L280 TraceCheckUtils]: 12: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:16,730 INFO L280 TraceCheckUtils]: 13: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:16,732 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:16,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-08 22:07:16,733 INFO L263 TraceCheckUtils]: 2: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-08 22:07:16,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,733 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-08 22:07:16,733 INFO L263 TraceCheckUtils]: 5: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-08 22:07:16,734 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,734 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-08 22:07:16,735 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,735 INFO L280 TraceCheckUtils]: 9: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,737 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:16,737 INFO L280 TraceCheckUtils]: 11: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:16,738 INFO L280 TraceCheckUtils]: 12: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,739 INFO L280 TraceCheckUtils]: 13: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,739 INFO L280 TraceCheckUtils]: 14: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,740 INFO L280 TraceCheckUtils]: 15: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:16,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:16,742 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:16,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {1512#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:16,743 INFO L280 TraceCheckUtils]: 19: Hoare triple {1512#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:16,744 INFO L280 TraceCheckUtils]: 20: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:16,745 INFO L280 TraceCheckUtils]: 21: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1513#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:16,745 INFO L280 TraceCheckUtils]: 22: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:16,746 INFO L280 TraceCheckUtils]: 23: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:16,747 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-08 22:07:16,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-08 22:07:16,749 INFO L263 TraceCheckUtils]: 2: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-08 22:07:16,749 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-08 22:07:16,749 INFO L263 TraceCheckUtils]: 5: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-08 22:07:16,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-08 22:07:16,750 INFO L263 TraceCheckUtils]: 8: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-08 22:07:16,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,750 INFO L280 TraceCheckUtils]: 10: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-08 22:07:16,751 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,752 INFO L280 TraceCheckUtils]: 12: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,753 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:16,754 INFO L280 TraceCheckUtils]: 14: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:16,754 INFO L280 TraceCheckUtils]: 15: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,755 INFO L280 TraceCheckUtils]: 16: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,756 INFO L280 TraceCheckUtils]: 17: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,756 INFO L280 TraceCheckUtils]: 18: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:16,757 INFO L280 TraceCheckUtils]: 19: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:16,758 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:16,759 INFO L280 TraceCheckUtils]: 21: Hoare triple {1512#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:16,760 INFO L280 TraceCheckUtils]: 22: Hoare triple {1512#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:16,760 INFO L280 TraceCheckUtils]: 23: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:16,761 INFO L280 TraceCheckUtils]: 24: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1513#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:16,762 INFO L280 TraceCheckUtils]: 25: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:16,763 INFO L280 TraceCheckUtils]: 26: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:16,764 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-08 22:07:16,765 INFO L280 TraceCheckUtils]: 28: Hoare triple {1494#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-08 22:07:16,766 INFO L280 TraceCheckUtils]: 29: Hoare triple {1494#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-08 22:07:16,766 INFO L280 TraceCheckUtils]: 30: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-08 22:07:16,767 INFO L280 TraceCheckUtils]: 31: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 3); {1495#(<= id_~ret~0 3)} is VALID [2020-07-08 22:07:16,768 INFO L280 TraceCheckUtils]: 32: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-08 22:07:16,768 INFO L280 TraceCheckUtils]: 33: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-08 22:07:16,769 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-08 22:07:16,771 INFO L263 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2020-07-08 22:07:16,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-08 22:07:16,771 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-08 22:07:16,772 INFO L263 TraceCheckUtils]: 3: Hoare triple {1428#true} call #t~ret3 := main(); {1428#true} is VALID [2020-07-08 22:07:16,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1428#true} is VALID [2020-07-08 22:07:16,772 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} ~input~0 := #t~nondet1; {1428#true} is VALID [2020-07-08 22:07:16,772 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} havoc #t~nondet1; {1428#true} is VALID [2020-07-08 22:07:16,773 INFO L263 TraceCheckUtils]: 7: Hoare triple {1428#true} call #t~ret2 := id(~input~0); {1428#true} is VALID [2020-07-08 22:07:16,773 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,773 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-08 22:07:16,773 INFO L263 TraceCheckUtils]: 10: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-08 22:07:16,773 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,774 INFO L280 TraceCheckUtils]: 12: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-08 22:07:16,774 INFO L263 TraceCheckUtils]: 13: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-08 22:07:16,774 INFO L280 TraceCheckUtils]: 14: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,774 INFO L280 TraceCheckUtils]: 15: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-08 22:07:16,774 INFO L263 TraceCheckUtils]: 16: Hoare triple {1428#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {1428#true} is VALID [2020-07-08 22:07:16,775 INFO L280 TraceCheckUtils]: 17: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-08 22:07:16,775 INFO L280 TraceCheckUtils]: 18: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-08 22:07:16,776 INFO L280 TraceCheckUtils]: 19: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,776 INFO L280 TraceCheckUtils]: 20: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-08 22:07:16,778 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:16,778 INFO L280 TraceCheckUtils]: 22: Hoare triple {1520#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-08 22:07:16,779 INFO L280 TraceCheckUtils]: 23: Hoare triple {1520#(= 0 |id_#t~ret0|)} ~ret~0 := 1 + #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,779 INFO L280 TraceCheckUtils]: 24: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,780 INFO L280 TraceCheckUtils]: 25: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-08 22:07:16,781 INFO L280 TraceCheckUtils]: 26: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:16,781 INFO L280 TraceCheckUtils]: 27: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-08 22:07:16,782 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:16,783 INFO L280 TraceCheckUtils]: 29: Hoare triple {1512#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 22:07:16,784 INFO L280 TraceCheckUtils]: 30: Hoare triple {1512#(<= |id_#t~ret0| 1)} ~ret~0 := 1 + #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:16,784 INFO L280 TraceCheckUtils]: 31: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:16,785 INFO L280 TraceCheckUtils]: 32: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1513#(<= id_~ret~0 2)} is VALID [2020-07-08 22:07:16,786 INFO L280 TraceCheckUtils]: 33: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:16,786 INFO L280 TraceCheckUtils]: 34: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-08 22:07:16,787 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-08 22:07:16,788 INFO L280 TraceCheckUtils]: 36: Hoare triple {1494#(<= |id_#t~ret0| 2)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-08 22:07:16,789 INFO L280 TraceCheckUtils]: 37: Hoare triple {1494#(<= |id_#t~ret0| 2)} ~ret~0 := 1 + #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-08 22:07:16,789 INFO L280 TraceCheckUtils]: 38: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-08 22:07:16,790 INFO L280 TraceCheckUtils]: 39: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 3); {1495#(<= id_~ret~0 3)} is VALID [2020-07-08 22:07:16,790 INFO L280 TraceCheckUtils]: 40: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-08 22:07:16,791 INFO L280 TraceCheckUtils]: 41: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-08 22:07:16,792 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-08 22:07:16,793 INFO L280 TraceCheckUtils]: 43: Hoare triple {1467#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-08 22:07:16,793 INFO L280 TraceCheckUtils]: 44: Hoare triple {1467#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-08 22:07:16,794 INFO L280 TraceCheckUtils]: 45: Hoare triple {1468#(<= main_~result~0 3)} havoc #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-08 22:07:16,794 INFO L280 TraceCheckUtils]: 46: Hoare triple {1468#(<= main_~result~0 3)} assume 5 == ~result~0; {1429#false} is VALID [2020-07-08 22:07:16,795 INFO L280 TraceCheckUtils]: 47: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2020-07-08 22:07:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-08 22:07:16,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [941323661] [2020-07-08 22:07:16,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:07:16,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-08 22:07:16,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431316510] [2020-07-08 22:07:16,799 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-08 22:07:16,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:07:16,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 22:07:16,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:16,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 22:07:16,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:07:16,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 22:07:16,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-08 22:07:16,845 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 14 states. [2020-07-08 22:07:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:17,244 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2020-07-08 22:07:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 22:07:17,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-08 22:07:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:07:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 22:07:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2020-07-08 22:07:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 22:07:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2020-07-08 22:07:17,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 65 transitions. [2020-07-08 22:07:17,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:07:17,325 INFO L225 Difference]: With dead ends: 62 [2020-07-08 22:07:17,325 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 22:07:17,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2020-07-08 22:07:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 22:07:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 22:07:17,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:07:17,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 22:07:17,328 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:07:17,328 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:07:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:17,328 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:07:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:07:17,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:17,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:17,329 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 22:07:17,329 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 22:07:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:07:17,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 22:07:17,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:07:17,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:17,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:07:17,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:07:17,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:07:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 22:07:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 22:07:17,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-08 22:07:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:07:17,331 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 22:07:17,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 22:07:17,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 22:07:17,332 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-08 22:07:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 22:07:17,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:07:17,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 22:07:17,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 22:07:17,624 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:07:17,624 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:07:17,624 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 22:07:17,624 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 22:07:17,624 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 22:07:17,625 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 22:07:17,625 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) the Hoare annotation is: false [2020-07-08 22:07:17,625 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-08 22:07:17,625 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: true [2020-07-08 22:07:17,625 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-07-08 22:07:17,625 INFO L264 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (<= main_~result~0 3) [2020-07-08 22:07:17,625 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-08 22:07:17,626 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-08 22:07:17,626 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (<= |main_#t~ret2| 3) [2020-07-08 22:07:17,626 INFO L271 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: true [2020-07-08 22:07:17,626 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-08 22:07:17,626 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (<= |main_#t~ret2| 3) [2020-07-08 22:07:17,626 INFO L264 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret2| 3) (<= main_~result~0 3)) [2020-07-08 22:07:17,627 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 9) the Hoare annotation is: (<= |id_#res| 3) [2020-07-08 22:07:17,627 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 9) the Hoare annotation is: (<= |id_#res| 3) [2020-07-08 22:07:17,627 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-08 22:07:17,627 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (<= id_~ret~0 3) [2020-07-08 22:07:17,627 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-08 22:07:17,627 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-08 22:07:17,627 INFO L271 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: true [2020-07-08 22:07:17,627 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-08 22:07:17,627 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-08 22:07:17,628 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-08 22:07:17,628 INFO L271 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: true [2020-07-08 22:07:17,628 INFO L271 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: true [2020-07-08 22:07:17,638 INFO L163 areAnnotationChecker]: CFG has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 22:07:17,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:07:17 BoogieIcfgContainer [2020-07-08 22:07:17,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:07:17,654 INFO L168 Benchmark]: Toolchain (without parser) took 5736.07 ms. Allocated memory was 137.4 MB in the beginning and 284.2 MB in the end (delta: 146.8 MB). Free memory was 102.8 MB in the beginning and 244.8 MB in the end (delta: -142.0 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:17,655 INFO L168 Benchmark]: CDTParser took 0.85 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 22:07:17,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.85 ms. Allocated memory is still 137.4 MB. Free memory was 102.6 MB in the beginning and 92.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:17,656 INFO L168 Benchmark]: Boogie Preprocessor took 35.38 ms. Allocated memory is still 137.4 MB. Free memory was 92.8 MB in the beginning and 91.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:17,657 INFO L168 Benchmark]: RCFGBuilder took 409.72 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 91.3 MB in the beginning and 165.0 MB in the end (delta: -73.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:17,658 INFO L168 Benchmark]: TraceAbstraction took 5031.50 ms. Allocated memory was 202.4 MB in the beginning and 284.2 MB in the end (delta: 81.8 MB). Free memory was 165.0 MB in the beginning and 244.8 MB in the end (delta: -79.8 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-08 22:07:17,661 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.85 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 253.85 ms. Allocated memory is still 137.4 MB. Free memory was 102.6 MB in the beginning and 92.8 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.38 ms. Allocated memory is still 137.4 MB. Free memory was 92.8 MB in the beginning and 91.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 409.72 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 91.3 MB in the beginning and 165.0 MB in the end (delta: -73.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5031.50 ms. Allocated memory was 202.4 MB in the beginning and 284.2 MB in the end (delta: 81.8 MB). Free memory was 165.0 MB in the beginning and 244.8 MB in the end (delta: -79.8 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: 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 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 4]: Procedure Contract for id Derived contract for procedure id: \result <= 3 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 151 SDtfs, 35 SDslu, 612 SDs, 0 SdLazy, 204 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 42 PreInvPairs, 134 NumberOfFragments, 48 HoareAnnotationTreeSize, 42 FomulaSimplifications, 282 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 30 FomulaSimplificationsInter, 133 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 12386 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 45/85 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...