/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:58:36,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:58:36,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:58:36,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:58:36,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:58:36,521 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:58:36,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:58:36,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:58:36,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:58:36,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:58:36,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:58:36,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:58:36,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:58:36,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:58:36,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:58:36,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:58:36,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:58:36,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:58:36,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:58:36,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:58:36,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:58:36,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:58:36,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:58:36,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:58:36,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:58:36,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:58:36,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:58:36,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:58:36,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:58:36,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:58:36,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:58:36,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:58:36,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:58:36,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:58:36,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:58:36,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:58:36,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:58:36,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:58:36,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:58:36,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:58:36,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:58:36,553 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-10 14:58:36,567 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:58:36,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:58:36,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:58:36,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:58:36,569 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:58:36,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:58:36,569 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:58:36,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:58:36,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:58:36,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:58:36,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:58:36,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:58:36,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:58:36,571 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:58:36,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:58:36,571 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:58:36,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:58:36,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:58:36,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:58:36,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:58:36,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:58:36,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:58:36,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:58:36,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:58:36,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:58:36,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:58:36,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:58:36,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:58:36,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:58:36,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:58:36,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:58:36,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:58:36,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:58:36,883 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:58:36,883 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:58:36,884 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-10 14:58:36,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ec67eb1/53777b28d69940b39162756c52d8489a/FLAG61ea5f67a [2020-07-10 14:58:37,403 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:58:37,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-10 14:58:37,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ec67eb1/53777b28d69940b39162756c52d8489a/FLAG61ea5f67a [2020-07-10 14:58:37,815 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ec67eb1/53777b28d69940b39162756c52d8489a [2020-07-10 14:58:37,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:58:37,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:58:37,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:58:37,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:58:37,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:58:37,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:58:37" (1/1) ... [2020-07-10 14:58:37,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1b5dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:37, skipping insertion in model container [2020-07-10 14:58:37,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:58:37" (1/1) ... [2020-07-10 14:58:37,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:58:37,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:58:38,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:58:38,023 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:58:38,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:58:38,054 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:58:38,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38 WrapperNode [2020-07-10 14:58:38,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:58:38,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:58:38,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:58:38,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:58:38,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38" (1/1) ... [2020-07-10 14:58:38,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38" (1/1) ... [2020-07-10 14:58:38,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38" (1/1) ... [2020-07-10 14:58:38,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38" (1/1) ... [2020-07-10 14:58:38,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38" (1/1) ... [2020-07-10 14:58:38,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38" (1/1) ... [2020-07-10 14:58:38,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38" (1/1) ... [2020-07-10 14:58:38,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:58:38,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:58:38,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:58:38,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:58:38,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38" (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-10 14:58:38,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:58:38,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:58:38,244 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-10 14:58:38,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:58:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:58:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:58:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-10 14:58:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:58:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:58:38,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:58:38,507 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:58:38,507 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:58:38,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:58:38 BoogieIcfgContainer [2020-07-10 14:58:38,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:58:38,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:58:38,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:58:38,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:58:38,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:58:37" (1/3) ... [2020-07-10 14:58:38,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545d0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:58:38, skipping insertion in model container [2020-07-10 14:58:38,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:38" (2/3) ... [2020-07-10 14:58:38,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545d0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:58:38, skipping insertion in model container [2020-07-10 14:58:38,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:58:38" (3/3) ... [2020-07-10 14:58:38,521 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o5-2.c [2020-07-10 14:58:38,532 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:58:38,539 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:58:38,553 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:58:38,582 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:58:38,582 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:58:38,583 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:58:38,583 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:58:38,583 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:58:38,583 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:58:38,583 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:58:38,583 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:58:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 14:58:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 14:58:38,611 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:38,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:38,612 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:38,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:38,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1250208381, now seen corresponding path program 1 times [2020-07-10 14:58:38,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:38,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336900884] [2020-07-10 14:58:38,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:58:38,837 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:58:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:38,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-10 14:58:38,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:38,871 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:38,873 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-10 14:58:38,874 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-10 14:58:38,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:58:38,875 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:58:38,875 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-10 14:58:38,876 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-10 14:58:38,876 INFO L263 TraceCheckUtils]: 5: Hoare triple {24#true} call #t~ret2 := id(~input~0); {24#true} is VALID [2020-07-10 14:58:38,876 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-10 14:58:38,878 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:38,879 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:38,881 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-10 14:58:38,882 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-10 14:58:38,883 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#(<= main_~result~0 0)} assume 5 == ~result~0; {25#false} is VALID [2020-07-10 14:58:38,884 INFO L280 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 14:58:38,885 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-10 14:58:38,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336900884] [2020-07-10 14:58:38,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:38,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:58:38,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860465] [2020-07-10 14:58:38,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:58:38,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:38,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:58:38,935 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-10 14:58:38,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:58:38,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:38,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:58:38,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:58:38,950 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-10 14:58:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:39,115 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 14:58:39,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:58:39,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:58:39,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-10 14:58:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-10 14:58:39,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-10 14:58:39,198 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-10 14:58:39,211 INFO L225 Difference]: With dead ends: 33 [2020-07-10 14:58:39,211 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 14:58:39,215 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-10 14:58:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 14:58:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 14:58:39,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:39,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:39,254 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:39,255 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:39,260 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 14:58:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 14:58:39,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:39,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:39,262 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:39,262 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:39,266 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 14:58:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 14:58:39,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:39,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:39,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:39,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 14:58:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-10 14:58:39,273 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2020-07-10 14:58:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:39,273 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-10 14:58:39,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:58:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 14:58:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 14:58:39,275 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:39,275 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-10 14:58:39,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:58:39,276 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:39,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1951994857, now seen corresponding path program 1 times [2020-07-10 14:58:39,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:39,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746998123] [2020-07-10 14:58:39,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-10 14:58:39,351 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-10 14:58:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:39,502 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-10 14:58:39,504 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-10 14:58:39,506 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-10 14:58:39,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:39,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-10 14:58:39,508 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-10 14:58:39,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:39,510 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-10 14:58:39,512 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-10 14:58:39,516 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-10 14:58:39,518 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-10 14:58:39,519 INFO L280 TraceCheckUtils]: 8: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {142#false} is VALID [2020-07-10 14:58:39,519 INFO L280 TraceCheckUtils]: 9: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-10 14:58:39,520 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 3)} is VALID [2020-07-10 14:58:39,521 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2020-07-10 14:58:39,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-10 14:58:39,522 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-10 14:58:39,522 INFO L263 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2020-07-10 14:58:39,523 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-10 14:58:39,523 INFO L263 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~ret2 := id(~input~0); {141#true} is VALID [2020-07-10 14:58:39,525 INFO L280 TraceCheckUtils]: 6: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:39,525 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-10 14:58:39,526 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-10 14:58:39,526 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:39,528 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-10 14:58:39,529 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-10 14:58:39,532 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-10 14:58:39,533 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-10 14:58:39,537 INFO L280 TraceCheckUtils]: 14: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {142#false} is VALID [2020-07-10 14:58:39,538 INFO L280 TraceCheckUtils]: 15: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-10 14:58:39,538 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 3)} is VALID [2020-07-10 14:58:39,541 INFO L280 TraceCheckUtils]: 17: Hoare triple {156#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {157#(<= main_~result~0 3)} is VALID [2020-07-10 14:58:39,542 INFO L280 TraceCheckUtils]: 18: Hoare triple {157#(<= main_~result~0 3)} assume 5 == ~result~0; {142#false} is VALID [2020-07-10 14:58:39,543 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#false} assume !false; {142#false} is VALID [2020-07-10 14:58:39,544 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-10 14:58:39,545 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746998123] [2020-07-10 14:58:39,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:39,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 14:58:39,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440047381] [2020-07-10 14:58:39,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 14:58:39,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:39,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:58:39,597 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-10 14:58:39,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:58:39,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:39,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:58:39,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:58:39,598 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2020-07-10 14:58:39,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:39,737 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 14:58:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:58:39,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 14:58:39,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:58:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 14:58:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:58:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 14:58:39,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2020-07-10 14:58:39,796 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-10 14:58:39,798 INFO L225 Difference]: With dead ends: 31 [2020-07-10 14:58:39,799 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 14:58:39,800 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-10 14:58:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 14:58:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-10 14:58:39,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:39,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2020-07-10 14:58:39,808 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2020-07-10 14:58:39,808 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2020-07-10 14:58:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:39,811 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 14:58:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 14:58:39,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:39,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:39,813 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2020-07-10 14:58:39,813 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2020-07-10 14:58:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:39,815 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 14:58:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 14:58:39,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:39,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:39,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:39,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 14:58:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-10 14:58:39,819 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2020-07-10 14:58:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:39,819 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-10 14:58:39,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:58:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-10 14:58:39,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 14:58:39,821 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:39,821 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-10 14:58:39,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:58:39,821 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1923365706, now seen corresponding path program 1 times [2020-07-10 14:58:39,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:39,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486136762] [2020-07-10 14:58:39,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 14:58:39,876 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-10 14:58:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:39,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:39,972 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-10 14:58:39,973 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-10 14:58:39,975 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-10 14:58:39,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:39,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-10 14:58:39,976 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-10 14:58:39,976 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:39,977 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-10 14:58:39,978 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-10 14:58:39,980 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-10 14:58:39,981 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-10 14:58:39,982 INFO L280 TraceCheckUtils]: 8: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,983 INFO L280 TraceCheckUtils]: 9: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,984 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-10 14:58:39,985 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 14:58:39,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 14:58:39,985 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-10 14:58:39,986 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-10 14:58:39,986 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-10 14:58:39,986 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-10 14:58:39,986 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:39,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-10 14:58:39,987 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-10 14:58:39,987 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:39,988 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-10 14:58:39,989 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-10 14:58:39,991 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-10 14:58:39,992 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-10 14:58:39,993 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,993 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:39,994 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-10 14:58:39,995 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-10 14:58:39,996 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 5 == ~result~0; {280#false} is VALID [2020-07-10 14:58:39,996 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 14:58:39,997 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-10 14:58:39,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486136762] [2020-07-10 14:58:39,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535196480] [2020-07-10 14:58:39,998 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-10 14:58:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:40,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 14:58:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:40,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:40,171 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 14:58:40,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 14:58:40,172 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-10 14:58:40,172 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-10 14:58:40,173 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-10 14:58:40,173 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-10 14:58:40,173 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:40,174 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-10 14:58:40,174 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-10 14:58:40,174 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:40,175 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {337#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:40,176 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#(<= |id_#res| 0)} assume true; {337#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:40,177 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {337#(<= |id_#res| 0)} {279#true} #36#return; {344#(<= |id_#t~ret0| 0)} is VALID [2020-07-10 14:58:40,178 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-10 14:58:40,179 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,180 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,181 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-10 14:58:40,182 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-10 14:58:40,183 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 5 == ~result~0; {280#false} is VALID [2020-07-10 14:58:40,183 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 14:58:40,184 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-10 14:58:40,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:40,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-10 14:58:40,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233027989] [2020-07-10 14:58:40,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-10 14:58:40,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:40,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:58:40,214 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-10 14:58:40,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:58:40,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:40,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:58:40,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:58:40,215 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2020-07-10 14:58:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:40,392 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 14:58:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:58:40,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-10 14:58:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 14:58:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 14:58:40,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-10 14:58:40,448 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-10 14:58:40,450 INFO L225 Difference]: With dead ends: 27 [2020-07-10 14:58:40,450 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 14:58:40,451 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:58:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 14:58:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-10 14:58:40,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:40,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:40,462 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:40,462 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:40,466 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-10 14:58:40,466 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 14:58:40,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:40,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:40,468 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:40,468 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:40,471 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-10 14:58:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 14:58:40,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:40,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:40,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:40,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 14:58:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-10 14:58:40,482 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2020-07-10 14:58:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:40,482 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-10 14:58:40,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:58:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 14:58:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:58:40,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:40,484 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-10 14:58:40,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 14:58:40,698 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:40,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:40,699 INFO L82 PathProgramCache]: Analyzing trace with hash 376843494, now seen corresponding path program 1 times [2020-07-10 14:58:40,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:40,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724772064] [2020-07-10 14:58:40,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:40,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-10 14:58:40,752 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-10 14:58:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:40,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,876 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-10 14:58:40,877 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-10 14:58:40,879 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-10 14:58:40,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:40,880 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-10 14:58:40,880 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,881 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-10 14:58:40,882 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-10 14:58:40,884 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-10 14:58:40,885 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-10 14:58:40,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,886 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,887 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:40,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:40,889 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-10 14:58:40,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:40,889 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-10 14:58:40,890 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,891 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-10 14:58:40,892 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-10 14:58:40,893 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-10 14:58:40,894 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-10 14:58:40,895 INFO L280 TraceCheckUtils]: 11: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,896 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,897 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:40,898 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-10 14:58:40,899 INFO L280 TraceCheckUtils]: 15: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-10 14:58:40,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-10 14:58:40,900 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-10 14:58:40,901 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-10 14:58:40,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-10 14:58:40,901 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-10 14:58:40,901 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-10 14:58:40,902 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-10 14:58:40,902 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-10 14:58:40,902 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,902 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:40,903 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-10 14:58:40,903 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,903 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:40,903 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-10 14:58:40,904 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:40,905 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-10 14:58:40,906 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-10 14:58:40,907 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-10 14:58:40,908 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-10 14:58:40,909 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,910 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:40,911 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:40,912 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-10 14:58:40,913 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-10 14:58:40,913 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-10 14:58:40,913 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-10 14:58:40,914 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-10 14:58:40,914 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 5 == ~result~0; {478#false} is VALID [2020-07-10 14:58:40,914 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-10 14:58:40,915 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-10 14:58:40,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724772064] [2020-07-10 14:58:40,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831550995] [2020-07-10 14:58:40,916 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-10 14:58:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:40,943 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-10 14:58:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:40,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:41,038 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-10 14:58:41,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-10 14:58:41,039 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-10 14:58:41,039 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-10 14:58:41,039 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-10 14:58:41,040 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-10 14:58:41,040 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:41,040 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:41,040 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-10 14:58:41,041 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:41,041 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:41,041 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-10 14:58:41,042 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:41,042 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {562#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:41,043 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#(<= |id_#res| 0)} assume true; {562#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:41,045 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {562#(<= |id_#res| 0)} {477#true} #36#return; {569#(<= |id_#t~ret0| 0)} is VALID [2020-07-10 14:58:41,046 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-10 14:58:41,047 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:41,048 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:41,049 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:41,050 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-10 14:58:41,051 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 3;#res := 3; {478#false} is VALID [2020-07-10 14:58:41,051 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-10 14:58:41,051 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-10 14:58:41,052 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-10 14:58:41,052 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 5 == ~result~0; {478#false} is VALID [2020-07-10 14:58:41,052 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-10 14:58:41,053 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-10 14:58:41,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:41,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-10 14:58:41,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683095261] [2020-07-10 14:58:41,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-10 14:58:41,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:41,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:58:41,089 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-10 14:58:41,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:58:41,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:41,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:58:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:58:41,090 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 10 states. [2020-07-10 14:58:41,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:41,271 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 14:58:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:58:41,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-10 14:58:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 14:58:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 14:58:41,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-10 14:58:41,327 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-10 14:58:41,329 INFO L225 Difference]: With dead ends: 35 [2020-07-10 14:58:41,329 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 14:58:41,330 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-10 14:58:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 14:58:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-10 14:58:41,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:41,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-10 14:58:41,338 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-10 14:58:41,338 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-10 14:58:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:41,341 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-10 14:58:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 14:58:41,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:41,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:41,342 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-10 14:58:41,342 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-10 14:58:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:41,344 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-10 14:58:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 14:58:41,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:41,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:41,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:41,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 14:58:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-10 14:58:41,348 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2020-07-10 14:58:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:41,348 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-10 14:58:41,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:58:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 14:58:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:58:41,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:41,349 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-10 14:58:41,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:41,564 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash 405472645, now seen corresponding path program 2 times [2020-07-10 14:58:41,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:41,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570910778] [2020-07-10 14:58:41,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:41,609 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-10 14:58:41,610 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-10 14:58:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:41,742 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,743 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-10 14:58:41,743 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-10 14:58:41,745 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-10 14:58:41,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:41,746 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-10 14:58:41,746 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,747 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-10 14:58:41,748 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-10 14:58:41,750 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-10 14:58:41,750 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-10 14:58:41,760 INFO L280 TraceCheckUtils]: 8: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:41,763 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:41,770 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:41,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,771 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:41,772 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-10 14:58:41,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,772 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:41,772 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-10 14:58:41,773 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,775 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-10 14:58:41,776 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-10 14:58:41,777 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-10 14:58:41,778 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-10 14:58:41,779 INFO L280 TraceCheckUtils]: 11: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:41,780 INFO L280 TraceCheckUtils]: 12: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:41,782 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:41,783 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-10 14:58:41,783 INFO L280 TraceCheckUtils]: 15: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 3);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:41,784 INFO L280 TraceCheckUtils]: 16: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:41,786 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-10 14:58:41,786 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-10 14:58:41,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-10 14:58:41,787 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-10 14:58:41,787 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-10 14:58:41,787 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-10 14:58:41,788 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-10 14:58:41,788 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,788 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:41,788 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-10 14:58:41,788 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,789 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:41,789 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-10 14:58:41,789 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,791 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-10 14:58:41,792 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-10 14:58:41,795 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-10 14:58:41,798 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-10 14:58:41,801 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:41,805 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:41,808 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:41,809 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-10 14:58:41,810 INFO L280 TraceCheckUtils]: 21: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 3);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:41,811 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:41,812 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-10 14:58:41,812 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-10 14:58:41,817 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 5 == ~result~0; {733#false} is VALID [2020-07-10 14:58:41,818 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-10 14:58:41,819 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-10 14:58:41,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570910778] [2020-07-10 14:58:41,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629360101] [2020-07-10 14:58:41,820 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-10 14:58:41,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:58:41,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:41,866 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 14:58:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:41,877 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:41,997 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-10 14:58:41,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-10 14:58:41,998 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-10 14:58:41,998 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-10 14:58:41,998 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-10 14:58:41,998 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-10 14:58:41,999 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:41,999 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:41,999 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-10 14:58:41,999 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:42,000 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:42,000 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-10 14:58:42,000 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:42,001 INFO L280 TraceCheckUtils]: 13: Hoare triple {732#true} assume 0 == ~x;#res := 0; {820#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:42,001 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#(<= |id_#res| 0)} assume true; {820#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:42,003 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {820#(<= |id_#res| 0)} {732#true} #36#return; {827#(<= |id_#t~ret0| 0)} is VALID [2020-07-10 14:58:42,003 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-10 14:58:42,004 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:42,005 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:42,006 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:42,007 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-10 14:58:42,008 INFO L280 TraceCheckUtils]: 21: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 3);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:42,008 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:42,009 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-10 14:58:42,010 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-10 14:58:42,010 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 5 == ~result~0; {733#false} is VALID [2020-07-10 14:58:42,011 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-10 14:58:42,011 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-10 14:58:42,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:42,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2020-07-10 14:58:42,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956733624] [2020-07-10 14:58:42,013 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-10 14:58:42,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:42,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 14:58:42,045 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-10 14:58:42,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 14:58:42,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:42,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 14:58:42,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-10 14:58:42,046 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2020-07-10 14:58:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:42,234 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 14:58:42,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 14:58:42,235 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-10 14:58:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:58:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-10 14:58:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:58:42,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-10 14:58:42,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2020-07-10 14:58:42,296 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-10 14:58:42,297 INFO L225 Difference]: With dead ends: 31 [2020-07-10 14:58:42,297 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 14:58:42,299 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-10 14:58:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 14:58:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-10 14:58:42,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:42,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:42,307 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:42,307 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:42,310 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 14:58:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 14:58:42,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:42,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:42,312 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:42,313 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:42,315 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 14:58:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 14:58:42,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:42,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:42,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:42,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 14:58:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-10 14:58:42,319 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 27 [2020-07-10 14:58:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:42,319 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-10 14:58:42,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 14:58:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 14:58:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 14:58:42,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:42,321 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-10 14:58:42,523 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:42,524 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:42,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash -645661089, now seen corresponding path program 2 times [2020-07-10 14:58:42,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:42,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399671541] [2020-07-10 14:58:42,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:42,573 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,573 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-10 14:58:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:42,662 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:42,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:42,664 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-10 14:58:42,664 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,664 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:42,665 INFO L280 TraceCheckUtils]: 5: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,666 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,666 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-10 14:58:42,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:42,670 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,670 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:42,671 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-10 14:58:42,674 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,675 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:42,675 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-10 14:58:42,675 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,676 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:42,676 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,676 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,676 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-10 14:58:42,676 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:42,677 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,677 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,679 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-10 14:58:42,679 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:42,680 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,680 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:42,681 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-10 14:58:42,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,681 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:42,682 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-10 14:58:42,682 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:42,682 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-10 14:58:42,683 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,683 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:42,683 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,683 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,684 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-10 14:58:42,684 INFO L280 TraceCheckUtils]: 14: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:42,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,684 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,685 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-10 14:58:42,685 INFO L280 TraceCheckUtils]: 18: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:42,685 INFO L280 TraceCheckUtils]: 19: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,685 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,685 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-10 14:58:42,690 INFO L280 TraceCheckUtils]: 22: Hoare triple {990#true} assume ~ret~0 > 3;#res := 3; {1039#(<= |id_#res| 3)} is VALID [2020-07-10 14:58:42,690 INFO L280 TraceCheckUtils]: 23: Hoare triple {1039#(<= |id_#res| 3)} assume true; {1039#(<= |id_#res| 3)} is VALID [2020-07-10 14:58:42,691 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1039#(<= |id_#res| 3)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 3)} is VALID [2020-07-10 14:58:42,692 INFO L263 TraceCheckUtils]: 0: Hoare triple {990#true} call ULTIMATE.init(); {990#true} is VALID [2020-07-10 14:58:42,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,693 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-10 14:58:42,693 INFO L263 TraceCheckUtils]: 3: Hoare triple {990#true} call #t~ret3 := main(); {990#true} is VALID [2020-07-10 14:58:42,693 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-10 14:58:42,693 INFO L263 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~ret2 := id(~input~0); {990#true} is VALID [2020-07-10 14:58:42,693 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,694 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:42,694 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-10 14:58:42,694 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,694 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:42,695 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-10 14:58:42,695 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,695 INFO L280 TraceCheckUtils]: 13: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:42,695 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-10 14:58:42,695 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:42,696 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:42,696 INFO L280 TraceCheckUtils]: 17: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,696 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,696 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-10 14:58:42,697 INFO L280 TraceCheckUtils]: 20: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:42,697 INFO L280 TraceCheckUtils]: 21: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,697 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,697 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-10 14:58:42,698 INFO L280 TraceCheckUtils]: 24: Hoare triple {990#true} assume !(~ret~0 > 3);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:42,698 INFO L280 TraceCheckUtils]: 25: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:42,698 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:42,698 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-10 14:58:42,699 INFO L280 TraceCheckUtils]: 28: Hoare triple {990#true} assume ~ret~0 > 3;#res := 3; {1039#(<= |id_#res| 3)} is VALID [2020-07-10 14:58:42,700 INFO L280 TraceCheckUtils]: 29: Hoare triple {1039#(<= |id_#res| 3)} assume true; {1039#(<= |id_#res| 3)} is VALID [2020-07-10 14:58:42,703 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1039#(<= |id_#res| 3)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 3)} is VALID [2020-07-10 14:58:42,706 INFO L280 TraceCheckUtils]: 31: Hoare triple {1019#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1020#(<= main_~result~0 3)} is VALID [2020-07-10 14:58:42,707 INFO L280 TraceCheckUtils]: 32: Hoare triple {1020#(<= main_~result~0 3)} assume 5 == ~result~0; {991#false} is VALID [2020-07-10 14:58:42,707 INFO L280 TraceCheckUtils]: 33: Hoare triple {991#false} assume !false; {991#false} is VALID [2020-07-10 14:58:42,708 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-10 14:58:42,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399671541] [2020-07-10 14:58:42,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:42,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:58:42,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853625291] [2020-07-10 14:58:42,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-10 14:58:42,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:42,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:58:42,739 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-10 14:58:42,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:58:42,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:58:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:58:42,740 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2020-07-10 14:58:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:42,794 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 14:58:42,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:58:42,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-10 14:58:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:42,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 14:58:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 14:58:42,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-10 14:58:42,845 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-10 14:58:42,845 INFO L225 Difference]: With dead ends: 27 [2020-07-10 14:58:42,845 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:58:42,847 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-10 14:58:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:58:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:58:42,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:42,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:42,848 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:42,848 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:42,848 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:58:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:58:42,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:42,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:42,849 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:42,849 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:42,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:42,849 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:58:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:58:42,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:42,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:42,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:42,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:58:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:58:42,851 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-10 14:58:42,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:42,853 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:58:42,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:58:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:58:42,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:42,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 14:58:42,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:58:42,884 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:58:42,884 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:58:42,884 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:58:42,885 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:58:42,885 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:58:42,885 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:58:42,885 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-10 14:58:42,885 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-10 14:58:42,886 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2020-07-10 14:58:42,886 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-10 14:58:42,886 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-10 14:58:42,886 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-10 14:58:42,886 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-10 14:58:42,886 INFO L268 CegarLoopResult]: For program point L14-2(lines 11 17) no Hoare annotation was computed. [2020-07-10 14:58:42,886 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 9) no Hoare annotation was computed. [2020-07-10 14:58:42,886 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-10 14:58:42,886 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-10 14:58:42,887 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-10 14:58:42,887 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-10 14:58:42,887 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 14:58:42,887 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-10 14:58:42,892 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:58:42,893 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:58:42,893 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:58:42,893 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:58:42,893 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 14:58:42,893 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:58:42,893 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:58:42,894 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:58:42,894 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 14:58:42,894 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-10 14:58:42,894 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-10 14:58:42,894 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 14:58:42,894 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 14:58:42,894 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-10 14:58:42,894 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-10 14:58:42,894 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-10 14:58:42,895 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 14:58:42,895 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 14:58:42,895 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-10 14:58:42,895 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 14:58:42,895 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 14:58:42,895 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:58:42,895 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-10 14:58:42,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:58:42 BoogieIcfgContainer [2020-07-10 14:58:42,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:58:42,904 INFO L168 Benchmark]: Toolchain (without parser) took 5077.93 ms. Allocated memory was 144.2 MB in the beginning and 282.6 MB in the end (delta: 138.4 MB). Free memory was 101.9 MB in the beginning and 243.7 MB in the end (delta: -141.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 14:58:42,909 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:58:42,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.33 ms. Allocated memory is still 144.2 MB. Free memory was 101.4 MB in the beginning and 92.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:42,911 INFO L168 Benchmark]: Boogie Preprocessor took 28.95 ms. Allocated memory is still 144.2 MB. Free memory was 92.1 MB in the beginning and 90.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:42,912 INFO L168 Benchmark]: RCFGBuilder took 427.41 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 90.7 MB in the beginning and 165.1 MB in the end (delta: -74.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:42,912 INFO L168 Benchmark]: TraceAbstraction took 4387.30 ms. Allocated memory was 201.3 MB in the beginning and 282.6 MB in the end (delta: 81.3 MB). Free memory was 164.4 MB in the beginning and 243.7 MB in the end (delta: -79.3 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:42,919 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.46 ms. Allocated memory is still 144.2 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 228.33 ms. Allocated memory is still 144.2 MB. Free memory was 101.4 MB in the beginning and 92.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.95 ms. Allocated memory is still 144.2 MB. Free memory was 92.1 MB in the beginning and 90.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.41 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 90.7 MB in the beginning and 165.1 MB in the end (delta: -74.4 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4387.30 ms. Allocated memory was 201.3 MB in the beginning and 282.6 MB in the end (delta: 81.3 MB). Free memory was 164.4 MB in the beginning and 243.7 MB in the end (delta: -79.3 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.2s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 16 SDslu, 521 SDs, 0 SdLazy, 113 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 7 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s 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...