/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-267fbe0 [2020-07-18 04:57:34,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:57:34,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:57:34,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:57:34,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:57:34,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:57:34,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:57:34,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:57:34,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:57:34,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:57:34,229 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:57:34,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:57:34,231 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:57:34,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:57:34,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:57:34,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:57:34,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:57:34,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:57:34,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:57:34,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:57:34,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:57:34,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:57:34,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:57:34,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:57:34,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:57:34,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:57:34,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:57:34,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:57:34,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:57:34,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:57:34,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:57:34,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:57:34,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:57:34,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:57:34,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:57:34,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:57:34,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:57:34,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:57:34,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:57:34,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:57:34,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:57:34,269 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:57:34,295 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:57:34,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:57:34,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:57:34,297 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:57:34,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:57:34,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:57:34,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:57:34,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:57:34,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:57:34,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:57:34,301 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:57:34,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:57:34,302 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:57:34,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:57:34,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:57:34,302 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:57:34,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:57:34,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:57:34,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:57:34,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:57:34,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:57:34,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:57:34,305 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-18 04:57:34,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:57:34,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:57:34,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:57:34,599 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:57:34,599 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:57:34,600 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-18 04:57:34,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53d31635/dcb13c91178c43659f440af5073ccf70/FLAGef0030ff4 [2020-07-18 04:57:35,108 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:57:35,109 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-18 04:57:35,115 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53d31635/dcb13c91178c43659f440af5073ccf70/FLAGef0030ff4 [2020-07-18 04:57:35,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53d31635/dcb13c91178c43659f440af5073ccf70 [2020-07-18 04:57:35,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:57:35,508 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:57:35,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:57:35,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:57:35,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:57:35,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:57:35" (1/1) ... [2020-07-18 04:57:35,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f85dd94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35, skipping insertion in model container [2020-07-18 04:57:35,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:57:35" (1/1) ... [2020-07-18 04:57:35,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:57:35,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:57:35,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:57:35,702 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:57:35,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:57:35,734 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:57:35,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35 WrapperNode [2020-07-18 04:57:35,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:57:35,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:57:35,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:57:35,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:57:35,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35" (1/1) ... [2020-07-18 04:57:35,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35" (1/1) ... [2020-07-18 04:57:35,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35" (1/1) ... [2020-07-18 04:57:35,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35" (1/1) ... [2020-07-18 04:57:35,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35" (1/1) ... [2020-07-18 04:57:35,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35" (1/1) ... [2020-07-18 04:57:35,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35" (1/1) ... [2020-07-18 04:57:35,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:57:35,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:57:35,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:57:35,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:57:35,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:57:35,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:57:35,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:57:35,920 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-18 04:57:35,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:57:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:57:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:57:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-18 04:57:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:57:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:57:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:57:36,183 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:57:36,183 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:57:36,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:57:36 BoogieIcfgContainer [2020-07-18 04:57:36,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:57:36,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:57:36,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:57:36,199 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:57:36,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:57:35" (1/3) ... [2020-07-18 04:57:36,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bbfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:57:36, skipping insertion in model container [2020-07-18 04:57:36,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:57:35" (2/3) ... [2020-07-18 04:57:36,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74bbfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:57:36, skipping insertion in model container [2020-07-18 04:57:36,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:57:36" (3/3) ... [2020-07-18 04:57:36,204 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o5-2.c [2020-07-18 04:57:36,216 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:57:36,227 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:57:36,264 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:57:36,285 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:57:36,286 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:57:36,286 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:57:36,286 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:57:36,286 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:57:36,286 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:57:36,286 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:57:36,286 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:57:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-18 04:57:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 04:57:36,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:36,312 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-18 04:57:36,312 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:36,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-18 04:57:36,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:36,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [605303411] [2020-07-18 04:57:36,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:36,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 04:57:36,519 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 04:57:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:36,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 04:57:36,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 04:57:36,561 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:36,562 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:36,564 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 04:57:36,564 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-18 04:57:36,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 04:57:36,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 04:57:36,566 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-18 04:57:36,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-18 04:57:36,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-18 04:57:36,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-18 04:57:36,567 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-18 04:57:36,568 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 04:57:36,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 04:57:36,569 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:36,570 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:36,572 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 04:57:36,573 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-18 04:57:36,574 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= |main_#t~ret2| 0)} ~result~0 := #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-18 04:57:36,575 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= main_~result~0 0)} havoc #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-18 04:57:36,576 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 5 == ~result~0; {34#false} is VALID [2020-07-18 04:57:36,577 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-18 04:57:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 04:57:36,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [605303411] [2020-07-18 04:57:36,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:57:36,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:57:36,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380646576] [2020-07-18 04:57:36,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:57:36,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:36,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:57:36,642 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-18 04:57:36,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:57:36,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:36,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:57:36,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:57:36,654 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-18 04:57:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:36,958 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-18 04:57:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:57:36,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 04:57:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 04:57:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 04:57:36,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-18 04:57:37,064 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-18 04:57:37,077 INFO L225 Difference]: With dead ends: 44 [2020-07-18 04:57:37,077 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 04:57:37,081 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-18 04:57:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 04:57:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 04:57:37,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:37,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:37,140 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:37,141 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:37,147 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 04:57:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 04:57:37,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:37,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:37,149 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:37,149 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 04:57:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:37,155 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 04:57:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 04:57:37,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:37,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:37,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:37,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 04:57:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-18 04:57:37,162 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-18 04:57:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:37,162 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-18 04:57:37,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:57:37,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-18 04:57:37,205 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-18 04:57:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 04:57:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 04:57:37,215 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:37,216 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-18 04:57:37,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:57:37,217 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:37,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-18 04:57:37,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:37,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [309354698] [2020-07-18 04:57:37,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:37,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 04:57:37,274 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 04:57:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:37,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:37,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 04:57:37,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,357 INFO L280 TraceCheckUtils]: 3: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,358 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:37,359 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:37,359 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-18 04:57:37,359 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-18 04:57:37,360 INFO L280 TraceCheckUtils]: 3: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:37,360 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 04:57:37,361 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,362 INFO L280 TraceCheckUtils]: 6: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,363 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:37,364 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-18 04:57:37,365 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-18 04:57:37,365 INFO L280 TraceCheckUtils]: 10: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:37,366 INFO L280 TraceCheckUtils]: 11: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 3; {250#false} is VALID [2020-07-18 04:57:37,366 INFO L280 TraceCheckUtils]: 12: Hoare triple {250#false} #res := 3; {250#false} is VALID [2020-07-18 04:57:37,367 INFO L280 TraceCheckUtils]: 13: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-18 04:57:37,367 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-18 04:57:37,368 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-18 04:57:37,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 04:57:37,369 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 04:57:37,369 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-18 04:57:37,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-18 04:57:37,370 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-18 04:57:37,370 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-18 04:57:37,370 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-18 04:57:37,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:37,371 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-18 04:57:37,371 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-18 04:57:37,372 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 04:57:37,372 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 04:57:37,373 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,373 INFO L280 TraceCheckUtils]: 14: Hoare triple {275#(= 0 |id_#res|)} assume true; {275#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,375 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {275#(= 0 |id_#res|)} {249#true} #45#return; {273#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:37,376 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-18 04:57:37,377 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-18 04:57:37,377 INFO L280 TraceCheckUtils]: 18: Hoare triple {274#(<= id_~ret~0 1)} havoc #t~ret0; {274#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:37,378 INFO L280 TraceCheckUtils]: 19: Hoare triple {274#(<= id_~ret~0 1)} assume ~ret~0 > 3; {250#false} is VALID [2020-07-18 04:57:37,378 INFO L280 TraceCheckUtils]: 20: Hoare triple {250#false} #res := 3; {250#false} is VALID [2020-07-18 04:57:37,379 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume true; {250#false} is VALID [2020-07-18 04:57:37,379 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {250#false} {249#true} #43#return; {250#false} is VALID [2020-07-18 04:57:37,379 INFO L280 TraceCheckUtils]: 23: Hoare triple {250#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {250#false} is VALID [2020-07-18 04:57:37,380 INFO L280 TraceCheckUtils]: 24: Hoare triple {250#false} ~result~0 := #t~ret2; {250#false} is VALID [2020-07-18 04:57:37,380 INFO L280 TraceCheckUtils]: 25: Hoare triple {250#false} havoc #t~ret2; {250#false} is VALID [2020-07-18 04:57:37,380 INFO L280 TraceCheckUtils]: 26: Hoare triple {250#false} assume 5 == ~result~0; {250#false} is VALID [2020-07-18 04:57:37,380 INFO L280 TraceCheckUtils]: 27: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-18 04:57:37,382 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-18 04:57:37,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [309354698] [2020-07-18 04:57:37,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:57:37,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:57:37,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209277731] [2020-07-18 04:57:37,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-18 04:57:37,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:37,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:57:37,417 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-18 04:57:37,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:57:37,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:37,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:57:37,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:57:37,418 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 5 states. [2020-07-18 04:57:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:37,569 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-18 04:57:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:57:37,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-18 04:57:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-18 04:57:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-18 04:57:37,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2020-07-18 04:57:37,643 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-18 04:57:37,646 INFO L225 Difference]: With dead ends: 49 [2020-07-18 04:57:37,647 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 04:57:37,648 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-18 04:57:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 04:57:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-18 04:57:37,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:37,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-18 04:57:37,679 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-18 04:57:37,679 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-18 04:57:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:37,683 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-18 04:57:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-18 04:57:37,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:37,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:37,685 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-18 04:57:37,685 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-18 04:57:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:37,689 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-18 04:57:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-18 04:57:37,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:37,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:37,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:37,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 04:57:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-18 04:57:37,694 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2020-07-18 04:57:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:37,695 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-18 04:57:37,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:57:37,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-18 04:57:37,733 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-18 04:57:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 04:57:37,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 04:57:37,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:37,735 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-18 04:57:37,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:57:37,736 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1645321695, now seen corresponding path program 1 times [2020-07-18 04:57:37,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:37,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [366690397] [2020-07-18 04:57:37,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:37,789 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-18 04:57:37,789 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-18 04:57:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:37,872 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:37,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-18 04:57:37,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,875 INFO L280 TraceCheckUtils]: 3: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,876 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:37,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:37,877 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-18 04:57:37,877 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-18 04:57:37,878 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:37,878 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-18 04:57:37,879 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,881 INFO L280 TraceCheckUtils]: 6: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,882 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:37,883 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-18 04:57:37,884 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-18 04:57:37,884 INFO L280 TraceCheckUtils]: 10: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:37,885 INFO L280 TraceCheckUtils]: 11: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:37,886 INFO L280 TraceCheckUtils]: 12: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:37,887 INFO L280 TraceCheckUtils]: 13: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:37,888 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 04:57:37,889 INFO L263 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2020-07-18 04:57:37,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {512#true} assume true; {512#true} is VALID [2020-07-18 04:57:37,890 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {512#true} {512#true} #39#return; {512#true} is VALID [2020-07-18 04:57:37,890 INFO L263 TraceCheckUtils]: 3: Hoare triple {512#true} call #t~ret3 := main(); {512#true} is VALID [2020-07-18 04:57:37,890 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {512#true} is VALID [2020-07-18 04:57:37,890 INFO L280 TraceCheckUtils]: 5: Hoare triple {512#true} ~input~0 := #t~nondet1; {512#true} is VALID [2020-07-18 04:57:37,891 INFO L280 TraceCheckUtils]: 6: Hoare triple {512#true} havoc #t~nondet1; {512#true} is VALID [2020-07-18 04:57:37,891 INFO L263 TraceCheckUtils]: 7: Hoare triple {512#true} call #t~ret2 := id(~input~0); {512#true} is VALID [2020-07-18 04:57:37,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:37,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {512#true} assume !(0 == ~x); {512#true} is VALID [2020-07-18 04:57:37,892 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-18 04:57:37,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {512#true} ~x := #in~x; {512#true} is VALID [2020-07-18 04:57:37,892 INFO L280 TraceCheckUtils]: 12: Hoare triple {512#true} assume 0 == ~x; {512#true} is VALID [2020-07-18 04:57:37,893 INFO L280 TraceCheckUtils]: 13: Hoare triple {512#true} #res := 0; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,894 INFO L280 TraceCheckUtils]: 14: Hoare triple {541#(= 0 |id_#res|)} assume true; {541#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:37,895 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {541#(= 0 |id_#res|)} {512#true} #45#return; {538#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:37,896 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-18 04:57:37,897 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-18 04:57:37,898 INFO L280 TraceCheckUtils]: 18: Hoare triple {539#(<= id_~ret~0 1)} havoc #t~ret0; {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:37,898 INFO L280 TraceCheckUtils]: 19: Hoare triple {539#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {539#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:37,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {539#(<= id_~ret~0 1)} #res := ~ret~0; {540#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:37,900 INFO L280 TraceCheckUtils]: 21: Hoare triple {540#(<= |id_#res| 1)} assume true; {540#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:37,901 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {540#(<= |id_#res| 1)} {512#true} #43#return; {531#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 04:57:37,902 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-18 04:57:37,903 INFO L280 TraceCheckUtils]: 24: Hoare triple {531#(<= |main_#t~ret2| 1)} ~result~0 := #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-18 04:57:37,904 INFO L280 TraceCheckUtils]: 25: Hoare triple {532#(<= main_~result~0 1)} havoc #t~ret2; {532#(<= main_~result~0 1)} is VALID [2020-07-18 04:57:37,904 INFO L280 TraceCheckUtils]: 26: Hoare triple {532#(<= main_~result~0 1)} assume 5 == ~result~0; {513#false} is VALID [2020-07-18 04:57:37,905 INFO L280 TraceCheckUtils]: 27: Hoare triple {513#false} assume !false; {513#false} is VALID [2020-07-18 04:57:37,906 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-18 04:57:37,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [366690397] [2020-07-18 04:57:37,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:37,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-18 04:57:37,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798853109] [2020-07-18 04:57:37,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 04:57:37,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:37,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 04:57:37,946 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-18 04:57:37,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 04:57:37,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:37,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 04:57:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:57:37,948 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2020-07-18 04:57:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:38,249 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-18 04:57:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 04:57:38,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 04:57:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:57:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 04:57:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:57:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 04:57:38,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-18 04:57:38,306 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-18 04:57:38,308 INFO L225 Difference]: With dead ends: 41 [2020-07-18 04:57:38,308 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 04:57:38,309 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-18 04:57:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 04:57:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-18 04:57:38,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:38,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:38,334 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:38,334 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:38,337 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 04:57:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 04:57:38,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:38,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:38,338 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:38,338 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 04:57:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:38,341 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 04:57:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 04:57:38,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:38,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:38,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:38,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 04:57:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-18 04:57:38,345 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-18 04:57:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:38,345 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-18 04:57:38,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 04:57:38,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-18 04:57:38,388 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-18 04:57:38,389 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 04:57:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 04:57:38,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:38,390 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-18 04:57:38,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:57:38,390 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:38,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:38,391 INFO L82 PathProgramCache]: Analyzing trace with hash 170302224, now seen corresponding path program 1 times [2020-07-18 04:57:38,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:38,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [673511102] [2020-07-18 04:57:38,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:38,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:38,448 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-18 04:57:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:38,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:38,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-18 04:57:38,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-18 04:57:38,529 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:38,529 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:38,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:38,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:38,530 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-18 04:57:38,530 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:38,531 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-18 04:57:38,531 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-18 04:57:38,531 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:38,531 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:38,532 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:38,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,532 INFO L280 TraceCheckUtils]: 10: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,532 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-18 04:57:38,533 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-18 04:57:38,533 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:38,533 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:38,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:38,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:38,534 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-18 04:57:38,534 INFO L280 TraceCheckUtils]: 3: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:38,535 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:38,535 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-18 04:57:38,535 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:38,535 INFO L280 TraceCheckUtils]: 7: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-18 04:57:38,536 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-18 04:57:38,536 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:38,536 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:38,536 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:38,537 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,537 INFO L280 TraceCheckUtils]: 13: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-18 04:57:38,537 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-18 04:57:38,538 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:38,538 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:38,538 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:38,538 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,539 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,539 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} assume ~ret~0 > 3; {772#true} is VALID [2020-07-18 04:57:38,540 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} #res := 3; {818#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:38,540 INFO L280 TraceCheckUtils]: 23: Hoare triple {818#(<= |id_#res| 3)} assume true; {818#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:38,542 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {818#(<= |id_#res| 3)} {772#true} #43#return; {801#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 04:57:38,542 INFO L263 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2020-07-18 04:57:38,543 INFO L280 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:38,543 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #39#return; {772#true} is VALID [2020-07-18 04:57:38,543 INFO L263 TraceCheckUtils]: 3: Hoare triple {772#true} call #t~ret3 := main(); {772#true} is VALID [2020-07-18 04:57:38,543 INFO L280 TraceCheckUtils]: 4: Hoare triple {772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:38,544 INFO L280 TraceCheckUtils]: 5: Hoare triple {772#true} ~input~0 := #t~nondet1; {772#true} is VALID [2020-07-18 04:57:38,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {772#true} havoc #t~nondet1; {772#true} is VALID [2020-07-18 04:57:38,544 INFO L263 TraceCheckUtils]: 7: Hoare triple {772#true} call #t~ret2 := id(~input~0); {772#true} is VALID [2020-07-18 04:57:38,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:38,545 INFO L280 TraceCheckUtils]: 9: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:38,545 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-18 04:57:38,545 INFO L280 TraceCheckUtils]: 11: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:38,545 INFO L280 TraceCheckUtils]: 12: Hoare triple {772#true} assume !(0 == ~x); {772#true} is VALID [2020-07-18 04:57:38,545 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-18 04:57:38,546 INFO L280 TraceCheckUtils]: 14: Hoare triple {772#true} ~x := #in~x; {772#true} is VALID [2020-07-18 04:57:38,546 INFO L280 TraceCheckUtils]: 15: Hoare triple {772#true} assume 0 == ~x; {772#true} is VALID [2020-07-18 04:57:38,546 INFO L280 TraceCheckUtils]: 16: Hoare triple {772#true} #res := 0; {772#true} is VALID [2020-07-18 04:57:38,546 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:38,547 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:38,547 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:38,547 INFO L280 TraceCheckUtils]: 20: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,547 INFO L280 TraceCheckUtils]: 21: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,547 INFO L280 TraceCheckUtils]: 22: Hoare triple {772#true} assume !(~ret~0 > 3); {772#true} is VALID [2020-07-18 04:57:38,548 INFO L280 TraceCheckUtils]: 23: Hoare triple {772#true} #res := ~ret~0; {772#true} is VALID [2020-07-18 04:57:38,548 INFO L280 TraceCheckUtils]: 24: Hoare triple {772#true} assume true; {772#true} is VALID [2020-07-18 04:57:38,548 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {772#true} {772#true} #45#return; {772#true} is VALID [2020-07-18 04:57:38,548 INFO L280 TraceCheckUtils]: 26: Hoare triple {772#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {772#true} is VALID [2020-07-18 04:57:38,549 INFO L280 TraceCheckUtils]: 27: Hoare triple {772#true} ~ret~0 := 1 + #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,549 INFO L280 TraceCheckUtils]: 28: Hoare triple {772#true} havoc #t~ret0; {772#true} is VALID [2020-07-18 04:57:38,549 INFO L280 TraceCheckUtils]: 29: Hoare triple {772#true} assume ~ret~0 > 3; {772#true} is VALID [2020-07-18 04:57:38,550 INFO L280 TraceCheckUtils]: 30: Hoare triple {772#true} #res := 3; {818#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:38,551 INFO L280 TraceCheckUtils]: 31: Hoare triple {818#(<= |id_#res| 3)} assume true; {818#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:38,552 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {818#(<= |id_#res| 3)} {772#true} #43#return; {801#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 04:57:38,553 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-18 04:57:38,554 INFO L280 TraceCheckUtils]: 34: Hoare triple {801#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {802#(<= main_~result~0 3)} is VALID [2020-07-18 04:57:38,555 INFO L280 TraceCheckUtils]: 35: Hoare triple {802#(<= main_~result~0 3)} havoc #t~ret2; {802#(<= main_~result~0 3)} is VALID [2020-07-18 04:57:38,555 INFO L280 TraceCheckUtils]: 36: Hoare triple {802#(<= main_~result~0 3)} assume 5 == ~result~0; {773#false} is VALID [2020-07-18 04:57:38,556 INFO L280 TraceCheckUtils]: 37: Hoare triple {773#false} assume !false; {773#false} is VALID [2020-07-18 04:57:38,557 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-18 04:57:38,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [673511102] [2020-07-18 04:57:38,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:57:38,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 04:57:38,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821981594] [2020-07-18 04:57:38,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-18 04:57:38,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:38,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:57:38,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:38,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:57:38,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:38,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:57:38,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:57:38,599 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2020-07-18 04:57:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:38,722 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-18 04:57:38,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 04:57:38,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-07-18 04:57:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-18 04:57:38,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:57:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-18 04:57:38,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-18 04:57:38,764 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-18 04:57:38,766 INFO L225 Difference]: With dead ends: 43 [2020-07-18 04:57:38,766 INFO L226 Difference]: Without dead ends: 37 [2020-07-18 04:57:38,769 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-18 04:57:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-18 04:57:38,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2020-07-18 04:57:38,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:38,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 35 states. [2020-07-18 04:57:38,808 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 35 states. [2020-07-18 04:57:38,808 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 35 states. [2020-07-18 04:57:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:38,811 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-18 04:57:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-18 04:57:38,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:38,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:38,812 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 37 states. [2020-07-18 04:57:38,812 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 37 states. [2020-07-18 04:57:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:38,814 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-18 04:57:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-18 04:57:38,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:38,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:38,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:38,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 04:57:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-18 04:57:38,818 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 38 [2020-07-18 04:57:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:38,818 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-18 04:57:38,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:57:38,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-18 04:57:38,857 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-18 04:57:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 04:57:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 04:57:38,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:38,859 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-18 04:57:38,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:57:38,859 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash 41013968, now seen corresponding path program 2 times [2020-07-18 04:57:38,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:38,860 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [965358798] [2020-07-18 04:57:38,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:38,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-18 04:57:38,905 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-18 04:57:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:39,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:39,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-18 04:57:39,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,053 INFO L280 TraceCheckUtils]: 3: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,054 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:39,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:39,055 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:39,055 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-18 04:57:39,055 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:39,056 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-18 04:57:39,056 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,057 INFO L280 TraceCheckUtils]: 6: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,058 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:39,058 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-18 04:57:39,059 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-18 04:57:39,060 INFO L280 TraceCheckUtils]: 10: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,060 INFO L280 TraceCheckUtils]: 11: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,061 INFO L280 TraceCheckUtils]: 12: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,061 INFO L280 TraceCheckUtils]: 13: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,063 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:39,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:39,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:39,064 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-18 04:57:39,064 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:39,064 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:39,064 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-18 04:57:39,065 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:39,065 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-18 04:57:39,066 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,066 INFO L280 TraceCheckUtils]: 9: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,067 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:39,068 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-18 04:57:39,069 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-18 04:57:39,069 INFO L280 TraceCheckUtils]: 13: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,070 INFO L280 TraceCheckUtils]: 14: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,071 INFO L280 TraceCheckUtils]: 15: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,071 INFO L280 TraceCheckUtils]: 16: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,072 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:39,073 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-18 04:57:39,074 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-18 04:57:39,074 INFO L280 TraceCheckUtils]: 20: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,075 INFO L280 TraceCheckUtils]: 21: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,076 INFO L280 TraceCheckUtils]: 22: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:39,076 INFO L280 TraceCheckUtils]: 23: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:39,077 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-18 04:57:39,078 INFO L263 TraceCheckUtils]: 0: Hoare triple {1058#true} call ULTIMATE.init(); {1058#true} is VALID [2020-07-18 04:57:39,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} assume true; {1058#true} is VALID [2020-07-18 04:57:39,079 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1058#true} {1058#true} #39#return; {1058#true} is VALID [2020-07-18 04:57:39,079 INFO L263 TraceCheckUtils]: 3: Hoare triple {1058#true} call #t~ret3 := main(); {1058#true} is VALID [2020-07-18 04:57:39,079 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1058#true} is VALID [2020-07-18 04:57:39,080 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} ~input~0 := #t~nondet1; {1058#true} is VALID [2020-07-18 04:57:39,080 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} havoc #t~nondet1; {1058#true} is VALID [2020-07-18 04:57:39,080 INFO L263 TraceCheckUtils]: 7: Hoare triple {1058#true} call #t~ret2 := id(~input~0); {1058#true} is VALID [2020-07-18 04:57:39,080 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:39,080 INFO L280 TraceCheckUtils]: 9: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:39,081 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-18 04:57:39,081 INFO L280 TraceCheckUtils]: 11: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:39,081 INFO L280 TraceCheckUtils]: 12: Hoare triple {1058#true} assume !(0 == ~x); {1058#true} is VALID [2020-07-18 04:57:39,081 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-18 04:57:39,081 INFO L280 TraceCheckUtils]: 14: Hoare triple {1058#true} ~x := #in~x; {1058#true} is VALID [2020-07-18 04:57:39,082 INFO L280 TraceCheckUtils]: 15: Hoare triple {1058#true} assume 0 == ~x; {1058#true} is VALID [2020-07-18 04:57:39,082 INFO L280 TraceCheckUtils]: 16: Hoare triple {1058#true} #res := 0; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,083 INFO L280 TraceCheckUtils]: 17: Hoare triple {1115#(= 0 |id_#res|)} assume true; {1115#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,084 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1115#(= 0 |id_#res|)} {1058#true} #45#return; {1112#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:39,085 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-18 04:57:39,085 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-18 04:57:39,086 INFO L280 TraceCheckUtils]: 21: Hoare triple {1113#(<= id_~ret~0 1)} havoc #t~ret0; {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,086 INFO L280 TraceCheckUtils]: 22: Hoare triple {1113#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1113#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,087 INFO L280 TraceCheckUtils]: 23: Hoare triple {1113#(<= id_~ret~0 1)} #res := ~ret~0; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,088 INFO L280 TraceCheckUtils]: 24: Hoare triple {1114#(<= |id_#res| 1)} assume true; {1114#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,089 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1114#(<= |id_#res| 1)} {1058#true} #45#return; {1104#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:39,089 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-18 04:57:39,090 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-18 04:57:39,091 INFO L280 TraceCheckUtils]: 28: Hoare triple {1105#(<= id_~ret~0 2)} havoc #t~ret0; {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,091 INFO L280 TraceCheckUtils]: 29: Hoare triple {1105#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1105#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,092 INFO L280 TraceCheckUtils]: 30: Hoare triple {1105#(<= id_~ret~0 2)} #res := ~ret~0; {1106#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:39,093 INFO L280 TraceCheckUtils]: 31: Hoare triple {1106#(<= |id_#res| 2)} assume true; {1106#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:39,094 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {1106#(<= |id_#res| 2)} {1058#true} #43#return; {1087#(<= |main_#t~ret2| 2)} is VALID [2020-07-18 04:57:39,094 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-18 04:57:39,095 INFO L280 TraceCheckUtils]: 34: Hoare triple {1087#(<= |main_#t~ret2| 2)} ~result~0 := #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-18 04:57:39,095 INFO L280 TraceCheckUtils]: 35: Hoare triple {1088#(<= main_~result~0 2)} havoc #t~ret2; {1088#(<= main_~result~0 2)} is VALID [2020-07-18 04:57:39,096 INFO L280 TraceCheckUtils]: 36: Hoare triple {1088#(<= main_~result~0 2)} assume 5 == ~result~0; {1059#false} is VALID [2020-07-18 04:57:39,096 INFO L280 TraceCheckUtils]: 37: Hoare triple {1059#false} assume !false; {1059#false} is VALID [2020-07-18 04:57:39,098 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-18 04:57:39,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [965358798] [2020-07-18 04:57:39,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:39,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 04:57:39,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252031706] [2020-07-18 04:57:39,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-18 04:57:39,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:39,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 04:57:39,136 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-18 04:57:39,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 04:57:39,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 04:57:39,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-18 04:57:39,138 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 11 states. [2020-07-18 04:57:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:39,428 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2020-07-18 04:57:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-18 04:57:39,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-07-18 04:57:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 04:57:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-18 04:57:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 04:57:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 65 transitions. [2020-07-18 04:57:39,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 65 transitions. [2020-07-18 04:57:39,510 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-18 04:57:39,512 INFO L225 Difference]: With dead ends: 64 [2020-07-18 04:57:39,512 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 04:57:39,513 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-18 04:57:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 04:57:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-18 04:57:39,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:39,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-18 04:57:39,548 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-18 04:57:39,548 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-18 04:57:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:39,551 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-18 04:57:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-18 04:57:39,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:39,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:39,552 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-18 04:57:39,552 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-18 04:57:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:39,555 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-18 04:57:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-18 04:57:39,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:39,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:39,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:39,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 04:57:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-18 04:57:39,559 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 38 [2020-07-18 04:57:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:39,560 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-18 04:57:39,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 04:57:39,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-18 04:57:39,603 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-18 04:57:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-18 04:57:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 04:57:39,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:57:39,605 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-18 04:57:39,605 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 04:57:39,605 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:57:39,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:57:39,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1045014785, now seen corresponding path program 3 times [2020-07-18 04:57:39,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:57:39,606 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1563141425] [2020-07-18 04:57:39,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:57:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:39,660 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-18 04:57:39,660 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-18 04:57:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:57:39,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:39,921 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,922 INFO L280 TraceCheckUtils]: 3: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,923 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:39,923 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:39,924 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-18 04:57:39,924 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,924 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:39,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,925 INFO L280 TraceCheckUtils]: 6: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,926 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:39,927 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-18 04:57:39,928 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-18 04:57:39,928 INFO L280 TraceCheckUtils]: 10: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,929 INFO L280 TraceCheckUtils]: 11: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,930 INFO L280 TraceCheckUtils]: 12: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,937 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:39,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:39,939 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-18 04:57:39,939 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,939 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:39,939 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-18 04:57:39,940 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:39,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,941 INFO L280 TraceCheckUtils]: 9: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,942 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:39,943 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-18 04:57:39,944 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-18 04:57:39,944 INFO L280 TraceCheckUtils]: 13: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,945 INFO L280 TraceCheckUtils]: 14: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,946 INFO L280 TraceCheckUtils]: 15: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,948 INFO L280 TraceCheckUtils]: 16: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,954 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:39,955 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-18 04:57:39,956 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-18 04:57:39,956 INFO L280 TraceCheckUtils]: 20: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,957 INFO L280 TraceCheckUtils]: 21: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,957 INFO L280 TraceCheckUtils]: 22: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:39,958 INFO L280 TraceCheckUtils]: 23: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:39,959 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:39,960 INFO L280 TraceCheckUtils]: 0: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,960 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:39,961 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-18 04:57:39,961 INFO L280 TraceCheckUtils]: 3: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,961 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:39,961 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-18 04:57:39,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,962 INFO L280 TraceCheckUtils]: 7: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:39,962 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-18 04:57:39,962 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:39,963 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,964 INFO L280 TraceCheckUtils]: 12: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,965 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:39,965 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-18 04:57:39,966 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-18 04:57:39,967 INFO L280 TraceCheckUtils]: 16: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,967 INFO L280 TraceCheckUtils]: 17: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,968 INFO L280 TraceCheckUtils]: 18: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,968 INFO L280 TraceCheckUtils]: 19: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,969 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:39,970 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-18 04:57:39,971 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-18 04:57:39,971 INFO L280 TraceCheckUtils]: 23: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,972 INFO L280 TraceCheckUtils]: 24: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,973 INFO L280 TraceCheckUtils]: 25: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:39,973 INFO L280 TraceCheckUtils]: 26: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:39,974 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:39,975 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-18 04:57:39,976 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-18 04:57:39,976 INFO L280 TraceCheckUtils]: 30: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:39,977 INFO L280 TraceCheckUtils]: 31: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 3); {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:39,977 INFO L280 TraceCheckUtils]: 32: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:39,978 INFO L280 TraceCheckUtils]: 33: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:39,979 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 04:57:39,980 INFO L263 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2020-07-18 04:57:39,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#true} assume true; {1428#true} is VALID [2020-07-18 04:57:39,981 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1428#true} {1428#true} #39#return; {1428#true} is VALID [2020-07-18 04:57:39,981 INFO L263 TraceCheckUtils]: 3: Hoare triple {1428#true} call #t~ret3 := main(); {1428#true} is VALID [2020-07-18 04:57:39,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {1428#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1428#true} is VALID [2020-07-18 04:57:39,981 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#true} ~input~0 := #t~nondet1; {1428#true} is VALID [2020-07-18 04:57:39,982 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#true} havoc #t~nondet1; {1428#true} is VALID [2020-07-18 04:57:39,982 INFO L263 TraceCheckUtils]: 7: Hoare triple {1428#true} call #t~ret2 := id(~input~0); {1428#true} is VALID [2020-07-18 04:57:39,982 INFO L280 TraceCheckUtils]: 8: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,982 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:39,982 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-18 04:57:39,983 INFO L280 TraceCheckUtils]: 11: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,983 INFO L280 TraceCheckUtils]: 12: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:39,987 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-18 04:57:39,987 INFO L280 TraceCheckUtils]: 14: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,987 INFO L280 TraceCheckUtils]: 15: Hoare triple {1428#true} assume !(0 == ~x); {1428#true} is VALID [2020-07-18 04:57:39,987 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-18 04:57:39,988 INFO L280 TraceCheckUtils]: 17: Hoare triple {1428#true} ~x := #in~x; {1428#true} is VALID [2020-07-18 04:57:39,988 INFO L280 TraceCheckUtils]: 18: Hoare triple {1428#true} assume 0 == ~x; {1428#true} is VALID [2020-07-18 04:57:39,989 INFO L280 TraceCheckUtils]: 19: Hoare triple {1428#true} #res := 0; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,989 INFO L280 TraceCheckUtils]: 20: Hoare triple {1523#(= 0 |id_#res|)} assume true; {1523#(= 0 |id_#res|)} is VALID [2020-07-18 04:57:39,990 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1523#(= 0 |id_#res|)} {1428#true} #45#return; {1520#(= 0 |id_#t~ret0|)} is VALID [2020-07-18 04:57:39,991 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-18 04:57:39,992 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-18 04:57:39,992 INFO L280 TraceCheckUtils]: 24: Hoare triple {1521#(<= id_~ret~0 1)} havoc #t~ret0; {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,993 INFO L280 TraceCheckUtils]: 25: Hoare triple {1521#(<= id_~ret~0 1)} assume !(~ret~0 > 3); {1521#(<= id_~ret~0 1)} is VALID [2020-07-18 04:57:39,993 INFO L280 TraceCheckUtils]: 26: Hoare triple {1521#(<= id_~ret~0 1)} #res := ~ret~0; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,994 INFO L280 TraceCheckUtils]: 27: Hoare triple {1522#(<= |id_#res| 1)} assume true; {1522#(<= |id_#res| 1)} is VALID [2020-07-18 04:57:39,995 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1522#(<= |id_#res| 1)} {1428#true} #45#return; {1512#(<= |id_#t~ret0| 1)} is VALID [2020-07-18 04:57:39,996 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-18 04:57:39,996 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-18 04:57:39,997 INFO L280 TraceCheckUtils]: 31: Hoare triple {1513#(<= id_~ret~0 2)} havoc #t~ret0; {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,997 INFO L280 TraceCheckUtils]: 32: Hoare triple {1513#(<= id_~ret~0 2)} assume !(~ret~0 > 3); {1513#(<= id_~ret~0 2)} is VALID [2020-07-18 04:57:39,998 INFO L280 TraceCheckUtils]: 33: Hoare triple {1513#(<= id_~ret~0 2)} #res := ~ret~0; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:39,999 INFO L280 TraceCheckUtils]: 34: Hoare triple {1514#(<= |id_#res| 2)} assume true; {1514#(<= |id_#res| 2)} is VALID [2020-07-18 04:57:40,000 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1514#(<= |id_#res| 2)} {1428#true} #45#return; {1494#(<= |id_#t~ret0| 2)} is VALID [2020-07-18 04:57:40,000 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-18 04:57:40,001 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-18 04:57:40,001 INFO L280 TraceCheckUtils]: 38: Hoare triple {1495#(<= id_~ret~0 3)} havoc #t~ret0; {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:40,002 INFO L280 TraceCheckUtils]: 39: Hoare triple {1495#(<= id_~ret~0 3)} assume !(~ret~0 > 3); {1495#(<= id_~ret~0 3)} is VALID [2020-07-18 04:57:40,003 INFO L280 TraceCheckUtils]: 40: Hoare triple {1495#(<= id_~ret~0 3)} #res := ~ret~0; {1496#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:40,003 INFO L280 TraceCheckUtils]: 41: Hoare triple {1496#(<= |id_#res| 3)} assume true; {1496#(<= |id_#res| 3)} is VALID [2020-07-18 04:57:40,004 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1496#(<= |id_#res| 3)} {1428#true} #43#return; {1467#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 04:57:40,005 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-18 04:57:40,005 INFO L280 TraceCheckUtils]: 44: Hoare triple {1467#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-18 04:57:40,006 INFO L280 TraceCheckUtils]: 45: Hoare triple {1468#(<= main_~result~0 3)} havoc #t~ret2; {1468#(<= main_~result~0 3)} is VALID [2020-07-18 04:57:40,006 INFO L280 TraceCheckUtils]: 46: Hoare triple {1468#(<= main_~result~0 3)} assume 5 == ~result~0; {1429#false} is VALID [2020-07-18 04:57:40,007 INFO L280 TraceCheckUtils]: 47: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2020-07-18 04:57:40,009 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-18 04:57:40,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1563141425] [2020-07-18 04:57:40,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:57:40,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-18 04:57:40,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911682084] [2020-07-18 04:57:40,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-18 04:57:40,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:57:40,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 04:57:40,059 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-18 04:57:40,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 04:57:40,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:57:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 04:57:40,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2020-07-18 04:57:40,060 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 14 states. [2020-07-18 04:57:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:40,472 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2020-07-18 04:57:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-18 04:57:40,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-07-18 04:57:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:57:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 04:57:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2020-07-18 04:57:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 04:57:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 65 transitions. [2020-07-18 04:57:40,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 65 transitions. [2020-07-18 04:57:40,547 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-18 04:57:40,548 INFO L225 Difference]: With dead ends: 62 [2020-07-18 04:57:40,548 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 04:57:40,549 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2020-07-18 04:57:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 04:57:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 04:57:40,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:57:40,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:40,550 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:40,550 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:40,551 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:57:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:57:40,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:40,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:40,551 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:40,552 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:57:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:57:40,552 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:57:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:57:40,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:40,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:57:40,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:57:40,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:57:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 04:57:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 04:57:40,553 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-07-18 04:57:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:57:40,554 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 04:57:40,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 04:57:40,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 04:57:40,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:57:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:57:40,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:57:40,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 04:57:40,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 04:57:40,833 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:57:40,833 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:57:40,833 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:57:40,833 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 04:57:40,834 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 04:57:40,834 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:57:40,834 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) the Hoare annotation is: false [2020-07-18 04:57:40,834 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-18 04:57:40,834 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: true [2020-07-18 04:57:40,834 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-07-18 04:57:40,834 INFO L264 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (<= main_~result~0 3) [2020-07-18 04:57:40,835 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-18 04:57:40,835 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-18 04:57:40,835 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (<= |main_#t~ret2| 3) [2020-07-18 04:57:40,835 INFO L271 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: true [2020-07-18 04:57:40,835 INFO L271 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-07-18 04:57:40,835 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (<= |main_#t~ret2| 3) [2020-07-18 04:57:40,835 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-18 04:57:40,836 INFO L264 CegarLoopResult]: At program point idFINAL(lines 4 9) the Hoare annotation is: (<= |id_#res| 3) [2020-07-18 04:57:40,836 INFO L264 CegarLoopResult]: At program point idEXIT(lines 4 9) the Hoare annotation is: (<= |id_#res| 3) [2020-07-18 04:57:40,836 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-18 04:57:40,836 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (<= id_~ret~0 3) [2020-07-18 04:57:40,836 INFO L271 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: true [2020-07-18 04:57:40,836 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-18 04:57:40,836 INFO L271 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: true [2020-07-18 04:57:40,837 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-18 04:57:40,837 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-07-18 04:57:40,837 INFO L271 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: true [2020-07-18 04:57:40,837 INFO L271 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: true [2020-07-18 04:57:40,837 INFO L271 CegarLoopResult]: At program point L6-3(line 6) the Hoare annotation is: true [2020-07-18 04:57:40,846 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-18 04:57:40,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:57:40 BoogieIcfgContainer [2020-07-18 04:57:40,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:57:40,862 INFO L168 Benchmark]: Toolchain (without parser) took 5354.29 ms. Allocated memory was 137.9 MB in the beginning and 285.2 MB in the end (delta: 147.3 MB). Free memory was 103.8 MB in the beginning and 248.8 MB in the end (delta: -145.0 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:40,862 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 04:57:40,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.43 ms. Allocated memory is still 137.9 MB. Free memory was 103.4 MB in the beginning and 93.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:40,864 INFO L168 Benchmark]: Boogie Preprocessor took 29.16 ms. Allocated memory is still 137.9 MB. Free memory was 93.7 MB in the beginning and 92.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:40,864 INFO L168 Benchmark]: RCFGBuilder took 428.64 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 92.3 MB in the beginning and 165.5 MB in the end (delta: -73.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-18 04:57:40,865 INFO L168 Benchmark]: TraceAbstraction took 4663.83 ms. Allocated memory was 202.4 MB in the beginning and 285.2 MB in the end (delta: 82.8 MB). Free memory was 164.8 MB in the beginning and 248.8 MB in the end (delta: -84.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 04:57:40,868 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 224.43 ms. Allocated memory is still 137.9 MB. Free memory was 103.4 MB in the beginning and 93.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.16 ms. Allocated memory is still 137.9 MB. Free memory was 93.7 MB in the beginning and 92.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 428.64 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 92.3 MB in the beginning and 165.5 MB in the end (delta: -73.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4663.83 ms. Allocated memory was 202.4 MB in the beginning and 285.2 MB in the end (delta: 82.8 MB). Free memory was 164.8 MB in the beginning and 248.8 MB in the end (delta: -84.0 MB). There was no memory consumed. 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.2s, 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.0s SatisfiabilityAnalysisTime, 1.2s 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...