/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:21:26,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:21:26,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:21:26,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:21:26,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:21:26,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:21:26,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:21:26,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:21:26,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:21:26,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:21:26,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:21:26,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:21:26,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:21:26,125 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:21:26,126 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:21:26,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:21:26,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:21:26,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:21:26,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:21:26,140 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:21:26,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:21:26,149 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:21:26,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:21:26,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:21:26,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:21:26,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:21:26,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:21:26,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:21:26,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:21:26,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:21:26,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:21:26,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:21:26,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:21:26,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:21:26,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:21:26,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:21:26,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:21:26,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:21:26,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:21:26,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:21:26,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:21:26,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:21:26,193 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:21:26,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:21:26,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:21:26,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:21:26,196 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:21:26,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:21:26,196 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:21:26,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:21:26,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:21:26,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:21:26,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:21:26,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:21:26,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:21:26,199 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:21:26,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:21:26,199 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:21:26,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:21:26,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:21:26,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:21:26,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:21:26,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:21:26,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:21:26,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:21:26,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:21:26,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:21:26,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:21:26,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:21:26,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:21:26,202 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:21:26,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:21:26,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:21:26,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:21:26,511 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:21:26,513 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:21:26,513 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:21:26,514 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-17 22:21:26,594 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6135171d2/95944952bebf44de96d6e374cdcc67d3/FLAG785d9d6d7 [2020-07-17 22:21:27,091 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:21:27,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-17 22:21:27,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6135171d2/95944952bebf44de96d6e374cdcc67d3/FLAG785d9d6d7 [2020-07-17 22:21:27,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6135171d2/95944952bebf44de96d6e374cdcc67d3 [2020-07-17 22:21:27,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:21:27,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:21:27,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:27,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:21:27,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:21:27,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:27" (1/1) ... [2020-07-17 22:21:27,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225b46a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27, skipping insertion in model container [2020-07-17 22:21:27,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:27" (1/1) ... [2020-07-17 22:21:27,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:21:27,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:21:27,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:27,704 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:21:27,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:27,735 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:21:27,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27 WrapperNode [2020-07-17 22:21:27,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:27,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:21:27,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:21:27,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:21:27,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27" (1/1) ... [2020-07-17 22:21:27,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27" (1/1) ... [2020-07-17 22:21:27,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27" (1/1) ... [2020-07-17 22:21:27,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27" (1/1) ... [2020-07-17 22:21:27,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27" (1/1) ... [2020-07-17 22:21:27,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27" (1/1) ... [2020-07-17 22:21:27,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27" (1/1) ... [2020-07-17 22:21:27,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:21:27,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:21:27,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:21:27,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:21:27,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27" (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-17 22:21:27,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:21:27,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:21:27,919 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-17 22:21:27,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:21:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:21:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:21:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-17 22:21:27,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:21:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:21:27,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:21:28,202 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:21:28,203 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:21:28,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:28 BoogieIcfgContainer [2020-07-17 22:21:28,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:21:28,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:21:28,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:21:28,231 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:21:28,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:21:27" (1/3) ... [2020-07-17 22:21:28,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536dbc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:28, skipping insertion in model container [2020-07-17 22:21:28,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:27" (2/3) ... [2020-07-17 22:21:28,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536dbc9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:28, skipping insertion in model container [2020-07-17 22:21:28,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:28" (3/3) ... [2020-07-17 22:21:28,245 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o5-2.c [2020-07-17 22:21:28,273 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:21:28,284 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:21:28,298 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:21:28,322 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:21:28,322 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:21:28,323 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:21:28,323 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:21:28,323 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:21:28,323 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:21:28,323 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:21:28,323 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:21:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-17 22:21:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:21:28,351 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:28,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:28,353 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1250208381, now seen corresponding path program 1 times [2020-07-17 22:21:28,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:28,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529138081] [2020-07-17 22:21:28,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:21:28,566 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-17 22:21:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:28,597 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-17 22:21:28,599 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:28,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:28,602 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-17 22:21:28,603 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-17 22:21:28,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:21:28,604 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-17 22:21:28,604 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-17 22:21:28,604 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2020-07-17 22:21:28,605 INFO L263 TraceCheckUtils]: 5: Hoare triple {24#true} call #t~ret2 := id(~input~0); {24#true} is VALID [2020-07-17 22:21:28,605 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-17 22:21:28,607 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:28,608 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:28,609 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-17 22:21:28,611 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {33#(<= main_~result~0 0)} is VALID [2020-07-17 22:21:28,612 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#(<= main_~result~0 0)} assume 5 == ~result~0; {25#false} is VALID [2020-07-17 22:21:28,613 INFO L280 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-17 22:21:28,615 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-17 22:21:28,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529138081] [2020-07-17 22:21:28,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:28,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:21:28,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209917164] [2020-07-17 22:21:28,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:28,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:28,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:21:28,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:28,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:21:28,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:28,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:21:28,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:28,676 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-17 22:21:28,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:28,838 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-17 22:21:28,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:28,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-17 22:21:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-17 22:21:28,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-17 22:21:28,921 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-17 22:21:28,932 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:21:28,933 INFO L226 Difference]: Without dead ends: 19 [2020-07-17 22:21:28,937 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-17 22:21:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-17 22:21:28,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:28,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:28,982 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:28,982 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:28,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:28,988 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-17 22:21:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:21:28,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:28,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:28,989 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:28,990 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:28,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:28,994 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-17 22:21:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:21:28,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:28,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:28,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:28,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:21:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-17 22:21:29,000 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2020-07-17 22:21:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:29,001 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-17 22:21:29,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:21:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:21:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:21:29,003 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:29,003 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:29,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:21:29,004 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:29,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:29,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1951994857, now seen corresponding path program 1 times [2020-07-17 22:21:29,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:29,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241840423] [2020-07-17 22:21:29,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-17 22:21:29,096 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-17 22:21:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,282 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:29,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,286 INFO L280 TraceCheckUtils]: 2: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,288 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:29,289 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:29,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-17 22:21:29,290 INFO L263 TraceCheckUtils]: 2: Hoare triple {141#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {141#true} is VALID [2020-07-17 22:21:29,291 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:29,292 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,293 INFO L280 TraceCheckUtils]: 5: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,296 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:29,297 INFO L280 TraceCheckUtils]: 7: Hoare triple {162#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {163#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:29,299 INFO L280 TraceCheckUtils]: 8: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {142#false} is VALID [2020-07-17 22:21:29,299 INFO L280 TraceCheckUtils]: 9: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-17 22:21:29,299 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 3)} is VALID [2020-07-17 22:21:29,301 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2020-07-17 22:21:29,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-17 22:21:29,302 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-17 22:21:29,302 INFO L263 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2020-07-17 22:21:29,302 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {141#true} is VALID [2020-07-17 22:21:29,303 INFO L263 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~ret2 := id(~input~0); {141#true} is VALID [2020-07-17 22:21:29,303 INFO L280 TraceCheckUtils]: 6: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:29,303 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-17 22:21:29,304 INFO L263 TraceCheckUtils]: 8: Hoare triple {141#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {141#true} is VALID [2020-07-17 22:21:29,304 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:29,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,307 INFO L280 TraceCheckUtils]: 11: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,309 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:29,311 INFO L280 TraceCheckUtils]: 13: Hoare triple {162#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {163#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:29,312 INFO L280 TraceCheckUtils]: 14: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {142#false} is VALID [2020-07-17 22:21:29,313 INFO L280 TraceCheckUtils]: 15: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-17 22:21:29,313 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 3)} is VALID [2020-07-17 22:21:29,314 INFO L280 TraceCheckUtils]: 17: Hoare triple {156#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {157#(<= main_~result~0 3)} is VALID [2020-07-17 22:21:29,315 INFO L280 TraceCheckUtils]: 18: Hoare triple {157#(<= main_~result~0 3)} assume 5 == ~result~0; {142#false} is VALID [2020-07-17 22:21:29,328 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#false} assume !false; {142#false} is VALID [2020-07-17 22:21:29,332 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-17 22:21:29,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241840423] [2020-07-17 22:21:29,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:29,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:21:29,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324018334] [2020-07-17 22:21:29,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:21:29,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:29,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:21:29,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:29,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:21:29,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:29,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:21:29,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:21:29,369 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2020-07-17 22:21:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,509 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-17 22:21:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:29,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:21:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-17 22:21:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-17 22:21:29,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2020-07-17 22:21:29,570 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-17 22:21:29,572 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:21:29,572 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:21:29,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:21:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:21:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-17 22:21:29,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:29,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2020-07-17 22:21:29,584 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2020-07-17 22:21:29,584 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2020-07-17 22:21:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,588 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-17 22:21:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-17 22:21:29,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:29,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:29,589 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2020-07-17 22:21:29,589 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2020-07-17 22:21:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:29,592 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-17 22:21:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-17 22:21:29,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:29,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:29,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:29,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:21:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-17 22:21:29,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2020-07-17 22:21:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:29,597 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-17 22:21:29,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:21:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-17 22:21:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:21:29,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:29,598 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:29,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:21:29,599 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:29,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1923365706, now seen corresponding path program 1 times [2020-07-17 22:21:29,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:29,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126228833] [2020-07-17 22:21:29,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:21:29,650 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-17 22:21:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:29,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,743 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,745 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:29,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:29,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-17 22:21:29,746 INFO L263 TraceCheckUtils]: 2: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-17 22:21:29,747 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:29,748 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,748 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,750 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:29,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {300#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:29,752 INFO L280 TraceCheckUtils]: 8: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:29,753 INFO L280 TraceCheckUtils]: 9: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:29,754 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-17 22:21:29,754 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-17 22:21:29,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:21:29,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-17 22:21:29,755 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-17 22:21:29,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {279#true} is VALID [2020-07-17 22:21:29,756 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-17 22:21:29,756 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:29,757 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-17 22:21:29,757 INFO L263 TraceCheckUtils]: 8: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-17 22:21:29,757 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:29,758 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,759 INFO L280 TraceCheckUtils]: 11: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:29,761 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:29,762 INFO L280 TraceCheckUtils]: 13: Hoare triple {300#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:29,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:29,763 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:29,764 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-17 22:21:29,765 INFO L280 TraceCheckUtils]: 17: Hoare triple {294#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {295#(<= main_~result~0 1)} is VALID [2020-07-17 22:21:29,766 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 5 == ~result~0; {280#false} is VALID [2020-07-17 22:21:29,766 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:21:29,767 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-17 22:21:29,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126228833] [2020-07-17 22:21:29,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881153411] [2020-07-17 22:21:29,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:21:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:29,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:29,996 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-17 22:21:29,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:21:29,997 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-17 22:21:29,997 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-17 22:21:29,998 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {279#true} is VALID [2020-07-17 22:21:29,998 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-17 22:21:29,998 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:29,999 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-17 22:21:29,999 INFO L263 TraceCheckUtils]: 8: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-17 22:21:29,999 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:30,000 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {337#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:30,001 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#(<= |id_#res| 0)} assume true; {337#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:30,003 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {337#(<= |id_#res| 0)} {279#true} #36#return; {344#(<= |id_#t~ret0| 0)} is VALID [2020-07-17 22:21:30,004 INFO L280 TraceCheckUtils]: 13: Hoare triple {344#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:30,005 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,006 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,007 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-17 22:21:30,008 INFO L280 TraceCheckUtils]: 17: Hoare triple {294#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {295#(<= main_~result~0 1)} is VALID [2020-07-17 22:21:30,009 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 5 == ~result~0; {280#false} is VALID [2020-07-17 22:21:30,009 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:21:30,010 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-17 22:21:30,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:30,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-17 22:21:30,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543295273] [2020-07-17 22:21:30,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-17 22:21:30,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:30,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:21:30,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:30,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:21:30,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:30,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:21:30,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:21:30,046 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2020-07-17 22:21:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:30,237 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:21:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:21:30,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-17 22:21:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-17 22:21:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-17 22:21:30,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-17 22:21:30,291 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-17 22:21:30,293 INFO L225 Difference]: With dead ends: 27 [2020-07-17 22:21:30,294 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:21:30,294 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:21:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:21:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-17 22:21:30,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:30,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:30,303 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:30,303 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:30,306 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:21:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:21:30,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:30,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:30,308 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:30,308 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:30,312 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:21:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:21:30,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:30,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:30,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:30,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:21:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-17 22:21:30,329 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2020-07-17 22:21:30,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:30,338 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-17 22:21:30,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:21:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:21:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:21:30,341 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:30,341 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:30,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:21:30,555 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 376843494, now seen corresponding path program 1 times [2020-07-17 22:21:30,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:30,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793032730] [2020-07-17 22:21:30,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:30,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-17 22:21:30,590 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-17 22:21:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:30,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:30,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:30,731 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:30,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:30,732 INFO L263 TraceCheckUtils]: 2: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:30,732 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:30,744 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:30,745 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:30,746 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:30,747 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,751 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:30,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:30,752 INFO L263 TraceCheckUtils]: 2: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:30,752 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,753 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:30,753 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:30,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,756 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:30,757 INFO L280 TraceCheckUtils]: 8: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:30,758 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:30,759 INFO L280 TraceCheckUtils]: 10: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:30,760 INFO L280 TraceCheckUtils]: 11: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,761 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,762 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:30,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-17 22:21:30,764 INFO L280 TraceCheckUtils]: 15: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-17 22:21:30,764 INFO L280 TraceCheckUtils]: 16: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-17 22:21:30,765 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-17 22:21:30,766 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-17 22:21:30,766 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-17 22:21:30,766 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-17 22:21:30,766 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-17 22:21:30,767 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {477#true} is VALID [2020-07-17 22:21:30,767 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-17 22:21:30,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,767 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:30,768 INFO L263 TraceCheckUtils]: 8: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:30,768 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,768 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:30,768 INFO L263 TraceCheckUtils]: 11: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:30,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,770 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:30,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:30,772 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:30,773 INFO L280 TraceCheckUtils]: 16: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:30,773 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,774 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,775 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:30,776 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-17 22:21:30,781 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-17 22:21:30,781 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-17 22:21:30,781 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-17 22:21:30,782 INFO L280 TraceCheckUtils]: 24: Hoare triple {478#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {478#false} is VALID [2020-07-17 22:21:30,782 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 5 == ~result~0; {478#false} is VALID [2020-07-17 22:21:30,782 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-17 22:21:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:21:30,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793032730] [2020-07-17 22:21:30,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183760415] [2020-07-17 22:21:30,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:21:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:30,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:21:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:30,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:30,922 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-17 22:21:30,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-17 22:21:30,922 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-17 22:21:30,923 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-17 22:21:30,923 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {477#true} is VALID [2020-07-17 22:21:30,923 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-17 22:21:30,924 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,924 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:30,924 INFO L263 TraceCheckUtils]: 8: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:30,925 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,925 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:30,925 INFO L263 TraceCheckUtils]: 11: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-17 22:21:30,926 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:30,927 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {562#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:30,928 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#(<= |id_#res| 0)} assume true; {562#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:30,929 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {562#(<= |id_#res| 0)} {477#true} #36#return; {569#(<= |id_#t~ret0| 0)} is VALID [2020-07-17 22:21:30,930 INFO L280 TraceCheckUtils]: 16: Hoare triple {569#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:30,931 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,932 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:30,933 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:30,935 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-17 22:21:30,936 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-17 22:21:30,936 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-17 22:21:30,936 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-17 22:21:30,937 INFO L280 TraceCheckUtils]: 24: Hoare triple {478#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {478#false} is VALID [2020-07-17 22:21:30,937 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 5 == ~result~0; {478#false} is VALID [2020-07-17 22:21:30,937 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-17 22:21:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:21:30,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:30,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-17 22:21:30,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764708723] [2020-07-17 22:21:30,940 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-17 22:21:30,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:30,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:21:30,978 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-17 22:21:30,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:21:30,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:30,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:21:30,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:21:30,980 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 10 states. [2020-07-17 22:21:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:31,158 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-17 22:21:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:21:31,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-17 22:21:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:21:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:21:31,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-17 22:21:31,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:31,217 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:21:31,217 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:21:31,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:21:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:21:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-17 22:21:31,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:31,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-17 22:21:31,231 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-17 22:21:31,231 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-17 22:21:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:31,234 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-17 22:21:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-17 22:21:31,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:31,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:31,235 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-17 22:21:31,235 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-17 22:21:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:31,239 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-17 22:21:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-17 22:21:31,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:31,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:31,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:31,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:21:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-17 22:21:31,242 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2020-07-17 22:21:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:31,242 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-17 22:21:31,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:21:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:21:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:21:31,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:31,246 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:31,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:31,448 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash 405472645, now seen corresponding path program 2 times [2020-07-17 22:21:31,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:31,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119498434] [2020-07-17 22:21:31,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-17 22:21:31,541 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-17 22:21:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume 0 == ~x;#res := 0; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:31,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:31,711 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {732#true} #36#return; {774#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:31,712 INFO L263 TraceCheckUtils]: 2: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-17 22:21:31,712 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume 0 == ~x;#res := 0; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:31,713 INFO L280 TraceCheckUtils]: 5: Hoare triple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:31,715 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {732#true} #36#return; {774#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,716 INFO L280 TraceCheckUtils]: 7: Hoare triple {774#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {775#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:31,717 INFO L280 TraceCheckUtils]: 8: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:31,717 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:31,719 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:31,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:31,720 INFO L263 TraceCheckUtils]: 2: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-17 22:21:31,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:31,720 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-17 22:21:31,721 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume 0 == ~x;#res := 0; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:31,722 INFO L280 TraceCheckUtils]: 8: Hoare triple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:31,724 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {732#true} #36#return; {774#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,725 INFO L280 TraceCheckUtils]: 10: Hoare triple {774#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {775#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:31,726 INFO L280 TraceCheckUtils]: 11: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:31,726 INFO L280 TraceCheckUtils]: 12: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:31,728 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:31,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {767#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {768#(<= id_~ret~0 2)} is VALID [2020-07-17 22:21:31,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 3);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-17 22:21:31,730 INFO L280 TraceCheckUtils]: 16: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-17 22:21:31,731 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-17 22:21:31,731 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-17 22:21:31,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-17 22:21:31,732 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-17 22:21:31,732 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-17 22:21:31,732 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {732#true} is VALID [2020-07-17 22:21:31,733 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-17 22:21:31,733 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,733 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:31,733 INFO L263 TraceCheckUtils]: 8: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-17 22:21:31,734 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,734 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:31,734 INFO L263 TraceCheckUtils]: 11: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-17 22:21:31,734 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,735 INFO L280 TraceCheckUtils]: 13: Hoare triple {732#true} assume 0 == ~x;#res := 0; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:31,737 INFO L280 TraceCheckUtils]: 14: Hoare triple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-17 22:21:31,740 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {732#true} #36#return; {774#(= 0 |id_#t~ret0|)} is VALID [2020-07-17 22:21:31,742 INFO L280 TraceCheckUtils]: 16: Hoare triple {774#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {775#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:31,744 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:31,746 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:31,748 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:31,750 INFO L280 TraceCheckUtils]: 20: Hoare triple {767#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {768#(<= id_~ret~0 2)} is VALID [2020-07-17 22:21:31,750 INFO L280 TraceCheckUtils]: 21: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 3);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-17 22:21:31,751 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-17 22:21:31,752 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-17 22:21:31,753 INFO L280 TraceCheckUtils]: 24: Hoare triple {754#(<= |main_#t~ret2| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {755#(<= main_~result~0 2)} is VALID [2020-07-17 22:21:31,754 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 5 == ~result~0; {733#false} is VALID [2020-07-17 22:21:31,754 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-17 22:21:31,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:21:31,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119498434] [2020-07-17 22:21:31,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375545685] [2020-07-17 22:21:31,756 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-17 22:21:31,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:21:31,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:31,785 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:21:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:31,901 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-17 22:21:31,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-17 22:21:31,902 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-17 22:21:31,902 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-17 22:21:31,902 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {732#true} is VALID [2020-07-17 22:21:31,902 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-17 22:21:31,903 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,903 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:31,903 INFO L263 TraceCheckUtils]: 8: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-17 22:21:31,903 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:31,904 INFO L263 TraceCheckUtils]: 11: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-17 22:21:31,904 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:31,905 INFO L280 TraceCheckUtils]: 13: Hoare triple {732#true} assume 0 == ~x;#res := 0; {820#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:31,905 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#(<= |id_#res| 0)} assume true; {820#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:31,907 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {820#(<= |id_#res| 0)} {732#true} #36#return; {827#(<= |id_#t~ret0| 0)} is VALID [2020-07-17 22:21:31,907 INFO L280 TraceCheckUtils]: 16: Hoare triple {827#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {775#(<= id_~ret~0 1)} is VALID [2020-07-17 22:21:31,908 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:31,911 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:31,915 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:31,917 INFO L280 TraceCheckUtils]: 20: Hoare triple {767#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {768#(<= id_~ret~0 2)} is VALID [2020-07-17 22:21:31,917 INFO L280 TraceCheckUtils]: 21: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 3);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-17 22:21:31,918 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-17 22:21:31,919 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-17 22:21:31,920 INFO L280 TraceCheckUtils]: 24: Hoare triple {754#(<= |main_#t~ret2| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {755#(<= main_~result~0 2)} is VALID [2020-07-17 22:21:31,921 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 5 == ~result~0; {733#false} is VALID [2020-07-17 22:21:31,921 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-17 22:21:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:21:31,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:31,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2020-07-17 22:21:31,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270477712] [2020-07-17 22:21:31,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-17 22:21:31,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:31,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:21:31,958 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-17 22:21:31,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:21:31,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:31,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:21:31,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:21:31,959 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2020-07-17 22:21:32,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,169 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-17 22:21:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:21:32,169 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-17 22:21:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-17 22:21:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:32,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-17 22:21:32,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2020-07-17 22:21:32,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:32,219 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:21:32,220 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:21:32,221 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:21:32,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:21:32,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-17 22:21:32,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:32,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:32,232 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:32,232 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,234 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:21:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:21:32,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,235 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:32,235 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,237 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:21:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:21:32,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:32,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:21:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-17 22:21:32,240 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 27 [2020-07-17 22:21:32,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:32,240 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-17 22:21:32,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:21:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:21:32,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:21:32,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:32,242 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:32,455 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:32,455 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash -645661089, now seen corresponding path program 2 times [2020-07-17 22:21:32,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:32,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58467135] [2020-07-17 22:21:32,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,524 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-17 22:21:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:32,603 INFO L280 TraceCheckUtils]: 2: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,603 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:32,604 INFO L263 TraceCheckUtils]: 2: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-17 22:21:32,604 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,605 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:32,606 INFO L280 TraceCheckUtils]: 5: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,606 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-17 22:21:32,606 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:32,607 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,607 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:32,614 INFO L263 TraceCheckUtils]: 2: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-17 22:21:32,614 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,614 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:32,615 INFO L263 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-17 22:21:32,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,615 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:32,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,616 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-17 22:21:32,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:32,619 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,619 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-17 22:21:32,619 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:32,619 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,620 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,620 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:32,621 INFO L263 TraceCheckUtils]: 2: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-17 22:21:32,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:32,621 INFO L263 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-17 22:21:32,622 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,622 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:32,622 INFO L263 TraceCheckUtils]: 8: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-17 22:21:32,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:32,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,626 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-17 22:21:32,626 INFO L280 TraceCheckUtils]: 14: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:32,627 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,627 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,629 INFO L280 TraceCheckUtils]: 17: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-17 22:21:32,629 INFO L280 TraceCheckUtils]: 18: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:32,630 INFO L280 TraceCheckUtils]: 19: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,630 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,630 INFO L280 TraceCheckUtils]: 21: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-17 22:21:32,631 INFO L280 TraceCheckUtils]: 22: Hoare triple {990#true} assume ~ret~0 > 3;#res := 3; {1039#(<= |id_#res| 3)} is VALID [2020-07-17 22:21:32,632 INFO L280 TraceCheckUtils]: 23: Hoare triple {1039#(<= |id_#res| 3)} assume true; {1039#(<= |id_#res| 3)} is VALID [2020-07-17 22:21:32,633 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1039#(<= |id_#res| 3)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 3)} is VALID [2020-07-17 22:21:32,634 INFO L263 TraceCheckUtils]: 0: Hoare triple {990#true} call ULTIMATE.init(); {990#true} is VALID [2020-07-17 22:21:32,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,634 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-17 22:21:32,635 INFO L263 TraceCheckUtils]: 3: Hoare triple {990#true} call #t~ret3 := main(); {990#true} is VALID [2020-07-17 22:21:32,635 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {990#true} is VALID [2020-07-17 22:21:32,635 INFO L263 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~ret2 := id(~input~0); {990#true} is VALID [2020-07-17 22:21:32,636 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,636 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:32,636 INFO L263 TraceCheckUtils]: 8: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-17 22:21:32,636 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,637 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:32,637 INFO L263 TraceCheckUtils]: 11: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-17 22:21:32,637 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,638 INFO L280 TraceCheckUtils]: 13: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:32,638 INFO L263 TraceCheckUtils]: 14: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-17 22:21:32,638 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:32,638 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:32,639 INFO L280 TraceCheckUtils]: 17: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,639 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,639 INFO L280 TraceCheckUtils]: 19: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-17 22:21:32,640 INFO L280 TraceCheckUtils]: 20: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:32,640 INFO L280 TraceCheckUtils]: 21: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,650 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,650 INFO L280 TraceCheckUtils]: 23: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-17 22:21:32,650 INFO L280 TraceCheckUtils]: 24: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:32,650 INFO L280 TraceCheckUtils]: 25: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:32,651 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:32,651 INFO L280 TraceCheckUtils]: 27: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-17 22:21:32,655 INFO L280 TraceCheckUtils]: 28: Hoare triple {990#true} assume ~ret~0 > 3;#res := 3; {1039#(<= |id_#res| 3)} is VALID [2020-07-17 22:21:32,655 INFO L280 TraceCheckUtils]: 29: Hoare triple {1039#(<= |id_#res| 3)} assume true; {1039#(<= |id_#res| 3)} is VALID [2020-07-17 22:21:32,656 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1039#(<= |id_#res| 3)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 3)} is VALID [2020-07-17 22:21:32,657 INFO L280 TraceCheckUtils]: 31: Hoare triple {1019#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1020#(<= main_~result~0 3)} is VALID [2020-07-17 22:21:32,658 INFO L280 TraceCheckUtils]: 32: Hoare triple {1020#(<= main_~result~0 3)} assume 5 == ~result~0; {991#false} is VALID [2020-07-17 22:21:32,659 INFO L280 TraceCheckUtils]: 33: Hoare triple {991#false} assume !false; {991#false} is VALID [2020-07-17 22:21:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-17 22:21:32,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58467135] [2020-07-17 22:21:32,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:32,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:21:32,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767839135] [2020-07-17 22:21:32,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-17 22:21:32,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:32,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:21:32,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:32,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:21:32,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:32,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:21:32,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:32,688 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2020-07-17 22:21:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,746 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:21:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:32,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-17 22:21:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-17 22:21:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-17 22:21:32,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-17 22:21:32,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:32,770 INFO L225 Difference]: With dead ends: 27 [2020-07-17 22:21:32,770 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:21:32,771 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:21:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:21:32,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:32,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:32,772 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:32,772 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,772 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:21:32,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:21:32,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,773 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:32,773 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,773 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:21:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:21:32,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:32,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:21:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:21:32,775 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-17 22:21:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:32,775 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:21:32,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:21:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:21:32,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,775 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:21:32,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:21:32,805 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:21:32,805 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:21:32,806 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:21:32,806 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:21:32,806 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:21:32,806 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:21:32,806 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-17 22:21:32,806 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-17 22:21:32,806 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2020-07-17 22:21:32,806 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-17 22:21:32,807 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-17 22:21:32,807 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-17 22:21:32,807 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-17 22:21:32,807 INFO L268 CegarLoopResult]: For program point L14-2(lines 11 17) no Hoare annotation was computed. [2020-07-17 22:21:32,807 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 9) no Hoare annotation was computed. [2020-07-17 22:21:32,807 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-17 22:21:32,807 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-17 22:21:32,807 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-17 22:21:32,808 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-17 22:21:32,808 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:21:32,808 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-17 22:21:32,812 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:21:32,813 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:21:32,813 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:21:32,813 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:21:32,813 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:21:32,813 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:21:32,813 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:21:32,813 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:21:32,813 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:21:32,814 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-17 22:21:32,814 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-17 22:21:32,814 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:21:32,814 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:21:32,814 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:21:32,814 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:21:32,814 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-17 22:21:32,815 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:21:32,815 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:21:32,815 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-17 22:21:32,815 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:21:32,815 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:21:32,815 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:21:32,815 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:21:32,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:21:32 BoogieIcfgContainer [2020-07-17 22:21:32,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:21:32,821 INFO L168 Benchmark]: Toolchain (without parser) took 5364.81 ms. Allocated memory was 138.9 MB in the beginning and 275.8 MB in the end (delta: 136.8 MB). Free memory was 102.7 MB in the beginning and 220.3 MB in the end (delta: -117.6 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:32,822 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 138.9 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:21:32,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.00 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:32,823 INFO L168 Benchmark]: Boogie Preprocessor took 30.19 ms. Allocated memory is still 138.9 MB. Free memory was 92.7 MB in the beginning and 91.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:32,824 INFO L168 Benchmark]: RCFGBuilder took 442.09 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 91.4 MB in the beginning and 167.5 MB in the end (delta: -76.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:32,824 INFO L168 Benchmark]: TraceAbstraction took 4597.49 ms. Allocated memory was 202.9 MB in the beginning and 275.8 MB in the end (delta: 72.9 MB). Free memory was 166.6 MB in the beginning and 220.3 MB in the end (delta: -53.7 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:32,827 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.52 ms. Allocated memory is still 138.9 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.00 ms. Allocated memory is still 138.9 MB. Free memory was 102.3 MB in the beginning and 92.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.19 ms. Allocated memory is still 138.9 MB. Free memory was 92.7 MB in the beginning and 91.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 442.09 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 91.4 MB in the beginning and 167.5 MB in the end (delta: -76.1 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4597.49 ms. Allocated memory was 202.9 MB in the beginning and 275.8 MB in the end (delta: 72.9 MB). Free memory was 166.6 MB in the beginning and 220.3 MB in the end (delta: -53.7 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 16 SDslu, 521 SDs, 0 SdLazy, 113 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 7 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 9016 SizeOfPredicates, 7 NumberOfNonLiveVariables, 187 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 77/105 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...