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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 09:26:25,380 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 09:26:25,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 09:26:25,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 09:26:25,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 09:26:25,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 09:26:25,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 09:26:25,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 09:26:25,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 09:26:25,411 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 09:26:25,412 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 09:26:25,412 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 09:26:25,416 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 09:26:25,417 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 09:26:25,419 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 09:26:25,419 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 09:26:25,420 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 09:26:25,422 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 09:26:25,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 09:26:25,432 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 09:26:25,433 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 09:26:25,434 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 09:26:25,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 09:26:25,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 09:26:25,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 09:26:25,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 09:26:25,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 09:26:25,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 09:26:25,444 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 09:26:25,445 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 09:26:25,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 09:26:25,446 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 09:26:25,446 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 09:26:25,446 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 09:26:25,449 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 09:26:25,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 09:26:25,450 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 09:26:25,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 09:26:25,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 09:26:25,477 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 09:26:25,477 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 09:26:25,478 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 09:26:25,478 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 09:26:25,478 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 09:26:25,478 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 09:26:25,478 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 09:26:25,479 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 09:26:25,479 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 09:26:25,479 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 09:26:25,479 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 09:26:25,479 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 09:26:25,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 09:26:25,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 09:26:25,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 09:26:25,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 09:26:25,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 09:26:25,481 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 09:26:25,481 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 09:26:25,481 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 09:26:25,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 09:26:25,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 09:26:25,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 09:26:25,482 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 09:26:25,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 09:26:25,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 09:26:25,483 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 09:26:25,483 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 09:26:25,483 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 09:26:25,483 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 09:26:25,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 09:26:25,484 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 09:26:25,484 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 09:26:25,484 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 09:26:25,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 09:26:25,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 09:26:25,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 09:26:25,571 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 09:26:25,571 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 09:26:25,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c [2018-11-07 09:26:25,644 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf855cce0/0b486b895d45497b93217013681786b3/FLAG22a18a86c [2018-11-07 09:26:26,281 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 09:26:26,282 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label21_true-unreach-call.c [2018-11-07 09:26:26,310 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf855cce0/0b486b895d45497b93217013681786b3/FLAG22a18a86c [2018-11-07 09:26:26,333 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf855cce0/0b486b895d45497b93217013681786b3 [2018-11-07 09:26:26,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 09:26:26,348 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 09:26:26,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 09:26:26,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 09:26:26,353 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 09:26:26,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:26:26" (1/1) ... [2018-11-07 09:26:26,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d6e334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:26, skipping insertion in model container [2018-11-07 09:26:26,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 09:26:26" (1/1) ... [2018-11-07 09:26:26,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 09:26:26,510 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 09:26:27,670 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 09:26:27,674 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 09:26:28,080 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 09:26:28,102 INFO L193 MainTranslator]: Completed translation [2018-11-07 09:26:28,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28 WrapperNode [2018-11-07 09:26:28,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 09:26:28,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 09:26:28,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 09:26:28,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 09:26:28,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (1/1) ... [2018-11-07 09:26:28,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (1/1) ... [2018-11-07 09:26:28,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 09:26:28,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 09:26:28,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 09:26:28,405 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 09:26:28,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (1/1) ... [2018-11-07 09:26:28,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (1/1) ... [2018-11-07 09:26:28,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (1/1) ... [2018-11-07 09:26:28,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (1/1) ... [2018-11-07 09:26:28,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (1/1) ... [2018-11-07 09:26:28,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (1/1) ... [2018-11-07 09:26:28,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (1/1) ... [2018-11-07 09:26:28,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 09:26:28,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 09:26:28,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 09:26:28,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 09:26:28,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (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 09:26:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 09:26:28,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 09:26:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 09:26:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 09:26:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 09:26:28,680 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 09:26:28,680 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 09:26:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 09:26:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 09:26:28,681 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 09:26:28,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 09:26:38,116 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 09:26:38,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:26:38 BoogieIcfgContainer [2018-11-07 09:26:38,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 09:26:38,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 09:26:38,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 09:26:38,122 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 09:26:38,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 09:26:26" (1/3) ... [2018-11-07 09:26:38,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c946a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:26:38, skipping insertion in model container [2018-11-07 09:26:38,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 09:26:28" (2/3) ... [2018-11-07 09:26:38,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c946a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 09:26:38, skipping insertion in model container [2018-11-07 09:26:38,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 09:26:38" (3/3) ... [2018-11-07 09:26:38,126 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label21_true-unreach-call.c [2018-11-07 09:26:38,136 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 09:26:38,146 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 09:26:38,161 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 09:26:38,202 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 09:26:38,202 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 09:26:38,202 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 09:26:38,202 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 09:26:38,203 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 09:26:38,203 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 09:26:38,203 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 09:26:38,203 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 09:26:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-11-07 09:26:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 09:26:38,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:26:38,268 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:26:38,270 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:26:38,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:26:38,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1861558100, now seen corresponding path program 1 times [2018-11-07 09:26:38,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:26:38,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:26:38,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:26:38,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:26:38,332 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:26:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:26:38,849 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 09:26:38,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:26:38,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 09:26:38,852 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:26:38,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:26:38,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:26:38,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:26:38,878 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-11-07 09:26:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:26:46,640 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-11-07 09:26:46,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:26:46,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-07 09:26:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:26:46,690 INFO L225 Difference]: With dead ends: 2166 [2018-11-07 09:26:46,691 INFO L226 Difference]: Without dead ends: 1556 [2018-11-07 09:26:46,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:26:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-11-07 09:26:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-11-07 09:26:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-11-07 09:26:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-11-07 09:26:46,847 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 66 [2018-11-07 09:26:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:26:46,848 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-11-07 09:26:46,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:26:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-11-07 09:26:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 09:26:46,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:26:46,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:26:46,858 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:26:46,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:26:46,858 INFO L82 PathProgramCache]: Analyzing trace with hash -436141222, now seen corresponding path program 1 times [2018-11-07 09:26:46,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:26:46,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:26:46,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:26:46,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:26:46,860 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:26:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:26:47,223 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 09:26:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:26:47,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:26:47,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 09:26:47,380 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:26:47,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 09:26:47,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 09:26:47,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:26:47,383 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-11-07 09:26:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:26:54,228 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-11-07 09:26:54,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 09:26:54,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-11-07 09:26:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:26:54,246 INFO L225 Difference]: With dead ends: 3059 [2018-11-07 09:26:54,246 INFO L226 Difference]: Without dead ends: 1997 [2018-11-07 09:26:54,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:26:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-11-07 09:26:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-11-07 09:26:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-11-07 09:26:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-11-07 09:26:54,319 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 142 [2018-11-07 09:26:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:26:54,319 INFO L480 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-11-07 09:26:54,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 09:26:54,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-11-07 09:26:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-07 09:26:54,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:26:54,324 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:26:54,325 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:26:54,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:26:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1261890222, now seen corresponding path program 1 times [2018-11-07 09:26:54,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:26:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:26:54,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:26:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:26:54,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:26:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:26:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:26:54,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:26:54,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 09:26:54,588 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:26:54,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 09:26:54,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 09:26:54,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:26:54,589 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-11-07 09:26:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:26:58,423 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-11-07 09:26:58,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 09:26:58,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2018-11-07 09:26:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:26:58,451 INFO L225 Difference]: With dead ends: 4880 [2018-11-07 09:26:58,451 INFO L226 Difference]: Without dead ends: 2911 [2018-11-07 09:26:58,460 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:26:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-11-07 09:26:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-11-07 09:26:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-11-07 09:26:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-11-07 09:26:58,563 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 146 [2018-11-07 09:26:58,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:26:58,563 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-11-07 09:26:58,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 09:26:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-11-07 09:26:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-07 09:26:58,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:26:58,568 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:26:58,568 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:26:58,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:26:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1548926097, now seen corresponding path program 1 times [2018-11-07 09:26:58,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:26:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:26:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:26:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:26:58,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:26:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:26:58,818 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 09:26:58,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:26:58,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 09:26:58,818 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:26:58,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:26:58,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:26:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:26:58,820 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-11-07 09:27:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:27:03,212 INFO L93 Difference]: Finished difference Result 5754 states and 7882 transitions. [2018-11-07 09:27:03,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:27:03,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-11-07 09:27:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:27:03,227 INFO L225 Difference]: With dead ends: 5754 [2018-11-07 09:27:03,228 INFO L226 Difference]: Without dead ends: 2880 [2018-11-07 09:27:03,239 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:27:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-11-07 09:27:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2018-11-07 09:27:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-11-07 09:27:03,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3720 transitions. [2018-11-07 09:27:03,302 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3720 transitions. Word has length 176 [2018-11-07 09:27:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:27:03,303 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3720 transitions. [2018-11-07 09:27:03,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:27:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3720 transitions. [2018-11-07 09:27:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-07 09:27:03,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:27:03,307 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:27:03,308 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:27:03,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:27:03,308 INFO L82 PathProgramCache]: Analyzing trace with hash -639298360, now seen corresponding path program 1 times [2018-11-07 09:27:03,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:27:03,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:27:03,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:27:03,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:27:03,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:27:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:27:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-07 09:27:03,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:27:03,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 09:27:03,593 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:27:03,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:27:03,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:27:03,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:27:03,594 INFO L87 Difference]: Start difference. First operand 2880 states and 3720 transitions. Second operand 4 states. [2018-11-07 09:27:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:27:08,876 INFO L93 Difference]: Finished difference Result 11049 states and 14698 transitions. [2018-11-07 09:27:08,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:27:08,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2018-11-07 09:27:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:27:08,924 INFO L225 Difference]: With dead ends: 11049 [2018-11-07 09:27:08,924 INFO L226 Difference]: Without dead ends: 8175 [2018-11-07 09:27:08,937 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:27:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2018-11-07 09:27:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 8171. [2018-11-07 09:27:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8171 states. [2018-11-07 09:27:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 9880 transitions. [2018-11-07 09:27:09,131 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 9880 transitions. Word has length 230 [2018-11-07 09:27:09,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:27:09,132 INFO L480 AbstractCegarLoop]: Abstraction has 8171 states and 9880 transitions. [2018-11-07 09:27:09,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:27:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 9880 transitions. [2018-11-07 09:27:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 09:27:09,139 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:27:09,140 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:27:09,140 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:27:09,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:27:09,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1380574037, now seen corresponding path program 1 times [2018-11-07 09:27:09,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:27:09,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:27:09,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:27:09,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:27:09,142 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:27:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:27:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 118 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 09:27:09,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:27:09,639 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:27:09,640 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-07 09:27:09,642 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1138], [1140], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1231], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 09:27:09,690 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:27:09,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:27:10,417 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 09:27:10,419 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-11-07 09:27:10,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:27:10,466 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 09:27:11,110 INFO L227 lantSequenceWeakener]: Weakened 244 states. On average, predicates are now at 75.79% of their original sizes. [2018-11-07 09:27:11,110 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 09:27:11,362 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-11-07 09:27:11,362 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 09:27:11,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 09:27:11,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-07 09:27:11,366 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:27:11,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 09:27:11,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 09:27:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 09:27:11,368 INFO L87 Difference]: Start difference. First operand 8171 states and 9880 transitions. Second operand 6 states. [2018-11-07 09:29:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:29:12,037 INFO L93 Difference]: Finished difference Result 16772 states and 20222 transitions. [2018-11-07 09:29:12,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 09:29:12,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2018-11-07 09:29:12,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:29:12,070 INFO L225 Difference]: With dead ends: 16772 [2018-11-07 09:29:12,071 INFO L226 Difference]: Without dead ends: 8607 [2018-11-07 09:29:12,089 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 253 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 09:29:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8607 states. [2018-11-07 09:29:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8607 to 8605. [2018-11-07 09:29:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8605 states. [2018-11-07 09:29:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8605 states to 8605 states and 10325 transitions. [2018-11-07 09:29:12,262 INFO L78 Accepts]: Start accepts. Automaton has 8605 states and 10325 transitions. Word has length 253 [2018-11-07 09:29:12,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:29:12,262 INFO L480 AbstractCegarLoop]: Abstraction has 8605 states and 10325 transitions. [2018-11-07 09:29:12,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 09:29:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 8605 states and 10325 transitions. [2018-11-07 09:29:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-11-07 09:29:12,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:29:12,273 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:29:12,274 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:29:12,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:29:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash 757180591, now seen corresponding path program 1 times [2018-11-07 09:29:12,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:29:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:29:12,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:29:12,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:29:12,276 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:29:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:29:12,690 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-07 09:29:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-07 09:29:12,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:29:12,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 09:29:12,735 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:29:12,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:29:12,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:29:12,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:29:12,736 INFO L87 Difference]: Start difference. First operand 8605 states and 10325 transitions. Second operand 4 states. [2018-11-07 09:29:17,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:29:17,742 INFO L93 Difference]: Finished difference Result 22089 states and 27084 transitions. [2018-11-07 09:29:17,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:29:17,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 296 [2018-11-07 09:29:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:29:17,791 INFO L225 Difference]: With dead ends: 22089 [2018-11-07 09:29:17,791 INFO L226 Difference]: Without dead ends: 13924 [2018-11-07 09:29:17,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:29:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13924 states. [2018-11-07 09:29:18,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13924 to 13912. [2018-11-07 09:29:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13912 states. [2018-11-07 09:29:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13912 states to 13912 states and 16479 transitions. [2018-11-07 09:29:18,114 INFO L78 Accepts]: Start accepts. Automaton has 13912 states and 16479 transitions. Word has length 296 [2018-11-07 09:29:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:29:18,115 INFO L480 AbstractCegarLoop]: Abstraction has 13912 states and 16479 transitions. [2018-11-07 09:29:18,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:29:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 13912 states and 16479 transitions. [2018-11-07 09:29:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-11-07 09:29:18,129 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:29:18,130 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:29:18,130 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:29:18,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:29:18,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1570509174, now seen corresponding path program 1 times [2018-11-07 09:29:18,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:29:18,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:29:18,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:29:18,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:29:18,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:29:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:29:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 187 proven. 142 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-07 09:29:18,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:29:18,613 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:29:18,613 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 306 with the following transitions: [2018-11-07 09:29:18,613 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1138], [1140], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 09:29:18,620 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:29:18,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:29:19,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:29:19,907 INFO L272 AbstractInterpreter]: Visited 98 different actions 294 times. Merged at 8 different actions 23 times. Never widened. Found 5 fixpoints after 3 different actions. Largest state had 26 variables. [2018-11-07 09:29:19,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:29:19,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:29:19,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:29:19,918 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 09:29:19,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:29:19,929 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:29:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:29:20,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:29:20,441 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-11-07 09:29:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 272 proven. 2 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-07 09:29:20,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:29:21,530 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-07 09:29:21,655 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-07 09:29:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 187 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 09:29:22,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:29:22,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2018-11-07 09:29:22,927 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:29:22,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 09:29:22,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 09:29:22,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-11-07 09:29:22,929 INFO L87 Difference]: Start difference. First operand 13912 states and 16479 transitions. Second operand 10 states. [2018-11-07 09:29:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:29:38,115 INFO L93 Difference]: Finished difference Result 46796 states and 58518 transitions. [2018-11-07 09:29:38,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 09:29:38,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 305 [2018-11-07 09:29:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:29:38,242 INFO L225 Difference]: With dead ends: 46796 [2018-11-07 09:29:38,243 INFO L226 Difference]: Without dead ends: 33324 [2018-11-07 09:29:38,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 610 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2018-11-07 09:29:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33324 states. [2018-11-07 09:29:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33324 to 33222. [2018-11-07 09:29:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33222 states. [2018-11-07 09:29:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33222 states to 33222 states and 40814 transitions. [2018-11-07 09:29:39,317 INFO L78 Accepts]: Start accepts. Automaton has 33222 states and 40814 transitions. Word has length 305 [2018-11-07 09:29:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:29:39,317 INFO L480 AbstractCegarLoop]: Abstraction has 33222 states and 40814 transitions. [2018-11-07 09:29:39,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 09:29:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 33222 states and 40814 transitions. [2018-11-07 09:29:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-07 09:29:39,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:29:39,332 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:29:39,332 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:29:39,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:29:39,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1860730581, now seen corresponding path program 1 times [2018-11-07 09:29:39,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:29:39,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:29:39,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:29:39,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:29:39,334 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:29:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:29:39,781 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-11-07 09:29:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-11-07 09:29:39,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:29:39,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 09:29:39,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:29:39,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 09:29:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 09:29:39,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:29:39,863 INFO L87 Difference]: Start difference. First operand 33222 states and 40814 transitions. Second operand 4 states. [2018-11-07 09:29:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:29:51,331 INFO L93 Difference]: Finished difference Result 86751 states and 109963 transitions. [2018-11-07 09:29:51,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 09:29:51,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2018-11-07 09:29:51,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:29:51,546 INFO L225 Difference]: With dead ends: 86751 [2018-11-07 09:29:51,547 INFO L226 Difference]: Without dead ends: 53969 [2018-11-07 09:29:51,649 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 09:29:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53969 states. [2018-11-07 09:29:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53969 to 47790. [2018-11-07 09:29:52,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47790 states. [2018-11-07 09:29:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47790 states to 47790 states and 57287 transitions. [2018-11-07 09:29:52,637 INFO L78 Accepts]: Start accepts. Automaton has 47790 states and 57287 transitions. Word has length 328 [2018-11-07 09:29:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:29:52,638 INFO L480 AbstractCegarLoop]: Abstraction has 47790 states and 57287 transitions. [2018-11-07 09:29:52,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 09:29:52,638 INFO L276 IsEmpty]: Start isEmpty. Operand 47790 states and 57287 transitions. [2018-11-07 09:29:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-11-07 09:29:52,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:29:52,679 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:29:52,679 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:29:52,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:29:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1332328749, now seen corresponding path program 1 times [2018-11-07 09:29:52,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:29:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:29:52,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:29:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:29:52,681 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:29:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:29:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 465 proven. 2 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-07 09:29:53,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:29:53,132 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 09:29:53,132 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 403 with the following transitions: [2018-11-07 09:29:53,133 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1138], [1140], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-07 09:29:53,137 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 09:29:53,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 09:29:54,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 09:29:54,358 INFO L272 AbstractInterpreter]: Visited 120 different actions 346 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-07 09:29:54,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:29:54,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 09:29:54,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 09:29:54,397 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 09:29:54,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:29:54,410 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 09:29:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:29:54,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 09:29:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 490 proven. 2 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-07 09:29:55,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 09:29:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 319 proven. 147 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-11-07 09:29:55,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 09:29:55,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-07 09:29:55,675 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 09:29:55,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 09:29:55,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 09:29:55,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 09:29:55,676 INFO L87 Difference]: Start difference. First operand 47790 states and 57287 transitions. Second operand 8 states. [2018-11-07 09:30:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:30:06,619 INFO L93 Difference]: Finished difference Result 135538 states and 163125 transitions. [2018-11-07 09:30:06,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 09:30:06,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 402 [2018-11-07 09:30:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:30:06,810 INFO L225 Difference]: With dead ends: 135538 [2018-11-07 09:30:06,810 INFO L226 Difference]: Without dead ends: 55890 [2018-11-07 09:30:07,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 821 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 09:30:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55890 states. [2018-11-07 09:30:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55890 to 51546. [2018-11-07 09:30:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51546 states. [2018-11-07 09:30:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51546 states to 51546 states and 59643 transitions. [2018-11-07 09:30:08,280 INFO L78 Accepts]: Start accepts. Automaton has 51546 states and 59643 transitions. Word has length 402 [2018-11-07 09:30:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 09:30:08,281 INFO L480 AbstractCegarLoop]: Abstraction has 51546 states and 59643 transitions. [2018-11-07 09:30:08,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 09:30:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 51546 states and 59643 transitions. [2018-11-07 09:30:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-11-07 09:30:08,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 09:30:08,305 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 09:30:08,306 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 09:30:08,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 09:30:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash -391628634, now seen corresponding path program 1 times [2018-11-07 09:30:08,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 09:30:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:30:08,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 09:30:08,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 09:30:08,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 09:30:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 09:30:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2018-11-07 09:30:08,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 09:30:08,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 09:30:08,716 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 09:30:08,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 09:30:08,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 09:30:08,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:30:08,718 INFO L87 Difference]: Start difference. First operand 51546 states and 59643 transitions. Second operand 3 states. [2018-11-07 09:30:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 09:30:12,234 INFO L93 Difference]: Finished difference Result 124848 states and 146066 transitions. [2018-11-07 09:30:12,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 09:30:12,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2018-11-07 09:30:12,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 09:30:12,391 INFO L225 Difference]: With dead ends: 124848 [2018-11-07 09:30:12,392 INFO L226 Difference]: Without dead ends: 72858 [2018-11-07 09:30:12,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 09:30:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72858 states. Received shutdown request... [2018-11-07 09:30:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72858 to 67641. [2018-11-07 09:30:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67641 states. [2018-11-07 09:30:13,372 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 09:30:13,377 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 09:30:13,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 09:30:13 BoogieIcfgContainer [2018-11-07 09:30:13,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 09:30:13,378 INFO L168 Benchmark]: Toolchain (without parser) took 227032.31 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -239.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-07 09:30:13,379 INFO L168 Benchmark]: CDTParser took 0.19 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 09:30:13,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1755.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-07 09:30:13,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 299.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -935.2 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. [2018-11-07 09:30:13,382 INFO L168 Benchmark]: Boogie Preprocessor took 208.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-11-07 09:30:13,383 INFO L168 Benchmark]: RCFGBuilder took 9504.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 462.3 MB). Peak memory consumption was 462.3 MB. Max. memory is 7.1 GB. [2018-11-07 09:30:13,383 INFO L168 Benchmark]: TraceAbstraction took 215259.06 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 81.5 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-07 09:30:13,388 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.19 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 1755.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 299.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -935.2 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 208.45 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 9504.03 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 462.3 MB). Peak memory consumption was 462.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 215259.06 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 81.5 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 185]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 185). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 215.1s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 196.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5465 SDtfs, 19305 SDslu, 3281 SDs, 0 SdLazy, 35594 SolverSat, 7928 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 161.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1793 GetRequests, 1702 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51546occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.3s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9979577085555349 AbsIntWeakeningRatio, 0.10714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 17.484126984126984 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 11184 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 3512 NumberOfCodeBlocks, 3512 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4204 ConstructedInterpolants, 93 QuantifiedInterpolants, 4093879 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 4329/4907 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown