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/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 22:06:59,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 22:06:59,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 22:06:59,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 22:06:59,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 22:06:59,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 22:06:59,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 22:06:59,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 22:06:59,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 22:06:59,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 22:06:59,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 22:06:59,473 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 22:06:59,474 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 22:06:59,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 22:06:59,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 22:06:59,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 22:06:59,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 22:06:59,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 22:06:59,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 22:06:59,494 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 22:06:59,495 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 22:06:59,498 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 22:06:59,501 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 22:06:59,501 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 22:06:59,501 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 22:06:59,502 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 22:06:59,503 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 22:06:59,503 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 22:06:59,504 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 22:06:59,505 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 22:06:59,505 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 22:06:59,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 22:06:59,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 22:06:59,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 22:06:59,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 22:06:59,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 22:06:59,514 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:06:59,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 22:06:59,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 22:06:59,540 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 22:06:59,540 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 22:06:59,540 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 22:06:59,541 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 22:06:59,541 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 22:06:59,541 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 22:06:59,541 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 22:06:59,542 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 22:06:59,542 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 22:06:59,542 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 22:06:59,542 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 22:06:59,543 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 22:06:59,543 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 22:06:59,543 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 22:06:59,543 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 22:06:59,544 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 22:06:59,544 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 22:06:59,544 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 22:06:59,544 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 22:06:59,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 22:06:59,545 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 22:06:59,545 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 22:06:59,545 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 22:06:59,545 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 22:06:59,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 22:06:59,546 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 22:06:59,546 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 22:06:59,546 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 22:06:59,546 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 22:06:59,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 22:06:59,547 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 22:06:59,547 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 22:06:59,547 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 22:06:59,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 22:06:59,612 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 22:06:59,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 22:06:59,617 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 22:06:59,618 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 22:06:59,618 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-07 22:06:59,688 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb24937cf/0cb24f092c094f948d1f7a02cb962782/FLAGd3b97ba47 [2018-11-07 22:07:00,070 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 22:07:00,070 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-11-07 22:07:00,076 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb24937cf/0cb24f092c094f948d1f7a02cb962782/FLAGd3b97ba47 [2018-11-07 22:07:00,089 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb24937cf/0cb24f092c094f948d1f7a02cb962782 [2018-11-07 22:07:00,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 22:07:00,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 22:07:00,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 22:07:00,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 22:07:00,107 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 22:07:00,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:07:00" (1/1) ... [2018-11-07 22:07:00,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42126e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00, skipping insertion in model container [2018-11-07 22:07:00,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:07:00" (1/1) ... [2018-11-07 22:07:00,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 22:07:00,140 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 22:07:00,331 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:07:00,335 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 22:07:00,360 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 22:07:00,380 INFO L193 MainTranslator]: Completed translation [2018-11-07 22:07:00,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00 WrapperNode [2018-11-07 22:07:00,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 22:07:00,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 22:07:00,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 22:07:00,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 22:07:00,391 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:07:00" (1/1) ... [2018-11-07 22:07:00,401 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:07:00" (1/1) ... [2018-11-07 22:07:00,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 22:07:00,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 22:07:00,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 22:07:00,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 22:07:00,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00" (1/1) ... [2018-11-07 22:07:00,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00" (1/1) ... [2018-11-07 22:07:00,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00" (1/1) ... [2018-11-07 22:07:00,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00" (1/1) ... [2018-11-07 22:07:00,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00" (1/1) ... [2018-11-07 22:07:00,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00" (1/1) ... [2018-11-07 22:07:00,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00" (1/1) ... [2018-11-07 22:07:00,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 22:07:00,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 22:07:00,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 22:07:00,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 22:07:00,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00" (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:07:00,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 22:07:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 22:07:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 22:07:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 22:07:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 22:07:00,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 22:07:00,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 22:07:00,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 22:07:00,989 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 22:07:00,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:07:00 BoogieIcfgContainer [2018-11-07 22:07:00,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 22:07:00,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 22:07:00,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 22:07:00,994 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 22:07:00,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:07:00" (1/3) ... [2018-11-07 22:07:00,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a24f8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:07:00, skipping insertion in model container [2018-11-07 22:07:00,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:07:00" (2/3) ... [2018-11-07 22:07:00,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a24f8cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:07:00, skipping insertion in model container [2018-11-07 22:07:00,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:07:00" (3/3) ... [2018-11-07 22:07:00,998 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-07 22:07:01,008 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 22:07:01,016 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 22:07:01,032 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 22:07:01,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 22:07:01,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 22:07:01,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 22:07:01,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 22:07:01,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 22:07:01,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 22:07:01,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 22:07:01,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 22:07:01,084 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-07 22:07:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 22:07:01,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:01,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:01,093 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:01,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-11-07 22:07:01,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:01,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:01,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:01,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:01,201 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:07:01,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:07:01,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 22:07:01,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:07:01,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 22:07:01,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 22:07:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 22:07:01,221 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-07 22:07:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:01,241 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-07 22:07:01,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 22:07:01,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 22:07:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:01,253 INFO L225 Difference]: With dead ends: 39 [2018-11-07 22:07:01,253 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 22:07:01,256 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:07:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 22:07:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 22:07:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 22:07:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-07 22:07:01,303 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-07 22:07:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:01,303 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-07 22:07:01,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 22:07:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-07 22:07:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 22:07:01,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:01,305 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:01,305 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:01,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:01,306 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-11-07 22:07:01,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:01,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:01,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:01,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:01,308 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:01,498 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:07:01,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:07:01,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:07:01,499 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:07:01,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:07:01,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:07:01,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:07:01,502 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-07 22:07:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:01,818 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-07 22:07:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:07:01,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 22:07:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:01,821 INFO L225 Difference]: With dead ends: 30 [2018-11-07 22:07:01,821 INFO L226 Difference]: Without dead ends: 25 [2018-11-07 22:07:01,822 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:07:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-07 22:07:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-07 22:07:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 22:07:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-07 22:07:01,829 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-11-07 22:07:01,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:01,829 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-07 22:07:01,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:07:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-07 22:07:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 22:07:01,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:01,831 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:01,832 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:01,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-11-07 22:07:01,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:01,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:01,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:02,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:07:02,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:07:02,019 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:07:02,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:07:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:07:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:07:02,023 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-11-07 22:07:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:02,427 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-11-07 22:07:02,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:07:02,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-07 22:07:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:02,430 INFO L225 Difference]: With dead ends: 54 [2018-11-07 22:07:02,430 INFO L226 Difference]: Without dead ends: 37 [2018-11-07 22:07:02,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 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:07:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-07 22:07:02,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-07 22:07:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 22:07:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-07 22:07:02,438 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-11-07 22:07:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:02,439 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-07 22:07:02,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:07:02,439 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-11-07 22:07:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 22:07:02,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:02,440 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:02,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:02,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-11-07 22:07:02,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:02,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:02,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:02,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:02,442 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:03,011 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:07:03,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:03,012 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:03,012 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 22:07:03,014 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [23], [29], [35], [41], [47], [53], [59], [65], [71], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 22:07:03,045 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:07:03,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:07:03,134 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:07:03,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:07:03,793 INFO L272 AbstractInterpreter]: Visited 22 different actions 116 times. Merged at 13 different actions 76 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 22:07:03,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:03,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:07:03,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:03,839 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:07:03,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:03,857 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:07:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:03,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:04,008 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:07:04,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:06,597 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:07:06,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:06,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 22:07:06,629 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:06,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 22:07:06,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 22:07:06,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:07:06,634 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-11-07 22:07:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:07,050 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-07 22:07:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:07:07,053 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-07 22:07:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:07,054 INFO L225 Difference]: With dead ends: 54 [2018-11-07 22:07:07,054 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 22:07:07,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 22:07:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 22:07:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 22:07:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 22:07:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-07 22:07:07,063 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-11-07 22:07:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:07,063 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-07 22:07:07,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 22:07:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-07 22:07:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 22:07:07,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:07,064 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:07,065 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:07,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-11-07 22:07:07,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:07,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:07,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:07,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:07,066 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:09,182 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-11-07 22:07:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:09,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 22:07:09,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 22:07:09,185 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 22:07:09,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 22:07:09,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 22:07:09,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:07:09,186 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-11-07 22:07:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:09,340 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-07 22:07:09,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 22:07:09,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-07 22:07:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:09,344 INFO L225 Difference]: With dead ends: 66 [2018-11-07 22:07:09,344 INFO L226 Difference]: Without dead ends: 49 [2018-11-07 22:07:09,345 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 22:07:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-07 22:07:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-07 22:07:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 22:07:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-07 22:07:09,351 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-11-07 22:07:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:09,352 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-07 22:07:09,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 22:07:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-07 22:07:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 22:07:09,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:09,353 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:09,354 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:09,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-11-07 22:07:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:09,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:09,355 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:11,651 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-07 22:07:13,681 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:15,726 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:17,750 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:19,767 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:21,787 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-07 22:07:21,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:21,831 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:21,832 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 22:07:21,832 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [19], [25], [31], [37], [43], [49], [55], [61], [67], [73], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 22:07:21,834 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 22:07:21,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 22:07:21,839 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 22:07:21,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 22:07:21,885 INFO L272 AbstractInterpreter]: Visited 22 different actions 25 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-07 22:07:21,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:21,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 22:07:21,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:21,923 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:07:21,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:21,941 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:07:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:21,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:22,599 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:07:22,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:22,905 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:07:22,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:22,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6] total 22 [2018-11-07 22:07:22,926 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:22,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 22:07:22,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 22:07:22,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=207, Unknown=6, NotChecked=198, Total=462 [2018-11-07 22:07:22,928 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 18 states. [2018-11-07 22:07:25,153 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-07 22:07:27,196 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:29,238 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:31,248 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-11-07 22:07:33,265 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:35,290 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:37,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-11-07 22:07:39,315 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-07 22:07:39,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:39,525 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-07 22:07:39,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 22:07:39,526 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-11-07 22:07:39,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:39,528 INFO L225 Difference]: With dead ends: 64 [2018-11-07 22:07:39,528 INFO L226 Difference]: Without dead ends: 59 [2018-11-07 22:07:39,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=14, NotChecked=492, Total=812 [2018-11-07 22:07:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-07 22:07:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-07 22:07:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 22:07:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-11-07 22:07:39,537 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 23 [2018-11-07 22:07:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:39,538 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-11-07 22:07:39,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 22:07:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-07 22:07:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 22:07:39,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:39,539 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:39,540 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:39,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-11-07 22:07:39,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:39,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:07:39,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:39,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:40,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:40,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:40,140 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:40,140 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:40,140 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:07:40,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:40,140 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:07:40,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:07:40,149 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:07:40,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:07:40,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:40,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:40,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:43,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:43,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 44 [2018-11-07 22:07:43,731 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:43,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 22:07:43,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 22:07:43,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:07:43,736 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 23 states. [2018-11-07 22:07:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:44,710 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-07 22:07:44,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 22:07:44,714 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-11-07 22:07:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:44,715 INFO L225 Difference]: With dead ends: 77 [2018-11-07 22:07:44,715 INFO L226 Difference]: Without dead ends: 72 [2018-11-07 22:07:44,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-11-07 22:07:44,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-07 22:07:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-07 22:07:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-07 22:07:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-11-07 22:07:44,723 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 35 [2018-11-07 22:07:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:44,724 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-11-07 22:07:44,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 22:07:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-07 22:07:44,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 22:07:44,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:44,725 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:44,726 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:44,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:44,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1509590180, now seen corresponding path program 2 times [2018-11-07 22:07:44,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:44,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:44,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:44,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:44,727 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:45,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:45,068 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:45,068 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:45,068 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:07:45,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:45,068 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:07:45,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:07:45,082 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:07:57,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 22:07:57,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:57,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:57,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:07:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:57,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:07:57,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 22:07:57,527 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:07:57,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 22:07:57,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 22:07:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:07:57,528 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 8 states. [2018-11-07 22:07:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:07:57,877 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-07 22:07:57,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 22:07:57,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-07 22:07:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:07:57,879 INFO L225 Difference]: With dead ends: 76 [2018-11-07 22:07:57,879 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 22:07:57,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-07 22:07:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 22:07:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 22:07:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 22:07:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-07 22:07:57,885 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-11-07 22:07:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:07:57,886 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-07 22:07:57,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 22:07:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-07 22:07:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 22:07:57,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:07:57,888 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:07:57,888 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:07:57,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:07:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-11-07 22:07:57,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:07:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:57,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:07:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:07:57,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:07:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:07:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:58,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:58,860 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:07:58,860 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:07:58,860 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:07:58,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:07:58,860 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:07:58,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 22:07:58,876 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 22:07:58,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 22:07:58,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:07:58,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:07:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:07:59,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:08:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:08:02,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:08:02,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2018-11-07 22:08:02,724 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:08:02,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-07 22:08:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-07 22:08:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 22:08:02,726 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-11-07 22:08:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:08:03,591 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-07 22:08:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 22:08:03,592 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-07 22:08:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:08:03,593 INFO L225 Difference]: With dead ends: 66 [2018-11-07 22:08:03,593 INFO L226 Difference]: Without dead ends: 61 [2018-11-07 22:08:03,594 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-11-07 22:08:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-07 22:08:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-07 22:08:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 22:08:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-07 22:08:03,601 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-11-07 22:08:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:08:03,601 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-07 22:08:03,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-07 22:08:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-07 22:08:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-07 22:08:03,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:08:03,602 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:08:03,603 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:08:03,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:08:03,603 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-11-07 22:08:03,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:08:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:03,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 22:08:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:03,604 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:08:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:08:05,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:05,266 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:08:05,267 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:08:05,267 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:08:05,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:08:05,267 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:08:05,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:08:05,275 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 22:08:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:05,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:08:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:08:05,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:08:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:08:10,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:08:10,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 84 [2018-11-07 22:08:10,442 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:08:10,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-07 22:08:10,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-07 22:08:10,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 22:08:10,447 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-11-07 22:08:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:08:12,481 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-07 22:08:12,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-07 22:08:12,481 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-11-07 22:08:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:08:12,483 INFO L225 Difference]: With dead ends: 78 [2018-11-07 22:08:12,483 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 22:08:12,486 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1350, Invalid=5622, Unknown=0, NotChecked=0, Total=6972 [2018-11-07 22:08:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 22:08:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-07 22:08:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 22:08:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-07 22:08:12,492 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-11-07 22:08:12,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:08:12,493 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-07 22:08:12,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-07 22:08:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-07 22:08:12,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 22:08:12,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 22:08:12,494 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 22:08:12,494 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 22:08:12,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 22:08:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-11-07 22:08:12,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 22:08:12,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:12,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 22:08:12,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 22:08:12,496 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 22:08:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 22:08:13,218 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-11-07 22:08:13,553 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-11-07 22:08:17,681 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:19,898 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:21,987 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:26,269 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:28,375 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:32,458 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:34,546 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:36,731 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:37,381 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:41,749 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:44,269 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:48,450 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:50,577 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:52,750 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:56,888 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:08:59,027 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:03,163 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:07,308 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:11,457 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:15,597 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:19,904 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:22,340 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:24,490 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:26,656 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:31,136 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:33,315 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:35,495 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-07 22:09:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:09:36,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:09:36,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 22:09:36,284 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 22:09:36,284 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:09:36,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 22:09:36,284 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 22:09:36,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 22:09:36,300 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 22:09:36,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 22:09:36,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 22:09:36,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 22:09:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 22:09:41,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 22:09:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 22:09:51,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 22:09:51,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6] total 108 [2018-11-07 22:09:51,271 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 22:09:51,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-11-07 22:09:51,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-11-07 22:09:51,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=11142, Unknown=0, NotChecked=0, Total=11556 [2018-11-07 22:09:51,278 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 104 states. [2018-11-07 22:09:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 22:09:54,136 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-11-07 22:09:54,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-07 22:09:54,137 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 71 [2018-11-07 22:09:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 22:09:54,137 INFO L225 Difference]: With dead ends: 87 [2018-11-07 22:09:54,137 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 22:09:54,141 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 38 SyntacticMatches, 53 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 98.2s TimeCoverageRelationStatistics Valid=420, Invalid=11352, Unknown=0, NotChecked=0, Total=11772 [2018-11-07 22:09:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 22:09:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 22:09:54,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 22:09:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 22:09:54,142 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-11-07 22:09:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 22:09:54,142 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 22:09:54,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-11-07 22:09:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 22:09:54,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 22:09:54,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 22:09:56,423 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 96 DAG size of output: 49 [2018-11-07 22:10:02,499 WARN L179 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 71 DAG size of output: 29 [2018-11-07 22:10:02,502 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 22:10:02,502 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:10:02,502 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 22:10:02,502 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 22:10:02,502 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 22:10:02,502 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 22:10:02,503 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse2 (+ .cse3 main_~x~0 .cse4)) (.cse1 (= (+ .cse3 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (let ((.cse0 (+ main_~x~0 5))) (and (<= 0 .cse0) (not (= (mod main_~y~0 2) 0)) (<= .cse0 0))) (and (<= 20 main_~x~0) .cse1 (<= main_~x~0 20)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse1) (and (<= .cse2 (+ main_~y~0 100)) .cse1 (<= 100 main_~x~0)) (and (<= .cse2 (+ main_~y~0 40)) .cse1 (<= 40 main_~x~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse1))))) [2018-11-07 22:10:02,503 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,503 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-07 22:10:02,503 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,503 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,503 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,503 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,503 INFO L421 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (or (let ((.cse0 (+ main_~x~0 5))) (and (<= 0 .cse0) (not (= (mod main_~y~0 2) 0)) (<= .cse0 0))) (let ((.cse3 (div main_~y~0 2))) (let ((.cse1 (* 2 .cse3)) (.cse2 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (and (<= main_~y~0 (+ .cse1 .cse2)) (<= (+ .cse1 main_~x~0 .cse2) (+ main_~y~0 100)) (<= 100 main_~x~0))))) [2018-11-07 22:10:02,503 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,503 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,504 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,504 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,504 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-07 22:10:02,504 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-07 22:10:02,504 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-07 22:10:02,504 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-07 22:10:02,504 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 22:10:02,504 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 22:10:02,504 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:10:02,504 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 22:10:02,504 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 22:10:02,505 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 22:10:02,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:10:02 BoogieIcfgContainer [2018-11-07 22:10:02,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 22:10:02,523 INFO L168 Benchmark]: Toolchain (without parser) took 182420.87 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 934.3 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -641.9 MB). Peak memory consumption was 292.4 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:02,524 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:10:02,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.29 ms. Allocated memory is still 1.5 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:10:02,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:10:02,526 INFO L168 Benchmark]: Boogie Preprocessor took 31.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 22:10:02,526 INFO L168 Benchmark]: RCFGBuilder took 537.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:02,527 INFO L168 Benchmark]: TraceAbstraction took 181530.91 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 176.2 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 155.7 MB). Peak memory consumption was 331.8 MB. Max. memory is 7.1 GB. [2018-11-07 22:10:02,532 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.29 ms. Allocated memory is still 1.5 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 38.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 537.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 758.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 181530.91 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 176.2 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 155.7 MB). Peak memory consumption was 331.8 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: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((0 <= x + 5 && !(y % 2 == 0)) && x + 5 <= 0)) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 181.4s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 8.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 245 SDtfs, 27 SDslu, 2177 SDs, 0 SdLazy, 8288 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 801 GetRequests, 378 SyntacticMatches, 66 SemanticMatches, 357 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2553 ImplicationChecksByTransitivity, 148.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 261 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 701 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 12.5s SatisfiabilityAnalysisTime, 133.8s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 921 ConstructedInterpolants, 63 QuantifiedInterpolants, 508703 SizeOfPredicates, 11 NumberOfNonLiveVariables, 901 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 166/868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...