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.epf -i ../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:55:01,642 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:55:01,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:55:01,660 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:55:01,660 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:55:01,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:55:01,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:55:01,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:55:01,667 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:55:01,668 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:55:01,669 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:55:01,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:55:01,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:55:01,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:55:01,673 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:55:01,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:55:01,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:55:01,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:55:01,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:55:01,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:55:01,681 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:55:01,685 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:55:01,688 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:55:01,688 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:55:01,688 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:55:01,692 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:55:01,693 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:55:01,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:55:01,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:55:01,697 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:55:01,697 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:55:01,698 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:55:01,698 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:55:01,698 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:55:01,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:55:01,700 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:55:01,703 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:55:01,733 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:55:01,733 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:55:01,735 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:55:01,735 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:55:01,735 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:55:01,735 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:55:01,735 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:55:01,736 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:55:01,736 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:55:01,736 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:55:01,736 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:55:01,736 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:55:01,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:55:01,738 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:55:01,738 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:55:01,738 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:55:01,738 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:55:01,738 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:55:01,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:55:01,740 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:55:01,741 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:55:01,741 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:55:01,741 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:55:01,741 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:55:01,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:55:01,742 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:55:01,742 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:55:01,742 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:55:01,743 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:55:01,743 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:55:01,743 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:55:01,743 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:55:01,743 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:55:01,744 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:55:01,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:55:01,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:55:01,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:55:01,839 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:55:01,839 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:55:01,840 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-07 04:55:01,906 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ecde171/42e913971763443faaa6f30020119f53/FLAG34ba6736f [2018-11-07 04:55:02,310 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:55:02,311 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-11-07 04:55:02,318 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ecde171/42e913971763443faaa6f30020119f53/FLAG34ba6736f [2018-11-07 04:55:02,335 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ecde171/42e913971763443faaa6f30020119f53 [2018-11-07 04:55:02,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:55:02,347 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:55:02,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:55:02,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:55:02,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:55:02,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76dcc596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02, skipping insertion in model container [2018-11-07 04:55:02,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:55:02,397 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:55:02,641 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:55:02,645 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:55:02,694 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:55:02,714 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:55:02,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02 WrapperNode [2018-11-07 04:55:02,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:55:02,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:55:02,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:55:02,716 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:55:02,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:55:02,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:55:02,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:55:02,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:55:02,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (1/1) ... [2018-11-07 04:55:02,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:55:02,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:55:02,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:55:02,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:55:02,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (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 04:55:02,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 04:55:02,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:55:02,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:55:02,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 04:55:02,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:55:02,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:55:02,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:55:02,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:55:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 04:55:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:55:02,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:55:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-07 04:55:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 04:55:03,929 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:55:03,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:55:03 BoogieIcfgContainer [2018-11-07 04:55:03,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:55:03,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:55:03,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:55:03,935 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:55:03,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:55:02" (1/3) ... [2018-11-07 04:55:03,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd932f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:55:03, skipping insertion in model container [2018-11-07 04:55:03,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:02" (2/3) ... [2018-11-07 04:55:03,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd932f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:55:03, skipping insertion in model container [2018-11-07 04:55:03,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:55:03" (3/3) ... [2018-11-07 04:55:03,939 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_true-unreach-call.i [2018-11-07 04:55:03,949 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:55:03,957 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:55:03,975 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:55:04,012 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:55:04,012 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:55:04,013 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:55:04,013 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:55:04,013 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:55:04,013 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:55:04,013 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:55:04,014 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:55:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-11-07 04:55:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-07 04:55:04,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:04,049 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:04,052 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:04,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 858599657, now seen corresponding path program 1 times [2018-11-07 04:55:04,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:04,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,114 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:04,344 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 04:55:04,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:55:04,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:55:04,347 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:04,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:55:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:55:04,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:55:04,376 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 2 states. [2018-11-07 04:55:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:04,419 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2018-11-07 04:55:04,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:55:04,421 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 84 [2018-11-07 04:55:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:04,433 INFO L225 Difference]: With dead ends: 207 [2018-11-07 04:55:04,433 INFO L226 Difference]: Without dead ends: 121 [2018-11-07 04:55:04,438 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 04:55:04,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-07 04:55:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-11-07 04:55:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-07 04:55:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-11-07 04:55:04,497 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 84 [2018-11-07 04:55:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:04,498 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-11-07 04:55:04,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:55:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-11-07 04:55:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 04:55:04,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:04,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:04,509 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:04,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1678531354, now seen corresponding path program 1 times [2018-11-07 04:55:04,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:04,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:04,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,513 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:04,860 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 04:55:04,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:55:04,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 04:55:04,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:04,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 04:55:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 04:55:04,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 04:55:04,864 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 4 states. [2018-11-07 04:55:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:05,117 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-11-07 04:55:05,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:55:05,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-07 04:55:05,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:05,123 INFO L225 Difference]: With dead ends: 207 [2018-11-07 04:55:05,123 INFO L226 Difference]: Without dead ends: 163 [2018-11-07 04:55:05,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:55:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-07 04:55:05,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2018-11-07 04:55:05,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-07 04:55:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-11-07 04:55:05,145 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 87 [2018-11-07 04:55:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:05,146 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-11-07 04:55:05,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 04:55:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-11-07 04:55:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 04:55:05,148 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:05,148 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 04:55:05,149 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:05,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1900720706, now seen corresponding path program 1 times [2018-11-07 04:55:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:05,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:05,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:55:05,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:05,472 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:05,475 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 98 with the following transitions: [2018-11-07 04:55:05,478 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [88], [92], [96], [99], [101], [105], [108], [132], [136], [140], [143], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 04:55:05,545 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:05,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:05,935 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 04:55:05,936 INFO L272 AbstractInterpreter]: Visited 77 different actions 81 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-07 04:55:05,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:05,965 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 04:55:06,728 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 65.08% of their original sizes. [2018-11-07 04:55:06,729 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 04:55:07,583 INFO L415 sIntCurrentIteration]: We unified 96 AI predicates to 96 [2018-11-07 04:55:07,583 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 04:55:07,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 04:55:07,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2018-11-07 04:55:07,587 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:07,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 04:55:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 04:55:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:55:07,588 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 10 states. [2018-11-07 04:55:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:11,497 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2018-11-07 04:55:11,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 04:55:11,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-11-07 04:55:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:11,500 INFO L225 Difference]: With dead ends: 252 [2018-11-07 04:55:11,500 INFO L226 Difference]: Without dead ends: 200 [2018-11-07 04:55:11,501 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:55:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-07 04:55:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 160. [2018-11-07 04:55:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-07 04:55:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2018-11-07 04:55:11,530 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 97 [2018-11-07 04:55:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:11,531 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2018-11-07 04:55:11,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 04:55:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2018-11-07 04:55:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 04:55:11,534 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:11,537 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-07 04:55:11,537 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:11,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:11,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1848574906, now seen corresponding path program 1 times [2018-11-07 04:55:11,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:11,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:11,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:11,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:11,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 04:55:11,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:11,898 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:11,899 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2018-11-07 04:55:11,899 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [85], [86], [88], [92], [96], [99], [101], [105], [108], [132], [136], [140], [143], [145], [146], [147], [148], [149], [150], [151], [152], [164], [166], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 04:55:11,904 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:11,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:12,112 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 04:55:12,112 INFO L272 AbstractInterpreter]: Visited 85 different actions 119 times. Merged at 5 different actions 24 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 2 different actions. Largest state had 36 variables. [2018-11-07 04:55:12,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:12,151 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 04:55:12,577 INFO L227 lantSequenceWeakener]: Weakened 93 states. On average, predicates are now at 40.09% of their original sizes. [2018-11-07 04:55:12,578 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 04:55:14,563 INFO L415 sIntCurrentIteration]: We unified 128 AI predicates to 128 [2018-11-07 04:55:14,564 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 04:55:14,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 04:55:14,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 04:55:14,564 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:14,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 04:55:14,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 04:55:14,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-11-07 04:55:14,565 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 17 states. [2018-11-07 04:55:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:21,701 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2018-11-07 04:55:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 04:55:21,701 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 129 [2018-11-07 04:55:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:21,703 INFO L225 Difference]: With dead ends: 310 [2018-11-07 04:55:21,703 INFO L226 Difference]: Without dead ends: 224 [2018-11-07 04:55:21,704 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:55:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-07 04:55:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 174. [2018-11-07 04:55:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-07 04:55:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 182 transitions. [2018-11-07 04:55:21,741 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 182 transitions. Word has length 129 [2018-11-07 04:55:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:21,741 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 182 transitions. [2018-11-07 04:55:21,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 04:55:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 182 transitions. [2018-11-07 04:55:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 04:55:21,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:21,744 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 04:55:21,745 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:21,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1803741721, now seen corresponding path program 1 times [2018-11-07 04:55:21,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,747 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 04:55:21,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:21,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:21,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-07 04:55:21,919 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [85], [86], [88], [92], [96], [99], [101], [105], [108], [110], [111], [112], [113], [114], [115], [116], [117], [126], [128], [132], [136], [140], [143], [145], [146], [147], [148], [149], [150], [151], [152], [164], [166], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 04:55:21,923 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:21,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:23,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:55:23,655 INFO L272 AbstractInterpreter]: Visited 117 different actions 495 times. Merged at 31 different actions 333 times. Widened at 5 different actions 24 times. Found 14 fixpoints after 6 different actions. Largest state had 42 variables. [2018-11-07 04:55:23,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:23,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:55:23,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:23,661 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 04:55:23,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:23,672 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:23,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 04:55:23,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 04:55:24,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:24,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-11-07 04:55:24,236 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:24,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:55:24,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:55:24,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:55:24,238 INFO L87 Difference]: Start difference. First operand 174 states and 182 transitions. Second operand 9 states. [2018-11-07 04:55:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:25,135 INFO L93 Difference]: Finished difference Result 339 states and 363 transitions. [2018-11-07 04:55:25,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:55:25,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 151 [2018-11-07 04:55:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:25,137 INFO L225 Difference]: With dead ends: 339 [2018-11-07 04:55:25,137 INFO L226 Difference]: Without dead ends: 249 [2018-11-07 04:55:25,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:55:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-07 04:55:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 201. [2018-11-07 04:55:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-07 04:55:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 211 transitions. [2018-11-07 04:55:25,190 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 211 transitions. Word has length 151 [2018-11-07 04:55:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:25,191 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 211 transitions. [2018-11-07 04:55:25,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:55:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 211 transitions. [2018-11-07 04:55:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-07 04:55:25,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:25,194 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:25,194 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:25,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:25,195 INFO L82 PathProgramCache]: Analyzing trace with hash 806102457, now seen corresponding path program 2 times [2018-11-07 04:55:25,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:25,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:25,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-07 04:55:25,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:25,485 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:25,485 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:25,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:25,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:25,486 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 04:55:25,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:25,523 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:55:37,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 04:55:37,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:37,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 04:55:37,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-07 04:55:37,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 04:55:37,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 11 [2018-11-07 04:55:37,788 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:37,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 04:55:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 04:55:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-07 04:55:37,789 INFO L87 Difference]: Start difference. First operand 201 states and 211 transitions. Second operand 4 states. [2018-11-07 04:55:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:37,953 INFO L93 Difference]: Finished difference Result 314 states and 333 transitions. [2018-11-07 04:55:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:55:37,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-11-07 04:55:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:37,955 INFO L225 Difference]: With dead ends: 314 [2018-11-07 04:55:37,955 INFO L226 Difference]: Without dead ends: 244 [2018-11-07 04:55:37,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-07 04:55:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-11-07 04:55:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 205. [2018-11-07 04:55:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-07 04:55:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 215 transitions. [2018-11-07 04:55:37,995 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 215 transitions. Word has length 161 [2018-11-07 04:55:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:37,995 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 215 transitions. [2018-11-07 04:55:37,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 04:55:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 215 transitions. [2018-11-07 04:55:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-07 04:55:37,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:37,998 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 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] [2018-11-07 04:55:37,999 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:37,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1373003367, now seen corresponding path program 3 times [2018-11-07 04:55:37,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:38,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:38,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-07 04:55:38,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:38,222 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:38,222 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:38,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:38,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:38,223 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 04:55:38,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:55:38,231 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:55:38,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:55:38,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:38,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 34 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 04:55:38,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 34 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-07 04:55:38,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:38,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-11-07 04:55:38,538 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:38,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 04:55:38,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 04:55:38,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-07 04:55:38,539 INFO L87 Difference]: Start difference. First operand 205 states and 215 transitions. Second operand 12 states. [2018-11-07 04:55:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:40,516 INFO L93 Difference]: Finished difference Result 711 states and 775 transitions. [2018-11-07 04:55:40,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 04:55:40,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 183 [2018-11-07 04:55:40,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:40,518 INFO L225 Difference]: With dead ends: 711 [2018-11-07 04:55:40,519 INFO L226 Difference]: Without dead ends: 443 [2018-11-07 04:55:40,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 367 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=476, Invalid=1330, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 04:55:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-07 04:55:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 290. [2018-11-07 04:55:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-07 04:55:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 307 transitions. [2018-11-07 04:55:40,569 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 307 transitions. Word has length 183 [2018-11-07 04:55:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:40,569 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 307 transitions. [2018-11-07 04:55:40,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 04:55:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 307 transitions. [2018-11-07 04:55:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 04:55:40,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:40,573 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 04:55:40,573 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:40,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash -231894770, now seen corresponding path program 4 times [2018-11-07 04:55:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:40,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:40,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:41,259 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-07 04:55:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-11-07 04:55:41,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:41,344 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:41,344 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:41,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:41,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:41,345 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 04:55:41,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:41,358 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:41,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2018-11-07 04:55:41,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2018-11-07 04:55:41,761 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 04:55:41,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 15 [2018-11-07 04:55:41,761 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:41,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:55:41,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:55:41,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:55:41,762 INFO L87 Difference]: Start difference. First operand 290 states and 307 transitions. Second operand 6 states. [2018-11-07 04:55:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:41,998 INFO L93 Difference]: Finished difference Result 499 states and 534 transitions. [2018-11-07 04:55:41,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:55:41,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2018-11-07 04:55:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:42,001 INFO L225 Difference]: With dead ends: 499 [2018-11-07 04:55:42,001 INFO L226 Difference]: Without dead ends: 297 [2018-11-07 04:55:42,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:55:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-07 04:55:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2018-11-07 04:55:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-07 04:55:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 300 transitions. [2018-11-07 04:55:42,046 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 300 transitions. Word has length 248 [2018-11-07 04:55:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:42,046 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 300 transitions. [2018-11-07 04:55:42,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:55:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 300 transitions. [2018-11-07 04:55:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-11-07 04:55:42,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:42,050 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:55:42,050 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:42,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:42,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1408715602, now seen corresponding path program 5 times [2018-11-07 04:55:42,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:42,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:42,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:42,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:42,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2018-11-07 04:55:42,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:42,386 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:42,386 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:42,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:42,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:42,387 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 04:55:42,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:42,395 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:56:05,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 04:56:05,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:56:05,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-11-07 04:56:05,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:56:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-11-07 04:56:05,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:05,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2018-11-07 04:56:05,705 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:05,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 04:56:05,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 04:56:05,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:56:05,706 INFO L87 Difference]: Start difference. First operand 285 states and 300 transitions. Second operand 13 states. [2018-11-07 04:56:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:06,155 INFO L93 Difference]: Finished difference Result 575 states and 615 transitions. [2018-11-07 04:56:06,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:56:06,158 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 248 [2018-11-07 04:56:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:06,160 INFO L225 Difference]: With dead ends: 575 [2018-11-07 04:56:06,160 INFO L226 Difference]: Without dead ends: 383 [2018-11-07 04:56:06,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-11-07 04:56:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-11-07 04:56:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 336. [2018-11-07 04:56:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-07 04:56:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 354 transitions. [2018-11-07 04:56:06,220 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 354 transitions. Word has length 248 [2018-11-07 04:56:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:06,220 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 354 transitions. [2018-11-07 04:56:06,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 04:56:06,220 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 354 transitions. [2018-11-07 04:56:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-11-07 04:56:06,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:06,224 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:06,224 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:06,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1277302558, now seen corresponding path program 6 times [2018-11-07 04:56:06,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:06,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:06,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:56:06,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:06,226 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 226 proven. 15 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 04:56:06,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:06,397 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:06,397 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:06,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:06,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:06,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 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 04:56:06,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:56:06,406 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:56:06,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:56:06,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:56:06,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 73 proven. 231 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-11-07 04:56:06,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:56:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 73 proven. 231 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-11-07 04:56:06,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:06,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 16 [2018-11-07 04:56:06,785 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:06,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 04:56:06,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 04:56:06,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:56:06,786 INFO L87 Difference]: Start difference. First operand 336 states and 354 transitions. Second operand 13 states. [2018-11-07 04:56:07,275 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-07 04:56:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:07,741 INFO L93 Difference]: Finished difference Result 679 states and 726 transitions. [2018-11-07 04:56:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:56:07,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 291 [2018-11-07 04:56:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:07,744 INFO L225 Difference]: With dead ends: 679 [2018-11-07 04:56:07,744 INFO L226 Difference]: Without dead ends: 476 [2018-11-07 04:56:07,745 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 569 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:56:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-11-07 04:56:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 411. [2018-11-07 04:56:07,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-11-07 04:56:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 434 transitions. [2018-11-07 04:56:07,804 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 434 transitions. Word has length 291 [2018-11-07 04:56:07,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:07,805 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 434 transitions. [2018-11-07 04:56:07,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 04:56:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 434 transitions. [2018-11-07 04:56:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-07 04:56:07,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:07,807 INFO L375 BasicCegarLoop]: trace histogram [20, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:07,808 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:07,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1982557139, now seen corresponding path program 7 times [2018-11-07 04:56:07,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:07,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:07,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:56:07,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:07,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 462 proven. 39 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2018-11-07 04:56:08,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:08,441 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:08,442 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:08,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:08,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:08,442 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 04:56:08,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:56:08,456 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:56:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:08,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 462 proven. 39 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2018-11-07 04:56:09,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:56:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1495 backedges. 462 proven. 39 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2018-11-07 04:56:09,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:09,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-11-07 04:56:09,472 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:09,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:56:09,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:56:09,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:56:09,473 INFO L87 Difference]: Start difference. First operand 411 states and 434 transitions. Second operand 11 states. [2018-11-07 04:56:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:09,850 INFO L93 Difference]: Finished difference Result 814 states and 870 transitions. [2018-11-07 04:56:09,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:56:09,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 346 [2018-11-07 04:56:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:09,852 INFO L225 Difference]: With dead ends: 814 [2018-11-07 04:56:09,853 INFO L226 Difference]: Without dead ends: 551 [2018-11-07 04:56:09,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:56:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2018-11-07 04:56:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 486. [2018-11-07 04:56:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-07 04:56:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 514 transitions. [2018-11-07 04:56:09,951 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 514 transitions. Word has length 346 [2018-11-07 04:56:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:09,952 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 514 transitions. [2018-11-07 04:56:09,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:56:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 514 transitions. [2018-11-07 04:56:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-11-07 04:56:09,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:09,955 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:09,955 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:09,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1356978562, now seen corresponding path program 8 times [2018-11-07 04:56:09,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:09,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:09,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:56:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:09,957 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 786 proven. 74 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2018-11-07 04:56:10,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:10,378 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:10,378 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:10,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:10,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:10,378 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:56:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:56:10,387 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:56:44,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 04:56:44,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:56:45,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2406 trivial. 0 not checked. [2018-11-07 04:56:45,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:56:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 2406 trivial. 0 not checked. [2018-11-07 04:56:45,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:45,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2018-11-07 04:56:45,528 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:45,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 04:56:45,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 04:56:45,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-11-07 04:56:45,530 INFO L87 Difference]: Start difference. First operand 486 states and 514 transitions. Second operand 13 states. [2018-11-07 04:56:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:46,467 INFO L93 Difference]: Finished difference Result 1093 states and 1172 transitions. [2018-11-07 04:56:46,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-07 04:56:46,467 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 401 [2018-11-07 04:56:46,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:46,471 INFO L225 Difference]: With dead ends: 1093 [2018-11-07 04:56:46,471 INFO L226 Difference]: Without dead ends: 770 [2018-11-07 04:56:46,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=784, Invalid=1472, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 04:56:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-11-07 04:56:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 572. [2018-11-07 04:56:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-11-07 04:56:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 605 transitions. [2018-11-07 04:56:46,567 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 605 transitions. Word has length 401 [2018-11-07 04:56:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:46,568 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 605 transitions. [2018-11-07 04:56:46,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 04:56:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 605 transitions. [2018-11-07 04:56:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-11-07 04:56:46,571 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:46,572 INFO L375 BasicCegarLoop]: trace histogram [30, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:56:46,572 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:46,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:46,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2046913749, now seen corresponding path program 9 times [2018-11-07 04:56:46,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:46,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:46,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:56:46,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:46,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3786 backedges. 1198 proven. 120 refuted. 0 times theorem prover too weak. 2468 trivial. 0 not checked. [2018-11-07 04:56:47,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:47,414 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:47,414 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:47,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:47,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:47,414 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:56:47,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:56:47,423 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:56:47,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:56:47,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:56:47,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:47,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-07 04:56:47,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-07 04:56:47,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:47,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:47,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:47,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-07 04:56:47,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-07 04:56:47,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:47,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-07 04:56:47,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:47,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:47,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:47,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-07 04:56:47,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-07 04:56:48,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,010 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-07 04:56:48,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:48,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:48,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:48,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-07 04:56:48,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-07 04:56:48,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,250 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2018-11-07 04:56:48,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:48,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:48,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:56:48,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:47 [2018-11-07 04:56:48,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2018-11-07 04:56:48,572 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,575 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,602 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,603 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,605 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:48,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 155 [2018-11-07 04:56:48,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:48,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:48,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-07 04:56:48,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:72 [2018-11-07 04:56:55,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2018-11-07 04:56:55,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:55,314 INFO L303 Elim1Store]: Index analysis took 162 ms [2018-11-07 04:56:55,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-11-07 04:56:55,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:55,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:55,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:55,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:79, output treesize:3 [2018-11-07 04:56:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3786 backedges. 13 proven. 43 refuted. 0 times theorem prover too weak. 3730 trivial. 0 not checked. [2018-11-07 04:56:57,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:12,827 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-07 04:57:12,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2018-11-07 04:57:12,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-11-07 04:57:12,893 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 62 [2018-11-07 04:57:12,902 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2018-11-07 04:57:12,927 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,927 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,929 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,929 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,931 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,931 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:12,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 125 [2018-11-07 04:57:13,005 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,020 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,023 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,023 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,024 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,024 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,024 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 79 [2018-11-07 04:57:13,026 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 04:57:13,030 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,030 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,031 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,034 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,034 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,035 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:57:13,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 122 [2018-11-07 04:57:13,065 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 04:57:13,140 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 04:57:13,177 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:57:13,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:57:13,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:57:13,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:57:13,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-07 04:57:13,273 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:66, output treesize:35 [2018-11-07 04:57:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3786 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 3730 trivial. 0 not checked. [2018-11-07 04:57:13,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:13,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 39 [2018-11-07 04:57:13,749 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:13,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 04:57:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 04:57:13,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1247, Unknown=21, NotChecked=0, Total=1482 [2018-11-07 04:57:13,751 INFO L87 Difference]: Start difference. First operand 572 states and 605 transitions. Second operand 25 states. [2018-11-07 04:57:15,555 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 04:57:26,996 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 44 [2018-11-07 04:57:29,187 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-07 04:57:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:34,645 INFO L93 Difference]: Finished difference Result 1687 states and 1811 transitions. [2018-11-07 04:57:34,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 04:57:34,645 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 467 [2018-11-07 04:57:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:34,650 INFO L225 Difference]: With dead ends: 1687 [2018-11-07 04:57:34,651 INFO L226 Difference]: Without dead ends: 1293 [2018-11-07 04:57:34,654 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 988 GetRequests, 904 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=1067, Invalid=6047, Unknown=26, NotChecked=0, Total=7140 [2018-11-07 04:57:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-11-07 04:57:34,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1059. [2018-11-07 04:57:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2018-11-07 04:57:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1133 transitions. [2018-11-07 04:57:34,820 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1133 transitions. Word has length 467 [2018-11-07 04:57:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:34,820 INFO L480 AbstractCegarLoop]: Abstraction has 1059 states and 1133 transitions. [2018-11-07 04:57:34,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-07 04:57:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1133 transitions. [2018-11-07 04:57:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2018-11-07 04:57:34,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:34,825 INFO L375 BasicCegarLoop]: trace histogram [35, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:57:34,826 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:34,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:34,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1191671090, now seen corresponding path program 1 times [2018-11-07 04:57:34,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:34,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:34,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:57:34,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:34,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5321 backedges. 1698 proven. 177 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2018-11-07 04:57:35,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:35,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:35,885 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 527 with the following transitions: [2018-11-07 04:57:35,885 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39], [40], [41], [42], [43], [44], [45], [46], [47], [48], [49], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59], [60], [61], [62], [63], [64], [65], [66], [67], [68], [69], [70], [74], [77], [79], [82], [83], [85], [86], [88], [92], [96], [99], [101], [105], [108], [110], [111], [112], [113], [114], [115], [116], [117], [120], [121], [122], [123], [124], [126], [128], [132], [136], [140], [143], [145], [146], [147], [148], [149], [150], [151], [152], [164], [166], [170], [174], [179], [180], [198], [201], [203], [209], [210], [211], [213] [2018-11-07 04:57:35,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:57:35,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:57:38,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:57:38,003 INFO L272 AbstractInterpreter]: Visited 122 different actions 575 times. Merged at 35 different actions 393 times. Widened at 5 different actions 24 times. Found 30 fixpoints after 7 different actions. Largest state had 44 variables. [2018-11-07 04:57:38,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:38,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:57:38,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:38,043 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:38,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:38,056 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:57:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:38,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:57:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5321 backedges. 1698 proven. 177 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2018-11-07 04:57:39,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:57:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5321 backedges. 1698 proven. 177 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2018-11-07 04:57:39,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:57:39,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-11-07 04:57:39,934 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:57:39,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 04:57:39,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 04:57:39,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-11-07 04:57:39,936 INFO L87 Difference]: Start difference. First operand 1059 states and 1133 transitions. Second operand 17 states. [2018-11-07 04:57:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:57:40,322 INFO L93 Difference]: Finished difference Result 2107 states and 2271 transitions. [2018-11-07 04:57:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 04:57:40,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 526 [2018-11-07 04:57:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:57:40,331 INFO L225 Difference]: With dead ends: 2107 [2018-11-07 04:57:40,331 INFO L226 Difference]: Without dead ends: 1299 [2018-11-07 04:57:40,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 1038 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-11-07 04:57:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2018-11-07 04:57:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1189. [2018-11-07 04:57:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1189 states. [2018-11-07 04:57:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1273 transitions. [2018-11-07 04:57:40,554 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1273 transitions. Word has length 526 [2018-11-07 04:57:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:57:40,554 INFO L480 AbstractCegarLoop]: Abstraction has 1189 states and 1273 transitions. [2018-11-07 04:57:40,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 04:57:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1273 transitions. [2018-11-07 04:57:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-11-07 04:57:40,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:57:40,560 INFO L375 BasicCegarLoop]: trace histogram [40, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:57:40,561 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:57:40,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:57:40,561 INFO L82 PathProgramCache]: Analyzing trace with hash -246267023, now seen corresponding path program 2 times [2018-11-07 04:57:40,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:57:40,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:40,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:57:40,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:57:40,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:57:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:57:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7131 backedges. 2286 proven. 245 refuted. 0 times theorem prover too weak. 4600 trivial. 0 not checked. [2018-11-07 04:57:41,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:41,020 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:57:41,021 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:57:41,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:57:41,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:57:41,021 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:57:41,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:57:41,034 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:58:07,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 04:58:07,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:07,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7131 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7011 trivial. 0 not checked. [2018-11-07 04:58:08,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7131 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7011 trivial. 0 not checked. [2018-11-07 04:58:08,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:08,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2018-11-07 04:58:08,514 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:08,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 04:58:08,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 04:58:08,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-11-07 04:58:08,515 INFO L87 Difference]: Start difference. First operand 1189 states and 1273 transitions. Second operand 17 states. [2018-11-07 04:58:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:11,297 INFO L93 Difference]: Finished difference Result 2904 states and 3141 transitions. [2018-11-07 04:58:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-07 04:58:11,297 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 581 [2018-11-07 04:58:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:11,305 INFO L225 Difference]: With dead ends: 2904 [2018-11-07 04:58:11,305 INFO L226 Difference]: Without dead ends: 1992 [2018-11-07 04:58:11,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1227 GetRequests, 1150 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1720 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2020, Invalid=4142, Unknown=0, NotChecked=0, Total=6162 [2018-11-07 04:58:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2018-11-07 04:58:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1341. [2018-11-07 04:58:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-11-07 04:58:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1435 transitions. [2018-11-07 04:58:11,570 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1435 transitions. Word has length 581 [2018-11-07 04:58:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:11,570 INFO L480 AbstractCegarLoop]: Abstraction has 1341 states and 1435 transitions. [2018-11-07 04:58:11,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 04:58:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1435 transitions. [2018-11-07 04:58:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2018-11-07 04:58:11,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:11,578 INFO L375 BasicCegarLoop]: trace histogram [45, 40, 40, 40, 40, 40, 40, 40, 40, 40, 39, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:11,578 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:11,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2045783814, now seen corresponding path program 3 times [2018-11-07 04:58:11,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:11,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:11,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:11,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:11,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 2962 proven. 324 refuted. 0 times theorem prover too weak. 5987 trivial. 0 not checked. [2018-11-07 04:58:12,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:12,251 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:12,251 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:12,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:12,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:12,251 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:12,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:58:12,262 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:58:12,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:58:12,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:58:12,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 255 proven. 2848 refuted. 0 times theorem prover too weak. 6170 trivial. 0 not checked. [2018-11-07 04:58:13,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9273 backedges. 255 proven. 2848 refuted. 0 times theorem prover too weak. 6170 trivial. 0 not checked. [2018-11-07 04:58:13,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:13,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 37 [2018-11-07 04:58:13,691 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:13,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 04:58:13,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 04:58:13,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1091, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 04:58:13,694 INFO L87 Difference]: Start difference. First operand 1341 states and 1435 transitions. Second operand 28 states. [2018-11-07 04:58:17,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:17,464 INFO L93 Difference]: Finished difference Result 3514 states and 3801 transitions. [2018-11-07 04:58:17,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-11-07 04:58:17,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 647 [2018-11-07 04:58:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:17,475 INFO L225 Difference]: With dead ends: 3514 [2018-11-07 04:58:17,476 INFO L226 Difference]: Without dead ends: 2476 [2018-11-07 04:58:17,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1398 GetRequests, 1270 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4503 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3045, Invalid=11961, Unknown=0, NotChecked=0, Total=15006 [2018-11-07 04:58:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2018-11-07 04:58:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 1493. [2018-11-07 04:58:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2018-11-07 04:58:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1597 transitions. [2018-11-07 04:58:17,704 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1597 transitions. Word has length 647 [2018-11-07 04:58:17,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:17,704 INFO L480 AbstractCegarLoop]: Abstraction has 1493 states and 1597 transitions. [2018-11-07 04:58:17,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 04:58:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1597 transitions. [2018-11-07 04:58:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2018-11-07 04:58:17,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:17,712 INFO L375 BasicCegarLoop]: trace histogram [50, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:17,712 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:17,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:17,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1264013551, now seen corresponding path program 4 times [2018-11-07 04:58:17,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:17,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:17,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:58:17,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:17,713 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11701 backedges. 3726 proven. 414 refuted. 0 times theorem prover too weak. 7561 trivial. 0 not checked. [2018-11-07 04:58:19,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:19,310 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:19,310 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:19,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:19,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:19,310 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:19,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:19,327 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:58:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:19,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:58:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11701 backedges. 3726 proven. 414 refuted. 0 times theorem prover too weak. 7561 trivial. 0 not checked. [2018-11-07 04:58:20,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:58:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 11701 backedges. 3726 proven. 414 refuted. 0 times theorem prover too weak. 7561 trivial. 0 not checked. [2018-11-07 04:58:20,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:58:20,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2018-11-07 04:58:20,667 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:58:20,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-07 04:58:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-07 04:58:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 04:58:20,669 INFO L87 Difference]: Start difference. First operand 1493 states and 1597 transitions. Second operand 23 states. [2018-11-07 04:58:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:58:21,094 INFO L93 Difference]: Finished difference Result 2897 states and 3115 transitions. [2018-11-07 04:58:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 04:58:21,094 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 713 [2018-11-07 04:58:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:58:21,100 INFO L225 Difference]: With dead ends: 2897 [2018-11-07 04:58:21,100 INFO L226 Difference]: Without dead ends: 1733 [2018-11-07 04:58:21,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1438 GetRequests, 1406 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 04:58:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2018-11-07 04:58:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1623. [2018-11-07 04:58:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2018-11-07 04:58:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 1737 transitions. [2018-11-07 04:58:21,342 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 1737 transitions. Word has length 713 [2018-11-07 04:58:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:58:21,343 INFO L480 AbstractCegarLoop]: Abstraction has 1623 states and 1737 transitions. [2018-11-07 04:58:21,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-07 04:58:21,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 1737 transitions. [2018-11-07 04:58:21,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2018-11-07 04:58:21,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:58:21,351 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 50, 50, 50, 50, 50, 50, 50, 50, 49, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:21,352 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:58:21,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:58:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1392871054, now seen corresponding path program 5 times [2018-11-07 04:58:21,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:58:21,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:21,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:58:21,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:58:21,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:58:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:58:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 14336 backedges. 4578 proven. 515 refuted. 0 times theorem prover too weak. 9243 trivial. 0 not checked. [2018-11-07 04:58:22,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:22,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:58:22,160 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:58:22,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:58:22,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:58:22,160 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:58:22,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:58:22,168 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:59:03,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 04:59:03,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:03,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14336 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 14091 trivial. 0 not checked. [2018-11-07 04:59:04,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 14336 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 14091 trivial. 0 not checked. [2018-11-07 04:59:04,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:04,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 31 [2018-11-07 04:59:04,806 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:04,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 04:59:04,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 04:59:04,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=677, Unknown=0, NotChecked=0, Total=930 [2018-11-07 04:59:04,808 INFO L87 Difference]: Start difference. First operand 1623 states and 1737 transitions. Second operand 22 states. [2018-11-07 04:59:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:59:09,503 INFO L93 Difference]: Finished difference Result 4514 states and 4881 transitions. [2018-11-07 04:59:09,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-11-07 04:59:09,503 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 768 [2018-11-07 04:59:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:59:09,514 INFO L225 Difference]: With dead ends: 4514 [2018-11-07 04:59:09,514 INFO L226 Difference]: Without dead ends: 3246 [2018-11-07 04:59:09,521 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1647 GetRequests, 1520 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5179 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5191, Invalid=11321, Unknown=0, NotChecked=0, Total=16512 [2018-11-07 04:59:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2018-11-07 04:59:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 1775. [2018-11-07 04:59:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2018-11-07 04:59:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 1899 transitions. [2018-11-07 04:59:09,848 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 1899 transitions. Word has length 768 [2018-11-07 04:59:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:59:09,849 INFO L480 AbstractCegarLoop]: Abstraction has 1775 states and 1899 transitions. [2018-11-07 04:59:09,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 04:59:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 1899 transitions. [2018-11-07 04:59:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2018-11-07 04:59:09,858 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:59:09,859 INFO L375 BasicCegarLoop]: trace histogram [60, 55, 55, 55, 55, 55, 55, 55, 55, 55, 54, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:09,859 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:59:09,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:59:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash 393265943, now seen corresponding path program 6 times [2018-11-07 04:59:09,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:59:09,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:09,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:59:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:59:09,861 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:59:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:59:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17325 backedges. 5518 proven. 627 refuted. 0 times theorem prover too weak. 11180 trivial. 0 not checked. [2018-11-07 04:59:10,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:10,873 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:59:10,873 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:59:10,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:59:10,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:59:10,873 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:59:10,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:59:10,882 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:59:11,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:59:11,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:59:11,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:59:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 17325 backedges. 525 proven. 5452 refuted. 0 times theorem prover too weak. 11348 trivial. 0 not checked. [2018-11-07 04:59:12,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:59:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17325 backedges. 525 proven. 5452 refuted. 0 times theorem prover too weak. 11348 trivial. 0 not checked. [2018-11-07 04:59:13,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:59:13,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 23] total 48 [2018-11-07 04:59:13,757 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:59:13,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 04:59:13,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 04:59:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1860, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 04:59:13,759 INFO L87 Difference]: Start difference. First operand 1775 states and 1899 transitions. Second operand 36 states. Received shutdown request... [2018-11-07 04:59:16,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-11-07 04:59:16,533 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 04:59:16,536 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 04:59:16,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:59:16 BoogieIcfgContainer [2018-11-07 04:59:16,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 04:59:16,537 INFO L168 Benchmark]: Toolchain (without parser) took 254191.30 ms. Allocated memory was 1.6 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 726.9 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:16,538 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:59:16,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.01 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:16,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.07 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:59:16,539 INFO L168 Benchmark]: Boogie Preprocessor took 43.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:59:16,540 INFO L168 Benchmark]: RCFGBuilder took 1129.73 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 764.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:16,540 INFO L168 Benchmark]: TraceAbstraction took 252605.19 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.2 GB in the beginning and 3.2 GB in the end (delta: -964.2 MB). Peak memory consumption was 733.5 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:16,544 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.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 368.01 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.07 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1129.73 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 764.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 252605.19 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.2 GB in the beginning and 3.2 GB in the end (delta: -964.2 MB). Peak memory consumption was 733.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (1775states) and FLOYD_HOARE automaton (currently 71 states, 36 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 116 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. TIMEOUT Result, 252.5s OverallTime, 19 OverallIterations, 60 TraceHistogramMax, 53.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2244 SDtfs, 24716 SDslu, 13407 SDs, 0 SdLazy, 5862 SolverSat, 1779 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 13933 GetRequests, 13126 SyntacticMatches, 26 SemanticMatches, 780 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19132 ImplicationChecksByTransitivity, 61.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1775occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.6s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9929067460317463 AbsIntWeakeningRatio, 0.32589285714285715 AbsIntAvgWeakeningVarsNumRemoved, 145.96875 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 4314 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 138.8s SatisfiabilityAnalysisTime, 46.1s InterpolantComputationTime, 13527 NumberOfCodeBlocks, 12159 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 20043 ConstructedInterpolants, 393 QuantifiedInterpolants, 40976130 SizeOfPredicates, 53 NumberOfNonLiveVariables, 8879 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 49 InterpolantComputations, 5 PerfectInterpolantSequences, 202526/224661 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown