/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_b5_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:15:50,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:15:50,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:15:50,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:15:50,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:15:50,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:15:50,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:15:50,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:15:50,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:15:50,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:15:50,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:15:50,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:15:50,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:15:50,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:15:50,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:15:50,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:15:50,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:15:50,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:15:50,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:15:50,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:15:50,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:15:50,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:15:50,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:15:50,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:15:50,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:15:50,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:15:50,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:15:50,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:15:50,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:15:50,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:15:50,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:15:50,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:15:50,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:15:50,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:15:50,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:15:50,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:15:50,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:15:50,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:15:50,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:15:50,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:15:50,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:15:50,588 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-08 12:15:50,602 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:15:50,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:15:50,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:15:50,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:15:50,604 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:15:50,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:15:50,604 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:15:50,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:15:50,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:15:50,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:15:50,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:15:50,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:15:50,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:15:50,606 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:15:50,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:15:50,606 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:15:50,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:15:50,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:15:50,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:15:50,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:15:50,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:15:50,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:15:50,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:15:50,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:15:50,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:15:50,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:15:50,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:15:50,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:15:50,609 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:15:50,609 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:15:50,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:15:50,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:15:50,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:15:50,902 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:15:50,903 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:15:50,903 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-08 12:15:50,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b960f3836/156bf4c24a8c4699a579fdc8127b88c5/FLAG76ea3df52 [2020-07-08 12:15:51,409 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:15:51,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-08 12:15:51,416 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b960f3836/156bf4c24a8c4699a579fdc8127b88c5/FLAG76ea3df52 [2020-07-08 12:15:51,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b960f3836/156bf4c24a8c4699a579fdc8127b88c5 [2020-07-08 12:15:51,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:15:51,805 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:15:51,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:15:51,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:15:51,813 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:15:51,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:15:51" (1/1) ... [2020-07-08 12:15:51,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30564470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:51, skipping insertion in model container [2020-07-08 12:15:51,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:15:51" (1/1) ... [2020-07-08 12:15:51,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:15:51,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:15:52,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:15:52,076 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:15:52,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:15:52,109 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:15:52,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52 WrapperNode [2020-07-08 12:15:52,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:15:52,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:15:52,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:15:52,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:15:52,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52" (1/1) ... [2020-07-08 12:15:52,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52" (1/1) ... [2020-07-08 12:15:52,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52" (1/1) ... [2020-07-08 12:15:52,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52" (1/1) ... [2020-07-08 12:15:52,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52" (1/1) ... [2020-07-08 12:15:52,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52" (1/1) ... [2020-07-08 12:15:52,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52" (1/1) ... [2020-07-08 12:15:52,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:15:52,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:15:52,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:15:52,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:15:52,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:15:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:15:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:15:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-08 12:15:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:15:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:15:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:15:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-08 12:15:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:15:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:15:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:15:52,565 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:15:52,565 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:15:52,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:15:52 BoogieIcfgContainer [2020-07-08 12:15:52,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:15:52,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:15:52,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:15:52,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:15:52,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:15:51" (1/3) ... [2020-07-08 12:15:52,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546c0472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:15:52, skipping insertion in model container [2020-07-08 12:15:52,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:15:52" (2/3) ... [2020-07-08 12:15:52,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546c0472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:15:52, skipping insertion in model container [2020-07-08 12:15:52,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:15:52" (3/3) ... [2020-07-08 12:15:52,579 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b5_o10-2.c [2020-07-08 12:15:52,593 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:15:52,601 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:15:52,619 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:15:52,646 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:15:52,646 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:15:52,646 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:15:52,647 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:15:52,647 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:15:52,647 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:15:52,647 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:15:52,647 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:15:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-08 12:15:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:15:52,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:15:52,679 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:15:52,680 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:15:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:15:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1250208381, now seen corresponding path program 1 times [2020-07-08 12:15:52,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:15:52,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726764230] [2020-07-08 12:15:52,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:15:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:52,915 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-08 12:15:52,916 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-08 12:15:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:52,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-08 12:15:52,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:52,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:52,951 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-08 12:15:52,952 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-08 12:15:52,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-08 12:15:52,953 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-08 12:15:52,954 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-08 12:15:52,954 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-08 12:15:52,955 INFO L263 TraceCheckUtils]: 5: Hoare triple {24#true} call #t~ret2 := id(~input~0); {24#true} is VALID [2020-07-08 12:15:52,955 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-08 12:15:52,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:52,958 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:52,960 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-08 12:15:52,962 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-08 12:15:52,963 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#(<= main_~result~0 0)} assume 10 == ~result~0; {25#false} is VALID [2020-07-08 12:15:52,964 INFO L280 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-08 12:15:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:15:52,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726764230] [2020-07-08 12:15:52,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:15:52,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:15:52,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839878056] [2020-07-08 12:15:52,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:15:52,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:15:52,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:15:53,020 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-08 12:15:53,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:15:53,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:15:53,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:15:53,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:15:53,033 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-08 12:15:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:53,230 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-08 12:15:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:15:53,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-08 12:15:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:15:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:15:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-08 12:15:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:15:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-08 12:15:53,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-08 12:15:53,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:15:53,350 INFO L225 Difference]: With dead ends: 33 [2020-07-08 12:15:53,350 INFO L226 Difference]: Without dead ends: 19 [2020-07-08 12:15:53,358 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-08 12:15:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-08 12:15:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-08 12:15:53,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:15:53,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-08 12:15:53,414 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 12:15:53,414 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 12:15:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:53,419 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-08 12:15:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-08 12:15:53,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:53,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:53,420 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-08 12:15:53,421 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-08 12:15:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:53,425 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-08 12:15:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-08 12:15:53,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:53,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:53,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:15:53,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:15:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 12:15:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-08 12:15:53,432 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2020-07-08 12:15:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:15:53,433 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-08 12:15:53,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:15:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-08 12:15:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:15:53,434 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:15:53,434 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-08 12:15:53,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:15:53,435 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:15:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:15:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1951994857, now seen corresponding path program 1 times [2020-07-08 12:15:53,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:15:53,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327137142] [2020-07-08 12:15:53,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:15:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:53,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-08 12:15:53,552 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-08 12:15:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:53,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-08 12:15:53,769 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-08 12:15:53,772 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-08 12:15:53,775 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-08 12:15:53,775 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-08 12:15:53,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-08 12:15:53,776 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-08 12:15:53,777 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-08 12:15:53,779 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-08 12:15:53,780 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-08 12:15:53,785 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-08 12:15:53,787 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-08 12:15:53,788 INFO L280 TraceCheckUtils]: 8: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 5;#res := 5; {142#false} is VALID [2020-07-08 12:15:53,789 INFO L280 TraceCheckUtils]: 9: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-08 12:15:53,789 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 5)} is VALID [2020-07-08 12:15:53,790 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2020-07-08 12:15:53,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-08 12:15:53,791 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-08 12:15:53,792 INFO L263 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2020-07-08 12:15:53,792 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-08 12:15:53,794 INFO L263 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~ret2 := id(~input~0); {141#true} is VALID [2020-07-08 12:15:53,794 INFO L280 TraceCheckUtils]: 6: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-08 12:15:53,795 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-08 12:15:53,795 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-08 12:15:53,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-08 12:15:53,798 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-08 12:15:53,799 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-08 12:15:53,802 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-08 12:15:53,804 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-08 12:15:53,809 INFO L280 TraceCheckUtils]: 14: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 5;#res := 5; {142#false} is VALID [2020-07-08 12:15:53,811 INFO L280 TraceCheckUtils]: 15: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-08 12:15:53,811 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 5)} is VALID [2020-07-08 12:15:53,813 INFO L280 TraceCheckUtils]: 17: Hoare triple {156#(<= |main_#t~ret2| 5)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {157#(<= main_~result~0 5)} is VALID [2020-07-08 12:15:53,814 INFO L280 TraceCheckUtils]: 18: Hoare triple {157#(<= main_~result~0 5)} assume 10 == ~result~0; {142#false} is VALID [2020-07-08 12:15:53,814 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#false} assume !false; {142#false} is VALID [2020-07-08 12:15:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:15:53,821 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327137142] [2020-07-08 12:15:53,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:15:53,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:15:53,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694033812] [2020-07-08 12:15:53,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-08 12:15:53,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:15:53,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:15:53,871 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-08 12:15:53,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:15:53,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:15:53,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:15:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:15:53,873 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2020-07-08 12:15:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:54,039 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-08 12:15:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:15:54,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-08 12:15:54,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:15:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:15:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-08 12:15:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:15:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-08 12:15:54,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2020-07-08 12:15:54,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:15:54,113 INFO L225 Difference]: With dead ends: 31 [2020-07-08 12:15:54,113 INFO L226 Difference]: Without dead ends: 23 [2020-07-08 12:15:54,116 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-08 12:15:54,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-08 12:15:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-08 12:15:54,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:15:54,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2020-07-08 12:15:54,128 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2020-07-08 12:15:54,128 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2020-07-08 12:15:54,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:54,134 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-08 12:15:54,135 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-08 12:15:54,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:54,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:54,137 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2020-07-08 12:15:54,137 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2020-07-08 12:15:54,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:54,141 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-08 12:15:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-08 12:15:54,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:54,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:54,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:15:54,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:15:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:15:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-08 12:15:54,151 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2020-07-08 12:15:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:15:54,152 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-08 12:15:54,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:15:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-08 12:15:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 12:15:54,155 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:15:54,155 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-08 12:15:54,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:15:54,156 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:15:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:15:54,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1923365706, now seen corresponding path program 1 times [2020-07-08 12:15:54,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:15:54,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688555704] [2020-07-08 12:15:54,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:15:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:54,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-08 12:15:54,224 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-08 12:15:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:54,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-08 12:15:54,323 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-08 12:15:54,324 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-08 12:15:54,326 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-08 12:15:54,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-08 12:15:54,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-08 12:15:54,327 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-08 12:15:54,328 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-08 12:15:54,329 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-08 12:15:54,330 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-08 12:15:54,332 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-08 12:15:54,333 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-08 12:15:54,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:54,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:54,337 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-08 12:15:54,337 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-08 12:15:54,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-08 12:15:54,338 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-08 12:15:54,339 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-08 12:15:54,339 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-08 12:15:54,339 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-08 12:15:54,339 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-08 12:15:54,340 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-08 12:15:54,340 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-08 12:15:54,340 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-08 12:15:54,341 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-08 12:15:54,342 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-08 12:15:54,344 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-08 12:15:54,346 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-08 12:15:54,347 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:54,347 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:54,349 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-08 12:15:54,350 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-08 12:15:54,351 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 10 == ~result~0; {280#false} is VALID [2020-07-08 12:15:54,351 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-08 12:15:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:15:54,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688555704] [2020-07-08 12:15:54,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687576875] [2020-07-08 12:15:54,353 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-08 12:15:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:54,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:15:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:54,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:15:54,551 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-08 12:15:54,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-08 12:15:54,552 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-08 12:15:54,552 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-08 12:15:54,553 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-08 12:15:54,553 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-08 12:15:54,553 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-08 12:15:54,553 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-08 12:15:54,554 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-08 12:15:54,554 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-08 12:15:54,555 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {337#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:54,556 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#(<= |id_#res| 0)} assume true; {337#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:54,557 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {337#(<= |id_#res| 0)} {279#true} #36#return; {344#(<= |id_#t~ret0| 0)} is VALID [2020-07-08 12:15:54,559 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-08 12:15:54,560 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:54,561 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:54,562 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-08 12:15:54,564 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-08 12:15:54,565 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 10 == ~result~0; {280#false} is VALID [2020-07-08 12:15:54,565 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-08 12:15:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-08 12:15:54,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:15:54,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-08 12:15:54,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025740615] [2020-07-08 12:15:54,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-08 12:15:54,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:15:54,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:15:54,601 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-08 12:15:54,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:15:54,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:15:54,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:15:54,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:15:54,603 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2020-07-08 12:15:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:54,807 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-08 12:15:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:15:54,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-08 12:15:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:15:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:15:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-08 12:15:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:15:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-08 12:15:54,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-08 12:15:54,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:15:54,873 INFO L225 Difference]: With dead ends: 27 [2020-07-08 12:15:54,874 INFO L226 Difference]: Without dead ends: 23 [2020-07-08 12:15:54,875 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:15:54,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-08 12:15:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-08 12:15:54,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:15:54,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-08 12:15:54,888 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:15:54,888 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:15:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:54,894 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-08 12:15:54,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-08 12:15:54,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:54,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:54,896 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:15:54,897 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:15:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:54,902 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-08 12:15:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-08 12:15:54,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:54,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:54,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:15:54,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:15:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:15:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-08 12:15:54,913 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2020-07-08 12:15:54,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:15:54,914 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-08 12:15:54,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:15:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-08 12:15:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:15:54,917 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:15:54,917 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-08 12:15:55,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:15:55,132 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:15:55,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:15:55,133 INFO L82 PathProgramCache]: Analyzing trace with hash 376843494, now seen corresponding path program 1 times [2020-07-08 12:15:55,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:15:55,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013990865] [2020-07-08 12:15:55,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:15:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:55,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-08 12:15:55,202 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-08 12:15:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:55,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,352 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-08 12:15:55,353 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-08 12:15:55,355 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-08 12:15:55,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-08 12:15:55,356 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-08 12:15:55,357 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,358 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-08 12:15:55,359 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-08 12:15:55,361 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-08 12:15:55,362 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-08 12:15:55,363 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:55,363 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:55,365 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 12:15:55,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,366 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-08 12:15:55,366 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-08 12:15:55,366 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,367 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-08 12:15:55,367 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-08 12:15:55,367 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,368 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-08 12:15:55,369 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-08 12:15:55,371 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-08 12:15:55,372 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-08 12:15:55,372 INFO L280 TraceCheckUtils]: 11: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:55,373 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:55,375 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 12:15:55,376 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-08 12:15:55,377 INFO L280 TraceCheckUtils]: 15: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 5;#res := 5; {478#false} is VALID [2020-07-08 12:15:55,377 INFO L280 TraceCheckUtils]: 16: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-08 12:15:55,377 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-08 12:15:55,378 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-08 12:15:55,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-08 12:15:55,379 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-08 12:15:55,379 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-08 12:15:55,379 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-08 12:15:55,380 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-08 12:15:55,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,380 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-08 12:15:55,380 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-08 12:15:55,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,381 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-08 12:15:55,381 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-08 12:15:55,381 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,382 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-08 12:15:55,383 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-08 12:15:55,385 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-08 12:15:55,386 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-08 12:15:55,387 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:55,387 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:55,389 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 12:15:55,390 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-08 12:15:55,391 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 5;#res := 5; {478#false} is VALID [2020-07-08 12:15:55,391 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-08 12:15:55,391 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-08 12:15:55,392 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-08 12:15:55,392 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 10 == ~result~0; {478#false} is VALID [2020-07-08 12:15:55,392 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-08 12:15:55,393 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-08 12:15:55,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013990865] [2020-07-08 12:15:55,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975095519] [2020-07-08 12:15:55,394 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-08 12:15:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:55,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:15:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:55,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:15:55,535 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-08 12:15:55,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-08 12:15:55,536 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-08 12:15:55,536 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-08 12:15:55,536 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-08 12:15:55,536 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-08 12:15:55,537 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,537 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-08 12:15:55,537 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-08 12:15:55,538 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-08 12:15:55,538 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-08 12:15:55,538 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-08 12:15:55,539 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {562#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:55,540 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#(<= |id_#res| 0)} assume true; {562#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:55,541 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {562#(<= |id_#res| 0)} {477#true} #36#return; {569#(<= |id_#t~ret0| 0)} is VALID [2020-07-08 12:15:55,543 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-08 12:15:55,544 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:55,544 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:55,546 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 12:15:55,547 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-08 12:15:55,548 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 5;#res := 5; {478#false} is VALID [2020-07-08 12:15:55,548 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-08 12:15:55,548 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-08 12:15:55,549 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-08 12:15:55,549 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 10 == ~result~0; {478#false} is VALID [2020-07-08 12:15:55,549 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-08 12:15:55,550 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-08 12:15:55,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:15:55,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-08 12:15:55,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5553085] [2020-07-08 12:15:55,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-08 12:15:55,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:15:55,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-08 12:15:55,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:15:55,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-08 12:15:55,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:15:55,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-08 12:15:55,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:15:55,589 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 10 states. [2020-07-08 12:15:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:55,773 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-08 12:15:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:15:55,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-08 12:15:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:15:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:15:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-08 12:15:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-08 12:15:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-08 12:15:55,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-08 12:15:55,833 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-08 12:15:55,835 INFO L225 Difference]: With dead ends: 35 [2020-07-08 12:15:55,836 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 12:15:55,836 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-08 12:15:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 12:15:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-08 12:15:55,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:15:55,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-08 12:15:55,847 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-08 12:15:55,847 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-08 12:15:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:55,850 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-08 12:15:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-08 12:15:55,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:55,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:55,851 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-08 12:15:55,851 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-08 12:15:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:55,853 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-08 12:15:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-08 12:15:55,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:55,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:55,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:15:55,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:15:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:15:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-08 12:15:55,857 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2020-07-08 12:15:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:15:55,857 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-08 12:15:55,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-08 12:15:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:15:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:15:55,858 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:15:55,858 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-08 12:15:56,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:15:56,074 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:15:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:15:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash 405472645, now seen corresponding path program 2 times [2020-07-08 12:15:56,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:15:56,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326310639] [2020-07-08 12:15:56,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:15:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:56,146 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-08 12:15:56,146 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-08 12:15:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:56,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,335 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-08 12:15:56,335 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-08 12:15:56,337 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-08 12:15:56,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-08 12:15:56,338 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-08 12:15:56,338 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,339 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-08 12:15:56,340 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-08 12:15:56,342 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-08 12:15:56,342 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-08 12:15:56,343 INFO L280 TraceCheckUtils]: 8: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:56,344 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:56,345 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 12:15:56,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-08 12:15:56,346 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-08 12:15:56,346 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,346 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-08 12:15:56,347 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-08 12:15:56,347 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,348 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-08 12:15:56,349 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-08 12:15:56,351 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-08 12:15:56,351 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-08 12:15:56,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:56,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:56,355 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 12:15:56,356 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-08 12:15:56,357 INFO L280 TraceCheckUtils]: 15: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 5);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-08 12:15:56,357 INFO L280 TraceCheckUtils]: 16: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-08 12:15:56,359 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-08 12:15:56,359 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-08 12:15:56,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-08 12:15:56,360 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-08 12:15:56,360 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-08 12:15:56,360 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-08 12:15:56,361 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-08 12:15:56,361 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,361 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-08 12:15:56,361 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-08 12:15:56,361 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,362 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-08 12:15:56,362 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-08 12:15:56,362 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,363 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-08 12:15:56,364 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-08 12:15:56,366 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-08 12:15:56,369 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-08 12:15:56,372 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:56,377 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:56,379 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 12:15:56,380 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-08 12:15:56,381 INFO L280 TraceCheckUtils]: 21: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 5);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-08 12:15:56,382 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-08 12:15:56,383 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-08 12:15:56,384 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-08 12:15:56,384 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 10 == ~result~0; {733#false} is VALID [2020-07-08 12:15:56,385 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-08 12:15:56,386 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-08 12:15:56,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326310639] [2020-07-08 12:15:56,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947137027] [2020-07-08 12:15:56,386 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:15:56,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:15:56,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:15:56,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-08 12:15:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:56,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:15:56,577 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-08 12:15:56,577 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-08 12:15:56,577 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-08 12:15:56,577 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-08 12:15:56,578 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-08 12:15:56,578 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-08 12:15:56,578 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,578 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-08 12:15:56,579 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-08 12:15:56,579 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,579 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-08 12:15:56,579 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-08 12:15:56,579 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-08 12:15:56,580 INFO L280 TraceCheckUtils]: 13: Hoare triple {732#true} assume 0 == ~x;#res := 0; {820#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:56,581 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#(<= |id_#res| 0)} assume true; {820#(<= |id_#res| 0)} is VALID [2020-07-08 12:15:56,582 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {820#(<= |id_#res| 0)} {732#true} #36#return; {827#(<= |id_#t~ret0| 0)} is VALID [2020-07-08 12:15:56,583 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-08 12:15:56,584 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:56,584 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-08 12:15:56,585 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-08 12:15:56,586 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-08 12:15:56,587 INFO L280 TraceCheckUtils]: 21: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 5);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-08 12:15:56,588 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-08 12:15:56,589 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-08 12:15:56,589 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-08 12:15:56,590 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 10 == ~result~0; {733#false} is VALID [2020-07-08 12:15:56,590 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-08 12:15:56,591 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-08 12:15:56,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:15:56,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2020-07-08 12:15:56,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586594589] [2020-07-08 12:15:56,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-08 12:15:56,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:15:56,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 12:15:56,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:15:56,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 12:15:56,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:15:56,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 12:15:56,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:15:56,625 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2020-07-08 12:15:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:56,807 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-08 12:15:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:15:56,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-08 12:15:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:15:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:15:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-08 12:15:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 12:15:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-08 12:15:56,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2020-07-08 12:15:56,860 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-08 12:15:56,862 INFO L225 Difference]: With dead ends: 31 [2020-07-08 12:15:56,862 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 12:15:56,863 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-08 12:15:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 12:15:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-08 12:15:56,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:15:56,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-08 12:15:56,871 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:15:56,871 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:15:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:56,874 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-08 12:15:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-08 12:15:56,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:56,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:56,875 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-08 12:15:56,876 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-08 12:15:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:56,882 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-08 12:15:56,882 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-08 12:15:56,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:56,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:56,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:15:56,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:15:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:15:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-08 12:15:56,887 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 27 [2020-07-08 12:15:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:15:56,888 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-08 12:15:56,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 12:15:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-08 12:15:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 12:15:56,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:15:56,889 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-08 12:15:57,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:15:57,106 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:15:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:15:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -645661089, now seen corresponding path program 2 times [2020-07-08 12:15:57,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:15:57,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716521692] [2020-07-08 12:15:57,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:15:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:57,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,148 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-08 12:15:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:15:57,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-08 12:15:57,193 INFO L280 TraceCheckUtils]: 2: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,194 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,194 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-08 12:15:57,194 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-08 12:15:57,195 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,195 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-08 12:15:57,195 INFO L280 TraceCheckUtils]: 5: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,196 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,196 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-08 12:15:57,196 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-08 12:15:57,196 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,197 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-08 12:15:57,198 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-08 12:15:57,198 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,198 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-08 12:15:57,198 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-08 12:15:57,198 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,199 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-08 12:15:57,199 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,199 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,199 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-08 12:15:57,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-08 12:15:57,200 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,200 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,200 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-08 12:15:57,201 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-08 12:15:57,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,201 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,202 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-08 12:15:57,202 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-08 12:15:57,202 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,203 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-08 12:15:57,203 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-08 12:15:57,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-08 12:15:57,204 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-08 12:15:57,204 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-08 12:15:57,204 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,204 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,205 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-08 12:15:57,205 INFO L280 TraceCheckUtils]: 14: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-08 12:15:57,205 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,205 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,206 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-08 12:15:57,206 INFO L280 TraceCheckUtils]: 18: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-08 12:15:57,206 INFO L280 TraceCheckUtils]: 19: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,206 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,206 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-08 12:15:57,208 INFO L280 TraceCheckUtils]: 22: Hoare triple {990#true} assume ~ret~0 > 5;#res := 5; {1039#(<= |id_#res| 5)} is VALID [2020-07-08 12:15:57,209 INFO L280 TraceCheckUtils]: 23: Hoare triple {1039#(<= |id_#res| 5)} assume true; {1039#(<= |id_#res| 5)} is VALID [2020-07-08 12:15:57,210 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1039#(<= |id_#res| 5)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 5)} is VALID [2020-07-08 12:15:57,211 INFO L263 TraceCheckUtils]: 0: Hoare triple {990#true} call ULTIMATE.init(); {990#true} is VALID [2020-07-08 12:15:57,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,211 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-08 12:15:57,212 INFO L263 TraceCheckUtils]: 3: Hoare triple {990#true} call #t~ret3 := main(); {990#true} is VALID [2020-07-08 12:15:57,212 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-08 12:15:57,212 INFO L263 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~ret2 := id(~input~0); {990#true} is VALID [2020-07-08 12:15:57,212 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,212 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-08 12:15:57,213 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-08 12:15:57,213 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,213 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-08 12:15:57,213 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-08 12:15:57,214 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,214 INFO L280 TraceCheckUtils]: 13: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-08 12:15:57,214 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-08 12:15:57,214 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-08 12:15:57,215 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-08 12:15:57,215 INFO L280 TraceCheckUtils]: 17: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,215 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,216 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-08 12:15:57,216 INFO L280 TraceCheckUtils]: 20: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-08 12:15:57,216 INFO L280 TraceCheckUtils]: 21: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,217 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,217 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-08 12:15:57,217 INFO L280 TraceCheckUtils]: 24: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-08 12:15:57,217 INFO L280 TraceCheckUtils]: 25: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-08 12:15:57,218 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-08 12:15:57,218 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-08 12:15:57,219 INFO L280 TraceCheckUtils]: 28: Hoare triple {990#true} assume ~ret~0 > 5;#res := 5; {1039#(<= |id_#res| 5)} is VALID [2020-07-08 12:15:57,220 INFO L280 TraceCheckUtils]: 29: Hoare triple {1039#(<= |id_#res| 5)} assume true; {1039#(<= |id_#res| 5)} is VALID [2020-07-08 12:15:57,221 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1039#(<= |id_#res| 5)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 5)} is VALID [2020-07-08 12:15:57,222 INFO L280 TraceCheckUtils]: 31: Hoare triple {1019#(<= |main_#t~ret2| 5)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1020#(<= main_~result~0 5)} is VALID [2020-07-08 12:15:57,222 INFO L280 TraceCheckUtils]: 32: Hoare triple {1020#(<= main_~result~0 5)} assume 10 == ~result~0; {991#false} is VALID [2020-07-08 12:15:57,223 INFO L280 TraceCheckUtils]: 33: Hoare triple {991#false} assume !false; {991#false} is VALID [2020-07-08 12:15:57,224 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-08 12:15:57,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716521692] [2020-07-08 12:15:57,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:15:57,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:15:57,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071235565] [2020-07-08 12:15:57,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-08 12:15:57,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:15:57,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:15:57,250 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-08 12:15:57,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:15:57,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:15:57,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:15:57,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:15:57,251 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2020-07-08 12:15:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:57,308 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-08 12:15:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:15:57,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-08 12:15:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:15:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:15:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-08 12:15:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:15:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-08 12:15:57,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-08 12:15:57,333 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-08 12:15:57,333 INFO L225 Difference]: With dead ends: 27 [2020-07-08 12:15:57,333 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:15:57,334 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-08 12:15:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:15:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:15:57,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:15:57,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:15:57,335 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:15:57,335 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:15:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:57,335 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:15:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:15:57,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:57,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:57,336 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:15:57,336 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:15:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:15:57,337 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:15:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:15:57,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:57,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:15:57,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:15:57,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:15:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:15:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:15:57,338 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-08 12:15:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:15:57,338 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:15:57,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:15:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:15:57,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:15:57,339 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:15:57,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:15:57,367 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:15:57,367 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:15:57,367 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:15:57,367 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:15:57,367 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:15:57,368 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:15:57,368 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-08 12:15:57,368 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-08 12:15:57,368 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2020-07-08 12:15:57,368 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-08 12:15:57,368 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-08 12:15:57,368 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-08 12:15:57,369 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-08 12:15:57,369 INFO L268 CegarLoopResult]: For program point L14-2(lines 11 17) no Hoare annotation was computed. [2020-07-08 12:15:57,369 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 9) no Hoare annotation was computed. [2020-07-08 12:15:57,369 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-08 12:15:57,369 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-08 12:15:57,369 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-08 12:15:57,369 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-08 12:15:57,370 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-08 12:15:57,370 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-08 12:15:57,375 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:15:57,375 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:15:57,375 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:15:57,375 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:15:57,375 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:15:57,376 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:15:57,376 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:15:57,376 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:15:57,376 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:15:57,376 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-08 12:15:57,376 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-08 12:15:57,376 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:15:57,376 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:15:57,377 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 12:15:57,377 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-08 12:15:57,377 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-08 12:15:57,377 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 12:15:57,377 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 12:15:57,377 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-08 12:15:57,377 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:15:57,377 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:15:57,377 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:15:57,378 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-08 12:15:57,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:15:57 BoogieIcfgContainer [2020-07-08 12:15:57,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:15:57,383 INFO L168 Benchmark]: Toolchain (without parser) took 5577.87 ms. Allocated memory was 135.8 MB in the beginning and 251.7 MB in the end (delta: 115.9 MB). Free memory was 99.5 MB in the beginning and 94.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 120.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:15:57,384 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:15:57,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.20 ms. Allocated memory is still 135.8 MB. Free memory was 99.3 MB in the beginning and 89.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:15:57,385 INFO L168 Benchmark]: Boogie Preprocessor took 109.80 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 89.4 MB in the beginning and 179.0 MB in the end (delta: -89.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:15:57,386 INFO L168 Benchmark]: RCFGBuilder took 349.35 ms. Allocated memory is still 199.8 MB. Free memory was 178.6 MB in the beginning and 163.2 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:15:57,386 INFO L168 Benchmark]: TraceAbstraction took 4808.45 ms. Allocated memory was 199.8 MB in the beginning and 251.7 MB in the end (delta: 51.9 MB). Free memory was 162.5 MB in the beginning and 94.7 MB in the end (delta: 67.8 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:15:57,389 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.24 ms. Allocated memory is still 135.8 MB. Free memory was 117.6 MB in the beginning and 117.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.20 ms. Allocated memory is still 135.8 MB. Free memory was 99.3 MB in the beginning and 89.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.80 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 89.4 MB in the beginning and 179.0 MB in the end (delta: -89.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 349.35 ms. Allocated memory is still 199.8 MB. Free memory was 178.6 MB in the beginning and 163.2 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4808.45 ms. Allocated memory was 199.8 MB in the beginning and 251.7 MB in the end (delta: 51.9 MB). Free memory was 162.5 MB in the beginning and 94.7 MB in the end (delta: 67.8 MB). Peak memory consumption was 119.7 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.6s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 1.4s, 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...