java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:19:08,678 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:19:08,683 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:19:08,694 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:19:08,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:19:08,695 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:19:08,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:19:08,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:19:08,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:19:08,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:19:08,702 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:19:08,702 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:19:08,703 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:19:08,704 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:19:08,705 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:19:08,706 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:19:08,707 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:19:08,709 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:19:08,710 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:19:08,712 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:19:08,713 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:19:08,714 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:19:08,717 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:19:08,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:19:08,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:19:08,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:19:08,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:19:08,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:19:08,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:19:08,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:19:08,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:19:08,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:19:08,723 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:19:08,723 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:19:08,724 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:19:08,725 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:19:08,725 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 22:19:08,754 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:19:08,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:19:08,755 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:19:08,756 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:19:08,756 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:19:08,756 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:19:08,756 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:19:08,756 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:19:08,757 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:19:08,757 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:19:08,757 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:19:08,757 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:19:08,757 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:19:08,758 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:19:08,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:19:08,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:19:08,759 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:19:08,759 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:19:08,759 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:19:08,759 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:19:08,761 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:19:08,761 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:19:08,762 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:19:08,762 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:19:08,762 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:19:08,762 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:19:08,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:19:08,763 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:19:08,763 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:19:08,763 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:19:08,763 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:19:08,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:19:08,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:19:08,764 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:19:08,764 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:19:08,818 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:19:08,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:19:08,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:19:08,838 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:19:08,838 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:19:08,839 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3_true-unreach-call.c [2018-11-07 22:19:08,900 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9026926a/98cd8268984f4465b10832f0f2df42b6/FLAGcf511acdd [2018-11-07 22:19:09,379 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:19:09,380 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3_true-unreach-call.c [2018-11-07 22:19:09,386 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9026926a/98cd8268984f4465b10832f0f2df42b6/FLAGcf511acdd [2018-11-07 22:19:09,399 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9026926a/98cd8268984f4465b10832f0f2df42b6 [2018-11-07 22:19:09,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:19:09,410 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:19:09,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:19:09,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:19:09,415 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:19:09,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a15b74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09, skipping insertion in model container [2018-11-07 22:19:09,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:19:09,446 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:19:09,612 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:19:09,616 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:19:09,635 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:19:09,650 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:19:09,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09 WrapperNode [2018-11-07 22:19:09,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:19:09,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:19:09,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:19:09,652 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:19:09,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:19:09,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:19:09,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:19:09,674 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:19:09,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (1/1) ... [2018-11-07 22:19:09,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:19:09,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:19:09,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:19:09,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:19:09,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (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 [2018-11-07 22:19:09,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:19:09,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:19:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:19:09,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:19:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:19:09,823 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:19:09,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:19:09,824 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:19:10,213 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:19:10,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:19:10 BoogieIcfgContainer [2018-11-07 22:19:10,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:19:10,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:19:10,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:19:10,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:19:10,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:19:09" (1/3) ... [2018-11-07 22:19:10,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7207c894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:19:10, skipping insertion in model container [2018-11-07 22:19:10,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:19:09" (2/3) ... [2018-11-07 22:19:10,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7207c894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:19:10, skipping insertion in model container [2018-11-07 22:19:10,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:19:10" (3/3) ... [2018-11-07 22:19:10,222 INFO L112 eAbstractionObserver]: Analyzing ICFG nested3_true-unreach-call.c [2018-11-07 22:19:10,232 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:19:10,239 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:19:10,257 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:19:10,292 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:19:10,292 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:19:10,292 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:19:10,293 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:19:10,293 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:19:10,293 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:19:10,293 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:19:10,293 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:19:10,311 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-07 22:19:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 22:19:10,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:10,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:10,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:10,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash 17946046, now seen corresponding path program 1 times [2018-11-07 22:19:10,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:10,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:10,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:10,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:19:10,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:19:10,428 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:19:10,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:19:10,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:19:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:19:10,448 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-07 22:19:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:10,473 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2018-11-07 22:19:10,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:19:10,475 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 22:19:10,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:10,485 INFO L225 Difference]: With dead ends: 47 [2018-11-07 22:19:10,485 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 22:19:10,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:19:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 22:19:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 22:19:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 22:19:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-07 22:19:10,531 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 10 [2018-11-07 22:19:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:10,532 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-07 22:19:10,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:19:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-07 22:19:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 22:19:10,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:10,533 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:10,534 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:10,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash -583657870, now seen corresponding path program 1 times [2018-11-07 22:19:10,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:10,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:10,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:10,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:10,536 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:10,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:19:10,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:19:10,711 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:19:10,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:19:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:19:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:19:10,714 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2018-11-07 22:19:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:10,790 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-07 22:19:10,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:19:10,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 22:19:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:10,793 INFO L225 Difference]: With dead ends: 39 [2018-11-07 22:19:10,793 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 22:19:10,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:19:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 22:19:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-07 22:19:10,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 22:19:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-07 22:19:10,804 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2018-11-07 22:19:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:10,805 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-07 22:19:10,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:19:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-07 22:19:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 22:19:10,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:10,806 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:10,809 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:10,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2034978746, now seen corresponding path program 1 times [2018-11-07 22:19:10,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:10,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:10,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:10,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:19:10,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:19:10,895 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:19:10,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:19:10,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:19:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:19:10,896 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-07 22:19:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:10,954 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-07 22:19:10,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:19:10,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-07 22:19:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:10,957 INFO L225 Difference]: With dead ends: 47 [2018-11-07 22:19:10,957 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 22:19:10,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:19:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 22:19:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-07 22:19:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 22:19:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-07 22:19:10,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-07 22:19:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:10,971 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-07 22:19:10,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:19:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-07 22:19:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 22:19:10,974 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:10,974 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:10,974 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:10,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2046656706, now seen corresponding path program 1 times [2018-11-07 22:19:10,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:10,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:10,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:10,977 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:11,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:19:11,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:19:11,092 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:19:11,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:19:11,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:19:11,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:19:11,093 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-07 22:19:11,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:11,140 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-07 22:19:11,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:19:11,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-07 22:19:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:11,141 INFO L225 Difference]: With dead ends: 49 [2018-11-07 22:19:11,142 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 22:19:11,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:19:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 22:19:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-07 22:19:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 22:19:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-07 22:19:11,159 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2018-11-07 22:19:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:11,159 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-07 22:19:11,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:19:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-07 22:19:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 22:19:11,163 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:11,163 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:11,164 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:11,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash 441532680, now seen corresponding path program 1 times [2018-11-07 22:19:11,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:11,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:11,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:11,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:11,167 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:11,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:11,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:19:11,301 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-07 22:19:11,304 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [18], [24], [28], [32], [34], [50], [53], [55], [61], [62], [63], [65] [2018-11-07 22:19:11,336 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:19:11,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:19:11,429 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:19:11,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:19:11,566 INFO L272 AbstractInterpreter]: Visited 16 different actions 64 times. Merged at 3 different actions 22 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-07 22:19:11,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:11,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:19:11,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:11,605 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:19:11,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:11,624 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:19:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:11,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:19:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:11,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:19:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:11,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:19:11,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 22:19:11,856 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:19:11,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 22:19:11,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 22:19:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:19:11,857 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2018-11-07 22:19:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:11,904 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-07 22:19:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 22:19:11,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-07 22:19:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:11,906 INFO L225 Difference]: With dead ends: 53 [2018-11-07 22:19:11,907 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 22:19:11,907 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 22:19:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 22:19:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-07 22:19:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 22:19:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-07 22:19:11,914 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-11-07 22:19:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:11,914 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-07 22:19:11,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 22:19:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-07 22:19:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 22:19:11,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:11,915 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:11,916 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:11,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash -189397042, now seen corresponding path program 2 times [2018-11-07 22:19:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:11,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:11,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:11,918 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:12,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:12,178 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:19:12,178 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:19:12,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:19:12,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:12,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:19:12,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:19:12,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:19:12,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 22:19:12,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:19:12,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:19:14,403 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_3 Int)) (let ((.cse0 (mod v_prenex_3 4))) (and (= |c___VERIFIER_assert_#in~cond| .cse0) (<= .cse0 2147483647) (<= 268435455 (mod v_prenex_3 4294967296)) (< (mod (+ v_prenex_3 4294967295) 4294967296) 268435455) (= 0 .cse0)))) (exists ((v_prenex_1 Int)) (let ((.cse1 (mod v_prenex_1 4294967296)) (.cse2 (mod v_prenex_1 4))) (and (<= 268435455 .cse1) (<= 0 .cse1) (= |c___VERIFIER_assert_#in~cond| .cse2) (<= .cse2 2147483647) (< (mod (+ v_prenex_1 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_4 Int)) (let ((.cse3 (mod v_prenex_4 4))) (and (= 0 .cse3) (< 2147483647 .cse3) (<= 268435455 (mod v_prenex_4 4294967296)) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse3) (< (mod (+ v_prenex_4 4294967295) 4294967296) 268435455)))) (exists ((v_main_~z~0_BEFORE_CALL_1 Int)) (let ((.cse4 (mod v_main_~z~0_BEFORE_CALL_1 4))) (let ((.cse6 (mod v_main_~z~0_BEFORE_CALL_1 4294967296)) (.cse5 (mod (+ .cse4 4294967292) 4294967296))) (and (not (= 0 .cse4)) (= |c___VERIFIER_assert_#in~cond| .cse5) (< .cse6 0) (< (mod (+ v_main_~z~0_BEFORE_CALL_1 4294967295) 4294967296) 268435455) (<= 268435455 .cse6) (<= .cse5 2147483647))))) (exists ((v_prenex_2 Int)) (let ((.cse9 (mod v_prenex_2 4))) (let ((.cse7 (mod v_prenex_2 4294967296)) (.cse8 (mod (+ .cse9 4294967292) 4294967296))) (and (< .cse7 0) (< (mod (+ v_prenex_2 4294967295) 4294967296) 268435455) (= .cse8 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (<= 268435455 .cse7) (< 2147483647 .cse8) (not (= 0 .cse9)))))) (exists ((v_prenex_5 Int)) (let ((.cse10 (mod v_prenex_5 4294967296)) (.cse11 (mod v_prenex_5 4))) (and (<= 0 .cse10) (<= 268435455 .cse10) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse11) (< 2147483647 .cse11) (< (mod (+ v_prenex_5 4294967295) 4294967296) 268435455))))) is different from true [2018-11-07 22:19:17,613 WARN L179 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 19 [2018-11-07 22:19:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:19:17,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:19:18,026 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 6 [2018-11-07 22:19:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 22:19:18,082 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:19:18,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [5] total 13 [2018-11-07 22:19:18,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:19:18,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:19:18,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:19:18,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2018-11-07 22:19:18,084 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2018-11-07 22:19:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:18,250 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-07 22:19:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:19:18,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-07 22:19:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:18,252 INFO L225 Difference]: With dead ends: 38 [2018-11-07 22:19:18,253 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 22:19:18,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2018-11-07 22:19:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 22:19:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-07 22:19:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 22:19:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-07 22:19:18,261 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2018-11-07 22:19:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:18,262 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-07 22:19:18,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:19:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-07 22:19:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 22:19:18,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:18,263 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:18,263 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:18,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:18,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1362965944, now seen corresponding path program 1 times [2018-11-07 22:19:18,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:18,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:18,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:19:18,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:18,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 22:19:18,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:18,393 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:19:18,394 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-07 22:19:18,394 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [18], [22], [24], [28], [32], [34], [39], [50], [53], [55], [58], [60], [61], [62], [63], [65], [66], [67] [2018-11-07 22:19:18,396 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:19:18,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:19:18,401 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:19:18,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:19:18,761 INFO L272 AbstractInterpreter]: Visited 22 different actions 209 times. Merged at 8 different actions 70 times. Widened at 3 different actions 14 times. Found 13 fixpoints after 4 different actions. Largest state had 6 variables. [2018-11-07 22:19:18,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:18,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:19:18,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:18,797 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:19:18,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:18,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:19:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:18,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:19:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:19,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:19:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:19:19,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:19:19,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2018-11-07 22:19:19,655 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:19:19,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:19:19,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:19:19,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:19:19,657 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 6 states. [2018-11-07 22:19:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:19,874 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2018-11-07 22:19:19,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:19:19,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-07 22:19:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:19,876 INFO L225 Difference]: With dead ends: 81 [2018-11-07 22:19:19,876 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 22:19:19,877 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:19:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 22:19:19,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2018-11-07 22:19:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 22:19:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-07 22:19:19,899 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 27 [2018-11-07 22:19:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:19,900 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-07 22:19:19,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:19:19,900 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-07 22:19:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 22:19:19,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:19,906 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:19,906 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:19,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash -263080874, now seen corresponding path program 2 times [2018-11-07 22:19:19,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:19,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:19,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:19,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:19,909 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 22:19:20,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:20,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:19:20,187 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:19:20,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:19:20,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:20,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:19:20,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:19:20,202 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:19:20,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 22:19:20,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:19:20,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:19:22,393 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_13 Int)) (let ((.cse2 (mod v_prenex_13 2))) (let ((.cse1 (mod v_prenex_13 4294967296)) (.cse0 (mod (+ .cse2 4294967294) 4294967296))) (and (= .cse0 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (<= 268435455 .cse1) (< .cse1 0) (<= .cse2 2147483647) (< (mod (+ v_prenex_13 4294967295) 4294967296) 268435455) (not (= 0 .cse2)) (< 2147483647 .cse0))))) (exists ((v_prenex_7 Int)) (let ((.cse3 (mod v_prenex_7 2))) (let ((.cse4 (mod (+ .cse3 4294967294) 4294967296)) (.cse5 (mod v_prenex_7 4294967296))) (and (< (mod (+ v_prenex_7 4294967295) 4294967296) 268435455) (< 2147483647 .cse3) (< 2147483647 .cse4) (= .cse4 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (< .cse5 0) (not (= 0 .cse3)) (<= 268435455 .cse5))))) (exists ((v_prenex_8 Int)) (let ((.cse6 (mod v_prenex_8 2))) (and (= |c___VERIFIER_assert_#in~cond| .cse6) (= 0 .cse6) (<= 268435455 (mod v_prenex_8 4294967296)) (< 2147483647 (mod (+ .cse6 4294967294) 4294967296)) (<= .cse6 2147483647) (< (mod (+ v_prenex_8 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_10 Int)) (let ((.cse7 (mod v_prenex_10 2))) (and (<= 268435455 (mod v_prenex_10 4294967296)) (= 0 .cse7) (< 2147483647 (mod (+ .cse7 4294967294) 4294967296)) (= .cse7 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (< (mod (+ v_prenex_10 4294967295) 4294967296) 268435455) (< 2147483647 .cse7)))) (exists ((v_prenex_9 Int)) (let ((.cse8 (mod v_prenex_9 2))) (and (<= .cse8 2147483647) (<= 268435455 (mod v_prenex_9 4294967296)) (= 0 .cse8) (<= (mod (+ .cse8 4294967294) 4294967296) 2147483647) (= |c___VERIFIER_assert_#in~cond| .cse8) (< (mod (+ v_prenex_9 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_15 Int)) (let ((.cse10 (mod v_prenex_15 2))) (let ((.cse9 (mod (+ .cse10 4294967294) 4294967296)) (.cse11 (mod v_prenex_15 4294967296))) (and (= .cse9 |c___VERIFIER_assert_#in~cond|) (not (= 0 .cse10)) (<= .cse9 2147483647) (< .cse11 0) (<= 268435455 .cse11) (< 2147483647 .cse10) (< (mod (+ v_prenex_15 4294967295) 4294967296) 268435455))))) (exists ((v_prenex_6 Int)) (let ((.cse12 (mod v_prenex_6 2))) (and (= .cse12 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (<= (mod (+ .cse12 4294967294) 4294967296) 2147483647) (< (mod (+ v_prenex_6 4294967295) 4294967296) 268435455) (<= 268435455 (mod v_prenex_6 4294967296)) (= 0 .cse12) (< 2147483647 .cse12)))) (exists ((v_prenex_16 Int)) (let ((.cse13 (mod v_prenex_16 2)) (.cse14 (mod v_prenex_16 4294967296))) (and (<= (mod (+ .cse13 4294967294) 4294967296) 2147483647) (<= .cse13 2147483647) (<= 0 .cse14) (= |c___VERIFIER_assert_#in~cond| .cse13) (< (mod (+ v_prenex_16 4294967295) 4294967296) 268435455) (<= 268435455 .cse14)))) (exists ((v_main_~y~0_BEFORE_CALL_4 Int)) (let ((.cse15 (mod v_main_~y~0_BEFORE_CALL_4 2))) (let ((.cse16 (mod v_main_~y~0_BEFORE_CALL_4 4294967296)) (.cse17 (mod (+ .cse15 4294967294) 4294967296))) (and (<= .cse15 2147483647) (<= 268435455 .cse16) (< (mod (+ v_main_~y~0_BEFORE_CALL_4 4294967295) 4294967296) 268435455) (< .cse16 0) (= .cse17 |c___VERIFIER_assert_#in~cond|) (not (= 0 .cse15)) (<= .cse17 2147483647))))) (exists ((v_prenex_14 Int)) (let ((.cse18 (mod v_prenex_14 4294967296)) (.cse19 (mod v_prenex_14 2))) (and (<= 268435455 .cse18) (< 2147483647 .cse19) (<= 0 .cse18) (< (mod (+ v_prenex_14 4294967295) 4294967296) 268435455) (<= (mod (+ .cse19 4294967294) 4294967296) 2147483647) (= .cse19 (+ |c___VERIFIER_assert_#in~cond| 4294967296))))) (exists ((v_prenex_11 Int)) (let ((.cse21 (mod v_prenex_11 4294967296)) (.cse20 (mod v_prenex_11 2))) (and (< 2147483647 (mod (+ .cse20 4294967294) 4294967296)) (< 2147483647 .cse20) (<= 268435455 .cse21) (<= 0 .cse21) (= .cse20 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (< (mod (+ v_prenex_11 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_12 Int)) (let ((.cse22 (mod v_prenex_12 2)) (.cse23 (mod v_prenex_12 4294967296))) (and (< (mod (+ v_prenex_12 4294967295) 4294967296) 268435455) (= |c___VERIFIER_assert_#in~cond| .cse22) (<= .cse22 2147483647) (<= 0 .cse23) (< 2147483647 (mod (+ .cse22 4294967294) 4294967296)) (<= 268435455 .cse23))))) is different from true [2018-11-07 22:19:29,784 WARN L179 SmtUtils]: Spent 3.13 s on a formula simplification. DAG size of input: 198 DAG size of output: 23 [2018-11-07 22:19:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 22:19:29,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:19:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 22:19:32,090 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:19:32,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [5] total 15 [2018-11-07 22:19:32,091 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:19:32,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:19:32,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:19:32,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=4, NotChecked=24, Total=210 [2018-11-07 22:19:32,092 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 7 states. [2018-11-07 22:19:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:32,276 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-07 22:19:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:19:32,277 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-07 22:19:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:32,278 INFO L225 Difference]: With dead ends: 50 [2018-11-07 22:19:32,278 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 22:19:32,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=4, NotChecked=26, Total=240 [2018-11-07 22:19:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 22:19:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-07 22:19:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 22:19:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-07 22:19:32,289 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 41 [2018-11-07 22:19:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:32,290 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-07 22:19:32,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:19:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-07 22:19:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 22:19:32,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:32,292 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:32,292 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:32,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1693612113, now seen corresponding path program 1 times [2018-11-07 22:19:32,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:32,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:32,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:19:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:32,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-07 22:19:32,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:32,503 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:19:32,504 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-11-07 22:19:32,504 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [18], [22], [24], [28], [32], [34], [39], [44], [50], [53], [55], [58], [60], [61], [62], [63], [65], [66], [67], [68], [69] [2018-11-07 22:19:32,506 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:19:32,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:19:32,511 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:19:32,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:19:32,740 INFO L272 AbstractInterpreter]: Visited 26 different actions 352 times. Merged at 13 different actions 125 times. Widened at 5 different actions 25 times. Found 27 fixpoints after 6 different actions. Largest state had 7 variables. [2018-11-07 22:19:32,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:32,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:19:32,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:32,779 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:19:32,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:32,796 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:19:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:32,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:19:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:19:32,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:19:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 22:19:33,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:19:33,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 10 [2018-11-07 22:19:33,094 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:19:33,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 22:19:33,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 22:19:33,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:19:33,096 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-11-07 22:19:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:33,302 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2018-11-07 22:19:33,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 22:19:33,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-11-07 22:19:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:33,304 INFO L225 Difference]: With dead ends: 109 [2018-11-07 22:19:33,304 INFO L226 Difference]: Without dead ends: 104 [2018-11-07 22:19:33,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 22:19:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-07 22:19:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2018-11-07 22:19:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 22:19:33,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-11-07 22:19:33,321 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 49 [2018-11-07 22:19:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:33,322 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-11-07 22:19:33,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 22:19:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-07 22:19:33,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 22:19:33,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:19:33,325 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 7, 6, 6, 6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:19:33,325 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:19:33,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:19:33,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1254786320, now seen corresponding path program 2 times [2018-11-07 22:19:33,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:19:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:33,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:19:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:19:33,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:19:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:19:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 80 proven. 6 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-07 22:19:33,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:33,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:19:33,556 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:19:33,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 22:19:33,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:19:33,556 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:19:33,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:19:33,565 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:19:33,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 22:19:33,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:19:33,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:19:35,846 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_main_~x~0_BEFORE_CALL_10 Int)) (let ((.cse2 (mod v_main_~x~0_BEFORE_CALL_10 2))) (let ((.cse1 (mod v_main_~x~0_BEFORE_CALL_10 4294967296)) (.cse0 (mod (+ .cse2 4294967294) 4294967296))) (and (< 2147483647 .cse0) (< .cse1 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_10 4294967295) 4294967296) 268435455) (<= 268435455 .cse1) (= .cse0 (+ |c___VERIFIER_assert_#in~cond| 4294967296)) (not (= .cse2 0)))))) (exists ((v_prenex_19 Int)) (let ((.cse4 (mod v_prenex_19 4294967296)) (.cse3 (mod v_prenex_19 2))) (and (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse3) (<= 0 .cse4) (<= 268435455 .cse4) (< 2147483647 .cse3) (< (mod (+ v_prenex_19 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_21 Int)) (let ((.cse6 (mod v_prenex_21 2))) (let ((.cse5 (mod v_prenex_21 4294967296)) (.cse7 (mod (+ .cse6 4294967294) 4294967296))) (and (< .cse5 0) (<= 268435455 .cse5) (< (mod (+ v_prenex_21 4294967295) 4294967296) 268435455) (not (= .cse6 0)) (<= .cse7 2147483647) (= |c___VERIFIER_assert_#in~cond| .cse7))))) (exists ((v_prenex_20 Int)) (let ((.cse8 (mod v_prenex_20 2))) (and (< 2147483647 .cse8) (= (+ |c___VERIFIER_assert_#in~cond| 4294967296) .cse8) (< (mod (+ v_prenex_20 4294967295) 4294967296) 268435455) (<= 268435455 (mod v_prenex_20 4294967296)) (= .cse8 0)))) (exists ((v_prenex_17 Int)) (let ((.cse9 (mod v_prenex_17 2))) (and (<= 268435455 (mod v_prenex_17 4294967296)) (= .cse9 0) (< (mod (+ v_prenex_17 4294967295) 4294967296) 268435455) (<= .cse9 2147483647) (= |c___VERIFIER_assert_#in~cond| .cse9)))) (exists ((v_prenex_18 Int)) (let ((.cse11 (mod v_prenex_18 2)) (.cse10 (mod v_prenex_18 4294967296))) (and (<= 268435455 .cse10) (<= .cse11 2147483647) (= |c___VERIFIER_assert_#in~cond| .cse11) (<= 0 .cse10) (< (mod (+ v_prenex_18 4294967295) 4294967296) 268435455))))) is different from true [2018-11-07 22:19:38,079 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_21 Int)) (let ((.cse1 (mod v_prenex_21 2))) (let ((.cse0 (mod v_prenex_21 4294967296)) (.cse2 (mod (+ .cse1 4294967294) 4294967296))) (and (< .cse0 0) (<= 268435455 .cse0) (< (mod (+ v_prenex_21 4294967295) 4294967296) 268435455) (not (= .cse1 0)) (<= .cse2 2147483647) (= .cse2 c___VERIFIER_assert_~cond))))) (exists ((v_prenex_18 Int)) (let ((.cse3 (mod v_prenex_18 2)) (.cse4 (mod v_prenex_18 4294967296))) (and (= .cse3 c___VERIFIER_assert_~cond) (<= 268435455 .cse4) (<= .cse3 2147483647) (<= 0 .cse4) (< (mod (+ v_prenex_18 4294967295) 4294967296) 268435455)))) (exists ((v_prenex_20 Int)) (let ((.cse5 (mod v_prenex_20 2))) (and (< 2147483647 .cse5) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse5) (< (mod (+ v_prenex_20 4294967295) 4294967296) 268435455) (<= 268435455 (mod v_prenex_20 4294967296)) (= .cse5 0)))) (exists ((v_prenex_17 Int)) (let ((.cse6 (mod v_prenex_17 2))) (and (<= 268435455 (mod v_prenex_17 4294967296)) (= .cse6 0) (< (mod (+ v_prenex_17 4294967295) 4294967296) 268435455) (= .cse6 c___VERIFIER_assert_~cond) (<= .cse6 2147483647)))) (exists ((v_prenex_19 Int)) (let ((.cse7 (mod v_prenex_19 4294967296)) (.cse8 (mod v_prenex_19 2))) (and (<= 0 .cse7) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse8) (<= 268435455 .cse7) (< 2147483647 .cse8) (< (mod (+ v_prenex_19 4294967295) 4294967296) 268435455)))) (exists ((v_main_~x~0_BEFORE_CALL_10 Int)) (let ((.cse11 (mod v_main_~x~0_BEFORE_CALL_10 2))) (let ((.cse9 (mod (+ .cse11 4294967294) 4294967296)) (.cse10 (mod v_main_~x~0_BEFORE_CALL_10 4294967296))) (and (< 2147483647 .cse9) (< .cse10 0) (< (mod (+ v_main_~x~0_BEFORE_CALL_10 4294967295) 4294967296) 268435455) (= (+ c___VERIFIER_assert_~cond 4294967296) .cse9) (<= 268435455 .cse10) (not (= .cse11 0))))))) is different from false [2018-11-07 22:19:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-07 22:19:38,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:19:38,561 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 6 [2018-11-07 22:19:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-11-07 22:19:40,735 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 22:19:40,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [5] total 15 [2018-11-07 22:19:40,735 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:19:40,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 22:19:40,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 22:19:40,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=128, Unknown=3, NotChecked=46, Total=210 [2018-11-07 22:19:40,737 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 7 states. [2018-11-07 22:19:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:19:40,827 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-07 22:19:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:19:40,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-11-07 22:19:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:19:40,829 INFO L225 Difference]: With dead ends: 72 [2018-11-07 22:19:40,829 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 22:19:40,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=39, Invalid=148, Unknown=3, NotChecked=50, Total=240 [2018-11-07 22:19:40,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 22:19:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 22:19:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 22:19:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 22:19:40,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2018-11-07 22:19:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:19:40,831 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 22:19:40,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 22:19:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 22:19:40,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 22:19:40,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 22:19:40,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:19:40,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:19:40,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:19:40,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:19:40,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:19:40,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 22:19:41,290 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-11-07 22:19:41,540 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 22:19:41,873 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-07 22:19:42,201 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-11-07 22:19:42,403 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-11-07 22:19:42,406 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 22:19:42,406 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:19:42,407 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:19:42,407 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 22:19:42,407 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:19:42,407 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:19:42,407 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-07 22:19:42,407 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 33) no Hoare annotation was computed. [2018-11-07 22:19:42,407 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 23) no Hoare annotation was computed. [2018-11-07 22:19:42,407 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 26) no Hoare annotation was computed. [2018-11-07 22:19:42,408 INFO L421 ceAbstractionStarter]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse6 (= main_~z~0 0)) (.cse5 (<= 0 main_~y~0)) (.cse8 (<= main_~x~0 0)) (.cse3 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455)) (.cse9 (<= 0 main_~x~0)) (.cse7 (<= main_~y~0 0)) (.cse0 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse1 (< (mod main_~x~0 4294967296) 268435455)) (.cse10 (<= 0 main_~z~0)) (.cse2 (< (mod main_~y~0 4294967296) 268435455)) (.cse11 (<= main_~z~0 0)) (.cse4 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse1 .cse6 .cse7) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse0 .cse1 .cse5 .cse3 .cse7) (and .cse10 .cse2 .cse11 .cse8 .cse9 .cse4) (and .cse2 .cse3 .cse8 .cse9 .cse4) (and .cse5 .cse8 .cse3 .cse9 .cse7) (and .cse0 .cse1 .cse10 .cse2 .cse11 .cse4))) [2018-11-07 22:19:42,408 INFO L421 ceAbstractionStarter]: At program point L21-4(lines 21 23) the Hoare annotation is: (let ((.cse0 (<= 0 main_~y~0)) (.cse5 (<= main_~y~0 0)) (.cse2 (<= main_~x~0 0)) (.cse4 (<= 0 main_~x~0)) (.cse6 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse7 (< (mod main_~x~0 4294967296) 268435455)) (.cse8 (< (mod main_~y~0 4294967296) 268435455)) (.cse1 (<= 268435455 (mod main_~z~0 4294967296))) (.cse3 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455)) (.cse9 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse1 .cse3 .cse5) (and .cse8 .cse1 .cse3 .cse2 .cse4 .cse9) (and .cse6 .cse7 .cse8 .cse1 .cse3 .cse9))) [2018-11-07 22:19:42,408 INFO L421 ceAbstractionStarter]: At program point L19-3(lines 19 26) the Hoare annotation is: (let ((.cse0 (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455)) (.cse2 (< (mod main_~x~0 4294967296) 268435455)) (.cse4 (<= 268435455 (mod main_~z~0 4294967296))) (.cse6 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455)) (.cse8 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) (.cse1 (<= 0 main_~y~0)) (.cse5 (<= main_~x~0 0)) (.cse7 (<= 0 main_~x~0)) (.cse3 (<= main_~y~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse8) (and .cse1 .cse5 .cse7 .cse3))) [2018-11-07 22:19:42,408 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 26) the Hoare annotation is: (let ((.cse0 (<= 268435455 (mod main_~y~0 4294967296))) (.cse1 (<= 268435455 (mod main_~z~0 4294967296))) (.cse2 (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455)) (.cse3 (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455))) (or (and .cse0 .cse1 (<= main_~x~0 0) .cse2 (<= 0 main_~x~0) .cse3) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (< (mod main_~x~0 4294967296) 268435455) .cse0 .cse1 .cse2 .cse3))) [2018-11-07 22:19:42,408 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 33) no Hoare annotation was computed. [2018-11-07 22:19:42,408 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 33) the Hoare annotation is: true [2018-11-07 22:19:42,409 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-07 22:19:42,409 INFO L425 ceAbstractionStarter]: For program point L16-1(lines 16 30) no Hoare annotation was computed. [2018-11-07 22:19:42,409 INFO L421 ceAbstractionStarter]: At program point L16-3(lines 16 30) the Hoare annotation is: (or (and (<= 0 main_~y~0) (<= main_~x~0 0) (= main_~z~0 0) (<= 0 main_~x~0) (<= main_~y~0 0)) (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~y~0 4294967296)) (<= 268435455 (mod main_~z~0 4294967296)) (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455) (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455))) [2018-11-07 22:19:42,409 INFO L421 ceAbstractionStarter]: At program point L16-4(lines 16 30) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 268435455) (<= 268435455 (mod main_~y~0 4294967296)) (<= 268435455 (mod main_~x~0 4294967296)) (<= 268435455 (mod main_~z~0 4294967296)) (< (mod (+ main_~z~0 4294967295) 4294967296) 268435455) (< (mod (+ main_~y~0 4294967295) 4294967296) 268435455)) [2018-11-07 22:19:42,409 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 22:19:42,409 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 22:19:42,409 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:19:42,410 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 22:19:42,410 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 22:19:42,410 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:19:42,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:19:42 BoogieIcfgContainer [2018-11-07 22:19:42,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:19:42,427 INFO L168 Benchmark]: Toolchain (without parser) took 33017.55 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -213.0 MB). Peak memory consumption was 551.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:19:42,428 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:19:42,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.57 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 22:19:42,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.81 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:19:42,430 INFO L168 Benchmark]: Boogie Preprocessor took 25.28 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:19:42,430 INFO L168 Benchmark]: RCFGBuilder took 514.60 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:19:42,432 INFO L168 Benchmark]: TraceAbstraction took 32210.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 594.3 MB). Peak memory consumption was 594.3 MB. Max. memory is 7.1 GB. [2018-11-07 22:19:42,436 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 240.57 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 21.81 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.28 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 514.60 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32210.89 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 594.3 MB). Peak memory consumption was 594.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((((((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && y % 4294967296 < 268435455) && (z + 4294967295) % 4294967296 < 268435455) && (y + 4294967295) % 4294967296 < 268435455) || (((((x + 4294967295) % 4294967296 < 268435455 && 0 <= y) && x % 4294967296 < 268435455) && z == 0) && y <= 0)) || ((((0 <= y && x <= 0) && z == 0) && 0 <= x) && y <= 0)) || (((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && 0 <= y) && (z + 4294967295) % 4294967296 < 268435455) && y <= 0)) || (((((0 <= z && y % 4294967296 < 268435455) && z <= 0) && x <= 0) && 0 <= x) && (y + 4294967295) % 4294967296 < 268435455)) || ((((y % 4294967296 < 268435455 && (z + 4294967295) % 4294967296 < 268435455) && x <= 0) && 0 <= x) && (y + 4294967295) % 4294967296 < 268435455)) || ((((0 <= y && x <= 0) && (z + 4294967295) % 4294967296 < 268435455) && 0 <= x) && y <= 0)) || ((((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && 0 <= z) && y % 4294967296 < 268435455) && z <= 0) && (y + 4294967295) % 4294967296 < 268435455) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((0 <= y && x <= 0) && z == 0) && 0 <= x) && y <= 0) || (((((x + 4294967295) % 4294967296 < 268435455 && 268435455 <= y % 4294967296) && 268435455 <= z % 4294967296) && (z + 4294967295) % 4294967296 < 268435455) && (y + 4294967295) % 4294967296 < 268435455) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((x + 4294967295) % 4294967296 < 268435455 && 0 <= y) && x % 4294967296 < 268435455) && y <= 0) || ((((268435455 <= z % 4294967296 && x <= 0) && (z + 4294967295) % 4294967296 < 268435455) && 0 <= x) && (y + 4294967295) % 4294967296 < 268435455)) || (((((x + 4294967295) % 4294967296 < 268435455 && x % 4294967296 < 268435455) && 268435455 <= z % 4294967296) && (z + 4294967295) % 4294967296 < 268435455) && (y + 4294967295) % 4294967296 < 268435455)) || (((0 <= y && x <= 0) && 0 <= x) && y <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. SAFE Result, 32.1s OverallTime, 10 OverallIterations, 12 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 300 SDtfs, 78 SDslu, 406 SDs, 0 SdLazy, 159 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 449 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 26.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 60 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 34 PreInvPairs, 62 NumberOfFragments, 575 HoareAnnotationTreeSize, 34 FomulaSimplifications, 1744 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 2106 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 27.4s InterpolantComputationTime, 529 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 747 ConstructedInterpolants, 6 QuantifiedInterpolants, 196917 SizeOfPredicates, 13 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 1056/1128 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...