java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:01:55,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:01:55,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:01:55,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:01:55,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:01:55,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:01:55,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:01:55,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:01:55,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:01:55,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:01:55,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:01:55,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:01:55,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:01:55,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:01:55,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:01:55,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:01:55,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:01:55,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:01:55,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:01:55,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:01:55,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:01:55,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:01:55,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:01:55,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:01:55,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:01:55,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:01:55,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:01:55,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:01:55,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:01:55,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:01:55,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:01:55,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:01:55,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:01:55,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:01:55,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:01:55,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:01:55,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:01:55,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:01:55,694 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:01:55,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:01:55,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:01:55,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 03:01:55,733 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:01:55,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:01:55,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:01:55,739 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:01:55,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:01:55,743 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:01:55,743 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:01:55,743 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:01:55,743 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:01:55,744 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:01:55,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:01:55,745 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:01:55,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:01:55,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:01:55,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:01:55,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:01:55,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:01:55,747 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:01:55,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:01:55,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:01:55,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:01:55,748 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:01:55,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:01:55,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:01:55,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:01:55,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:01:55,749 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:01:55,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:01:55,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:01:55,750 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:01:55,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:01:55,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:01:55,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:01:55,838 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:01:55,841 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:01:55,843 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-03 03:01:55,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b1c490fa/431d960b64c641a4b547ffd2e16d1eb0/FLAGedcdf3384 [2019-10-03 03:01:56,615 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:01:56,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-03 03:01:56,647 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b1c490fa/431d960b64c641a4b547ffd2e16d1eb0/FLAGedcdf3384 [2019-10-03 03:01:56,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b1c490fa/431d960b64c641a4b547ffd2e16d1eb0 [2019-10-03 03:01:56,776 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:01:56,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:01:56,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:01:56,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:01:56,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:01:56,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:56" (1/1) ... [2019-10-03 03:01:56,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa2e4a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:56, skipping insertion in model container [2019-10-03 03:01:56,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:01:56" (1/1) ... [2019-10-03 03:01:56,801 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:01:56,960 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:01:57,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:01:58,021 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:01:58,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:01:58,336 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:01:58,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58 WrapperNode [2019-10-03 03:01:58,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:01:58,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:01:58,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:01:58,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:01:58,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (1/1) ... [2019-10-03 03:01:58,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:01:58,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:01:58,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:01:58,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:01:58,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (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 [2019-10-03 03:01:58,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:01:58,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:01:58,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:01:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:01:58,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:01:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:01:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-03 03:01:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:01:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:01:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:01:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:01:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-03 03:01:58,704 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-03 03:01:58,705 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-03 03:01:58,705 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:01:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:01:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:01:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:01:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:02:02,351 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:02:02,353 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 03:02:02,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:02:02 BoogieIcfgContainer [2019-10-03 03:02:02,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:02:02,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:02:02,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:02:02,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:02:02,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:01:56" (1/3) ... [2019-10-03 03:02:02,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126d666d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:02:02, skipping insertion in model container [2019-10-03 03:02:02,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:01:58" (2/3) ... [2019-10-03 03:02:02,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@126d666d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:02:02, skipping insertion in model container [2019-10-03 03:02:02,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:02:02" (3/3) ... [2019-10-03 03:02:02,368 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-03 03:02:02,379 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:02:02,392 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-03 03:02:02,413 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-03 03:02:02,451 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:02:02,452 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:02:02,452 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:02:02,452 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:02:02,452 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:02:02,452 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:02:02,452 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:02:02,453 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:02:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states. [2019-10-03 03:02:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:02:02,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:02,548 INFO L411 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] [2019-10-03 03:02:02,553 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:02,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2082146872, now seen corresponding path program 1 times [2019-10-03 03:02:02,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:02,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:02,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:02,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:02,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:03,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:03,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:03,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:03,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:03,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:03,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:03,164 INFO L87 Difference]: Start difference. First operand 1126 states. Second operand 6 states. [2019-10-03 03:02:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:05,065 INFO L93 Difference]: Finished difference Result 1441 states and 2485 transitions. [2019-10-03 03:02:05,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:05,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-03 03:02:05,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:05,094 INFO L225 Difference]: With dead ends: 1441 [2019-10-03 03:02:05,094 INFO L226 Difference]: Without dead ends: 1429 [2019-10-03 03:02:05,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2019-10-03 03:02:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1413. [2019-10-03 03:02:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-10-03 03:02:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1913 transitions. [2019-10-03 03:02:05,229 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1913 transitions. Word has length 55 [2019-10-03 03:02:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:05,229 INFO L475 AbstractCegarLoop]: Abstraction has 1413 states and 1913 transitions. [2019-10-03 03:02:05,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1913 transitions. [2019-10-03 03:02:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:02:05,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:05,239 INFO L411 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] [2019-10-03 03:02:05,239 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash 995005511, now seen corresponding path program 1 times [2019-10-03 03:02:05,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:05,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:05,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:05,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:05,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:05,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:05,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:05,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:05,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:05,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:05,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:05,440 INFO L87 Difference]: Start difference. First operand 1413 states and 1913 transitions. Second operand 6 states. [2019-10-03 03:02:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:06,743 INFO L93 Difference]: Finished difference Result 2341 states and 3221 transitions. [2019-10-03 03:02:06,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:06,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-03 03:02:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:06,756 INFO L225 Difference]: With dead ends: 2341 [2019-10-03 03:02:06,757 INFO L226 Difference]: Without dead ends: 2341 [2019-10-03 03:02:06,758 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2019-10-03 03:02:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2321. [2019-10-03 03:02:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-10-03 03:02:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3206 transitions. [2019-10-03 03:02:06,828 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3206 transitions. Word has length 55 [2019-10-03 03:02:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:06,829 INFO L475 AbstractCegarLoop]: Abstraction has 2321 states and 3206 transitions. [2019-10-03 03:02:06,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3206 transitions. [2019-10-03 03:02:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:02:06,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:06,839 INFO L411 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] [2019-10-03 03:02:06,840 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1195094756, now seen corresponding path program 1 times [2019-10-03 03:02:06,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:06,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:06,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:06,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:07,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:07,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:07,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:07,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:07,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:07,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:07,050 INFO L87 Difference]: Start difference. First operand 2321 states and 3206 transitions. Second operand 5 states. [2019-10-03 03:02:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:08,235 INFO L93 Difference]: Finished difference Result 3583 states and 4932 transitions. [2019-10-03 03:02:08,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:02:08,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-03 03:02:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:08,254 INFO L225 Difference]: With dead ends: 3583 [2019-10-03 03:02:08,254 INFO L226 Difference]: Without dead ends: 3583 [2019-10-03 03:02:08,255 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:02:08,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2019-10-03 03:02:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3577. [2019-10-03 03:02:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-03 03:02:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4928 transitions. [2019-10-03 03:02:08,351 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4928 transitions. Word has length 55 [2019-10-03 03:02:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:08,351 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4928 transitions. [2019-10-03 03:02:08,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4928 transitions. [2019-10-03 03:02:08,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:02:08,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:08,357 INFO L411 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] [2019-10-03 03:02:08,357 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash 103967417, now seen corresponding path program 1 times [2019-10-03 03:02:08,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:08,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:08,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:08,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:08,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:08,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:08,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:08,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:08,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:08,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:08,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:08,670 INFO L87 Difference]: Start difference. First operand 3577 states and 4928 transitions. Second operand 9 states. [2019-10-03 03:02:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:11,843 INFO L93 Difference]: Finished difference Result 7795 states and 11350 transitions. [2019-10-03 03:02:11,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-03 03:02:11,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-03 03:02:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:11,880 INFO L225 Difference]: With dead ends: 7795 [2019-10-03 03:02:11,881 INFO L226 Difference]: Without dead ends: 7795 [2019-10-03 03:02:11,882 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-03 03:02:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7795 states. [2019-10-03 03:02:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7795 to 3577. [2019-10-03 03:02:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-03 03:02:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4927 transitions. [2019-10-03 03:02:12,003 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4927 transitions. Word has length 56 [2019-10-03 03:02:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:12,004 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4927 transitions. [2019-10-03 03:02:12,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4927 transitions. [2019-10-03 03:02:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:02:12,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:12,009 INFO L411 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] [2019-10-03 03:02:12,010 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:12,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:12,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1702566800, now seen corresponding path program 1 times [2019-10-03 03:02:12,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:12,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:12,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:12,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:12,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:12,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:12,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:02:12,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:12,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:02:12,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:02:12,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:12,242 INFO L87 Difference]: Start difference. First operand 3577 states and 4927 transitions. Second operand 9 states. [2019-10-03 03:02:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:15,282 INFO L93 Difference]: Finished difference Result 8656 states and 12483 transitions. [2019-10-03 03:02:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 03:02:15,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-03 03:02:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:15,323 INFO L225 Difference]: With dead ends: 8656 [2019-10-03 03:02:15,323 INFO L226 Difference]: Without dead ends: 8656 [2019-10-03 03:02:15,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-03 03:02:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2019-10-03 03:02:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 3577. [2019-10-03 03:02:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-03 03:02:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4926 transitions. [2019-10-03 03:02:15,454 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4926 transitions. Word has length 56 [2019-10-03 03:02:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:15,455 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4926 transitions. [2019-10-03 03:02:15,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:02:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4926 transitions. [2019-10-03 03:02:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:02:15,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:15,459 INFO L411 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] [2019-10-03 03:02:15,459 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1133124815, now seen corresponding path program 1 times [2019-10-03 03:02:15,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:15,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:15,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:15,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:15,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:15,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:15,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:15,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:02:15,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:15,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:02:15,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:02:15,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:02:15,641 INFO L87 Difference]: Start difference. First operand 3577 states and 4926 transitions. Second operand 8 states. [2019-10-03 03:02:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:17,986 INFO L93 Difference]: Finished difference Result 7101 states and 10414 transitions. [2019-10-03 03:02:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 03:02:17,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-03 03:02:17,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:18,010 INFO L225 Difference]: With dead ends: 7101 [2019-10-03 03:02:18,011 INFO L226 Difference]: Without dead ends: 7101 [2019-10-03 03:02:18,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-03 03:02:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7101 states. [2019-10-03 03:02:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7101 to 3577. [2019-10-03 03:02:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-03 03:02:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4925 transitions. [2019-10-03 03:02:18,092 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4925 transitions. Word has length 56 [2019-10-03 03:02:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:18,092 INFO L475 AbstractCegarLoop]: Abstraction has 3577 states and 4925 transitions. [2019-10-03 03:02:18,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:02:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4925 transitions. [2019-10-03 03:02:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:18,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:18,097 INFO L411 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] [2019-10-03 03:02:18,097 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash 609358766, now seen corresponding path program 1 times [2019-10-03 03:02:18,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:18,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:18,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:18,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:18,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:18,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:18,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:18,164 INFO L87 Difference]: Start difference. First operand 3577 states and 4925 transitions. Second operand 3 states. [2019-10-03 03:02:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:18,238 INFO L93 Difference]: Finished difference Result 3990 states and 5575 transitions. [2019-10-03 03:02:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:18,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-03 03:02:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:18,252 INFO L225 Difference]: With dead ends: 3990 [2019-10-03 03:02:18,253 INFO L226 Difference]: Without dead ends: 3990 [2019-10-03 03:02:18,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2019-10-03 03:02:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3684. [2019-10-03 03:02:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3684 states. [2019-10-03 03:02:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 5107 transitions. [2019-10-03 03:02:18,310 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 5107 transitions. Word has length 57 [2019-10-03 03:02:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:18,311 INFO L475 AbstractCegarLoop]: Abstraction has 3684 states and 5107 transitions. [2019-10-03 03:02:18,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 5107 transitions. [2019-10-03 03:02:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:18,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:18,315 INFO L411 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] [2019-10-03 03:02:18,315 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash 371035602, now seen corresponding path program 1 times [2019-10-03 03:02:18,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:18,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:18,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:18,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:18,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:18,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:18,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:18,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:18,399 INFO L87 Difference]: Start difference. First operand 3684 states and 5107 transitions. Second operand 3 states. [2019-10-03 03:02:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:18,476 INFO L93 Difference]: Finished difference Result 4626 states and 6563 transitions. [2019-10-03 03:02:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:18,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-03 03:02:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:18,487 INFO L225 Difference]: With dead ends: 4626 [2019-10-03 03:02:18,488 INFO L226 Difference]: Without dead ends: 4626 [2019-10-03 03:02:18,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2019-10-03 03:02:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4174. [2019-10-03 03:02:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-10-03 03:02:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 5875 transitions. [2019-10-03 03:02:18,565 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 5875 transitions. Word has length 57 [2019-10-03 03:02:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:18,565 INFO L475 AbstractCegarLoop]: Abstraction has 4174 states and 5875 transitions. [2019-10-03 03:02:18,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 5875 transitions. [2019-10-03 03:02:18,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-03 03:02:18,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:18,570 INFO L411 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] [2019-10-03 03:02:18,570 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash -369094904, now seen corresponding path program 1 times [2019-10-03 03:02:18,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:18,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:18,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:18,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:18,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:18,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:18,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:18,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:18,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:18,650 INFO L87 Difference]: Start difference. First operand 4174 states and 5875 transitions. Second operand 3 states. [2019-10-03 03:02:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:18,787 INFO L93 Difference]: Finished difference Result 5370 states and 7646 transitions. [2019-10-03 03:02:18,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:18,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-03 03:02:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:18,805 INFO L225 Difference]: With dead ends: 5370 [2019-10-03 03:02:18,805 INFO L226 Difference]: Without dead ends: 5370 [2019-10-03 03:02:18,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5370 states. [2019-10-03 03:02:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5370 to 5368. [2019-10-03 03:02:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5368 states. [2019-10-03 03:02:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7645 transitions. [2019-10-03 03:02:18,959 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7645 transitions. Word has length 57 [2019-10-03 03:02:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:18,959 INFO L475 AbstractCegarLoop]: Abstraction has 5368 states and 7645 transitions. [2019-10-03 03:02:18,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7645 transitions. [2019-10-03 03:02:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:02:18,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:18,969 INFO L411 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] [2019-10-03 03:02:18,970 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:18,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2011629158, now seen corresponding path program 1 times [2019-10-03 03:02:18,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:18,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:18,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:19,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:19,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:19,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:19,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:19,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:19,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:19,079 INFO L87 Difference]: Start difference. First operand 5368 states and 7645 transitions. Second operand 3 states. [2019-10-03 03:02:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:19,253 INFO L93 Difference]: Finished difference Result 8089 states and 11829 transitions. [2019-10-03 03:02:19,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:19,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:02:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:19,282 INFO L225 Difference]: With dead ends: 8089 [2019-10-03 03:02:19,282 INFO L226 Difference]: Without dead ends: 8089 [2019-10-03 03:02:19,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2019-10-03 03:02:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 6379. [2019-10-03 03:02:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6379 states. [2019-10-03 03:02:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 9282 transitions. [2019-10-03 03:02:19,419 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 9282 transitions. Word has length 58 [2019-10-03 03:02:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:19,420 INFO L475 AbstractCegarLoop]: Abstraction has 6379 states and 9282 transitions. [2019-10-03 03:02:19,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 9282 transitions. [2019-10-03 03:02:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 03:02:19,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:19,426 INFO L411 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] [2019-10-03 03:02:19,427 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:19,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash 883688950, now seen corresponding path program 1 times [2019-10-03 03:02:19,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:19,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:19,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:19,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:19,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:19,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:19,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:19,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:19,525 INFO L87 Difference]: Start difference. First operand 6379 states and 9282 transitions. Second operand 3 states. [2019-10-03 03:02:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:19,639 INFO L93 Difference]: Finished difference Result 10378 states and 15336 transitions. [2019-10-03 03:02:19,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:19,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 03:02:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:19,661 INFO L225 Difference]: With dead ends: 10378 [2019-10-03 03:02:19,661 INFO L226 Difference]: Without dead ends: 10378 [2019-10-03 03:02:19,663 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-10-03 03:02:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 8062. [2019-10-03 03:02:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8062 states. [2019-10-03 03:02:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8062 states to 8062 states and 11884 transitions. [2019-10-03 03:02:19,823 INFO L78 Accepts]: Start accepts. Automaton has 8062 states and 11884 transitions. Word has length 58 [2019-10-03 03:02:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:19,823 INFO L475 AbstractCegarLoop]: Abstraction has 8062 states and 11884 transitions. [2019-10-03 03:02:19,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 8062 states and 11884 transitions. [2019-10-03 03:02:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:19,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:19,826 INFO L411 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] [2019-10-03 03:02:19,827 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:19,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:19,827 INFO L82 PathProgramCache]: Analyzing trace with hash -550232989, now seen corresponding path program 1 times [2019-10-03 03:02:19,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:19,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:20,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:20,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:02:20,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:20,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:02:20,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:02:20,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:20,536 INFO L87 Difference]: Start difference. First operand 8062 states and 11884 transitions. Second operand 19 states. [2019-10-03 03:02:20,744 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-03 03:02:21,336 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-10-03 03:02:21,514 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-10-03 03:02:21,733 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-03 03:02:21,999 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:02:22,172 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:02:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:27,263 INFO L93 Difference]: Finished difference Result 25629 states and 38259 transitions. [2019-10-03 03:02:27,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:02:27,264 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-10-03 03:02:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:27,319 INFO L225 Difference]: With dead ends: 25629 [2019-10-03 03:02:27,320 INFO L226 Difference]: Without dead ends: 25629 [2019-10-03 03:02:27,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=314, Invalid=1326, Unknown=0, NotChecked=0, Total=1640 [2019-10-03 03:02:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25629 states. [2019-10-03 03:02:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25629 to 8074. [2019-10-03 03:02:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8074 states. [2019-10-03 03:02:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 11901 transitions. [2019-10-03 03:02:27,565 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 11901 transitions. Word has length 59 [2019-10-03 03:02:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:27,566 INFO L475 AbstractCegarLoop]: Abstraction has 8074 states and 11901 transitions. [2019-10-03 03:02:27,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:02:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 11901 transitions. [2019-10-03 03:02:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:27,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:27,568 INFO L411 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] [2019-10-03 03:02:27,569 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash 74715795, now seen corresponding path program 1 times [2019-10-03 03:02:27,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:27,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:27,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:28,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:28,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:02:28,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:28,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:02:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:02:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:28,111 INFO L87 Difference]: Start difference. First operand 8074 states and 11901 transitions. Second operand 19 states. [2019-10-03 03:02:28,275 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-10-03 03:02:29,592 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-10-03 03:02:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:33,442 INFO L93 Difference]: Finished difference Result 21584 states and 32169 transitions. [2019-10-03 03:02:33,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:02:33,442 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-10-03 03:02:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:33,487 INFO L225 Difference]: With dead ends: 21584 [2019-10-03 03:02:33,487 INFO L226 Difference]: Without dead ends: 21584 [2019-10-03 03:02:33,488 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=273, Invalid=987, Unknown=0, NotChecked=0, Total=1260 [2019-10-03 03:02:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21584 states. [2019-10-03 03:02:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21584 to 8074. [2019-10-03 03:02:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8074 states. [2019-10-03 03:02:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 11900 transitions. [2019-10-03 03:02:33,724 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 11900 transitions. Word has length 59 [2019-10-03 03:02:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:33,724 INFO L475 AbstractCegarLoop]: Abstraction has 8074 states and 11900 transitions. [2019-10-03 03:02:33,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:02:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 11900 transitions. [2019-10-03 03:02:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:33,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:33,729 INFO L411 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] [2019-10-03 03:02:33,729 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -615559955, now seen corresponding path program 1 times [2019-10-03 03:02:33,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:33,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:33,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:33,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:33,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:34,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:34,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 03:02:34,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:34,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:02:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:02:34,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-03 03:02:34,427 INFO L87 Difference]: Start difference. First operand 8074 states and 11900 transitions. Second operand 19 states. [2019-10-03 03:02:34,650 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-10-03 03:02:35,588 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-10-03 03:02:36,473 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-03 03:02:36,671 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-03 03:02:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:40,304 INFO L93 Difference]: Finished difference Result 21050 states and 31411 transitions. [2019-10-03 03:02:40,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-03 03:02:40,304 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-10-03 03:02:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:40,341 INFO L225 Difference]: With dead ends: 21050 [2019-10-03 03:02:40,341 INFO L226 Difference]: Without dead ends: 21050 [2019-10-03 03:02:40,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=335, Invalid=1147, Unknown=0, NotChecked=0, Total=1482 [2019-10-03 03:02:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21050 states. [2019-10-03 03:02:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21050 to 8074. [2019-10-03 03:02:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8074 states. [2019-10-03 03:02:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 11899 transitions. [2019-10-03 03:02:40,567 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 11899 transitions. Word has length 59 [2019-10-03 03:02:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:40,568 INFO L475 AbstractCegarLoop]: Abstraction has 8074 states and 11899 transitions. [2019-10-03 03:02:40,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:02:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 11899 transitions. [2019-10-03 03:02:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:02:40,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:40,571 INFO L411 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] [2019-10-03 03:02:40,571 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:40,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:40,572 INFO L82 PathProgramCache]: Analyzing trace with hash -638988576, now seen corresponding path program 1 times [2019-10-03 03:02:40,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:40,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:40,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:40,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:40,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 03:02:40,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:40,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 03:02:40,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 03:02:40,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:02:40,998 INFO L87 Difference]: Start difference. First operand 8074 states and 11899 transitions. Second operand 11 states. [2019-10-03 03:02:41,217 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-10-03 03:02:41,744 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-03 03:02:41,984 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-03 03:02:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:43,795 INFO L93 Difference]: Finished difference Result 26685 states and 39598 transitions. [2019-10-03 03:02:43,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-03 03:02:43,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-10-03 03:02:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:43,831 INFO L225 Difference]: With dead ends: 26685 [2019-10-03 03:02:43,831 INFO L226 Difference]: Without dead ends: 26685 [2019-10-03 03:02:43,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-10-03 03:02:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26685 states. [2019-10-03 03:02:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26685 to 7963. [2019-10-03 03:02:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7963 states. [2019-10-03 03:02:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7963 states to 7963 states and 11757 transitions. [2019-10-03 03:02:44,065 INFO L78 Accepts]: Start accepts. Automaton has 7963 states and 11757 transitions. Word has length 59 [2019-10-03 03:02:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:44,065 INFO L475 AbstractCegarLoop]: Abstraction has 7963 states and 11757 transitions. [2019-10-03 03:02:44,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 03:02:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 7963 states and 11757 transitions. [2019-10-03 03:02:44,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 03:02:44,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:44,068 INFO L411 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] [2019-10-03 03:02:44,068 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:44,070 INFO L82 PathProgramCache]: Analyzing trace with hash 217595752, now seen corresponding path program 1 times [2019-10-03 03:02:44,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:44,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:44,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:44,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:44,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:44,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:44,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 03:02:44,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:44,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 03:02:44,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 03:02:44,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:02:44,722 INFO L87 Difference]: Start difference. First operand 7963 states and 11757 transitions. Second operand 15 states. [2019-10-03 03:02:45,261 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-10-03 03:02:45,501 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:02:45,726 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:02:46,046 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-10-03 03:02:47,205 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-10-03 03:02:47,682 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-03 03:02:48,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:48,574 INFO L93 Difference]: Finished difference Result 16144 states and 23857 transitions. [2019-10-03 03:02:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-03 03:02:48,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-10-03 03:02:48,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:48,591 INFO L225 Difference]: With dead ends: 16144 [2019-10-03 03:02:48,591 INFO L226 Difference]: Without dead ends: 16144 [2019-10-03 03:02:48,592 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2019-10-03 03:02:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16144 states. [2019-10-03 03:02:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16144 to 7954. [2019-10-03 03:02:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7954 states. [2019-10-03 03:02:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7954 states to 7954 states and 11745 transitions. [2019-10-03 03:02:48,729 INFO L78 Accepts]: Start accepts. Automaton has 7954 states and 11745 transitions. Word has length 60 [2019-10-03 03:02:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:48,729 INFO L475 AbstractCegarLoop]: Abstraction has 7954 states and 11745 transitions. [2019-10-03 03:02:48,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 03:02:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 7954 states and 11745 transitions. [2019-10-03 03:02:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-03 03:02:48,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:48,732 INFO L411 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] [2019-10-03 03:02:48,732 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:48,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1596599088, now seen corresponding path program 1 times [2019-10-03 03:02:48,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:48,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:48,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:48,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:48,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:48,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:48,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:48,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:48,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:48,827 INFO L87 Difference]: Start difference. First operand 7954 states and 11745 transitions. Second operand 6 states. [2019-10-03 03:02:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:49,069 INFO L93 Difference]: Finished difference Result 28560 states and 41229 transitions. [2019-10-03 03:02:49,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:02:49,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-10-03 03:02:49,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:49,104 INFO L225 Difference]: With dead ends: 28560 [2019-10-03 03:02:49,104 INFO L226 Difference]: Without dead ends: 28560 [2019-10-03 03:02:49,106 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-03 03:02:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28560 states. [2019-10-03 03:02:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28560 to 24972. [2019-10-03 03:02:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24972 states. [2019-10-03 03:02:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24972 states to 24972 states and 36102 transitions. [2019-10-03 03:02:49,395 INFO L78 Accepts]: Start accepts. Automaton has 24972 states and 36102 transitions. Word has length 64 [2019-10-03 03:02:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:49,395 INFO L475 AbstractCegarLoop]: Abstraction has 24972 states and 36102 transitions. [2019-10-03 03:02:49,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 24972 states and 36102 transitions. [2019-10-03 03:02:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 03:02:49,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:49,398 INFO L411 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] [2019-10-03 03:02:49,398 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:49,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1766576601, now seen corresponding path program 1 times [2019-10-03 03:02:49,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:49,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:49,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:49,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:49,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:49,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:49,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:02:49,495 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:49,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:02:49,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:02:49,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:02:49,496 INFO L87 Difference]: Start difference. First operand 24972 states and 36102 transitions. Second operand 6 states. [2019-10-03 03:02:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:49,717 INFO L93 Difference]: Finished difference Result 43931 states and 62137 transitions. [2019-10-03 03:02:49,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:49,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-03 03:02:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:49,774 INFO L225 Difference]: With dead ends: 43931 [2019-10-03 03:02:49,775 INFO L226 Difference]: Without dead ends: 43931 [2019-10-03 03:02:49,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43931 states. [2019-10-03 03:02:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43931 to 25938. [2019-10-03 03:02:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25938 states. [2019-10-03 03:02:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25938 states to 25938 states and 36886 transitions. [2019-10-03 03:02:50,958 INFO L78 Accepts]: Start accepts. Automaton has 25938 states and 36886 transitions. Word has length 65 [2019-10-03 03:02:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:50,958 INFO L475 AbstractCegarLoop]: Abstraction has 25938 states and 36886 transitions. [2019-10-03 03:02:50,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:02:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 25938 states and 36886 transitions. [2019-10-03 03:02:50,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-03 03:02:50,961 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:50,962 INFO L411 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] [2019-10-03 03:02:50,962 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:50,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:50,962 INFO L82 PathProgramCache]: Analyzing trace with hash -913257528, now seen corresponding path program 1 times [2019-10-03 03:02:50,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:50,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:50,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:50,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:50,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:51,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:51,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:51,030 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:51,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:51,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:51,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:51,031 INFO L87 Difference]: Start difference. First operand 25938 states and 36886 transitions. Second operand 3 states. [2019-10-03 03:02:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:51,218 INFO L93 Difference]: Finished difference Result 44578 states and 62398 transitions. [2019-10-03 03:02:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:51,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-10-03 03:02:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:51,286 INFO L225 Difference]: With dead ends: 44578 [2019-10-03 03:02:51,286 INFO L226 Difference]: Without dead ends: 44578 [2019-10-03 03:02:51,287 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44578 states. [2019-10-03 03:02:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44578 to 43946. [2019-10-03 03:02:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43946 states. [2019-10-03 03:02:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43946 states to 43946 states and 61767 transitions. [2019-10-03 03:02:51,736 INFO L78 Accepts]: Start accepts. Automaton has 43946 states and 61767 transitions. Word has length 66 [2019-10-03 03:02:51,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:51,736 INFO L475 AbstractCegarLoop]: Abstraction has 43946 states and 61767 transitions. [2019-10-03 03:02:51,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 43946 states and 61767 transitions. [2019-10-03 03:02:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 03:02:51,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:51,740 INFO L411 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] [2019-10-03 03:02:51,740 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:51,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:51,740 INFO L82 PathProgramCache]: Analyzing trace with hash 476487767, now seen corresponding path program 1 times [2019-10-03 03:02:51,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:51,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:51,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:51,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:51,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:51,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:51,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:51,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:51,809 INFO L87 Difference]: Start difference. First operand 43946 states and 61767 transitions. Second operand 3 states. [2019-10-03 03:02:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:51,954 INFO L93 Difference]: Finished difference Result 43931 states and 60719 transitions. [2019-10-03 03:02:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:51,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-03 03:02:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:52,000 INFO L225 Difference]: With dead ends: 43931 [2019-10-03 03:02:52,000 INFO L226 Difference]: Without dead ends: 43931 [2019-10-03 03:02:52,000 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43931 states. [2019-10-03 03:02:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43931 to 34179. [2019-10-03 03:02:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34179 states. [2019-10-03 03:02:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34179 states to 34179 states and 47276 transitions. [2019-10-03 03:02:53,263 INFO L78 Accepts]: Start accepts. Automaton has 34179 states and 47276 transitions. Word has length 70 [2019-10-03 03:02:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:53,263 INFO L475 AbstractCegarLoop]: Abstraction has 34179 states and 47276 transitions. [2019-10-03 03:02:53,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:02:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 34179 states and 47276 transitions. [2019-10-03 03:02:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 03:02:53,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:53,267 INFO L411 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] [2019-10-03 03:02:53,267 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2006601938, now seen corresponding path program 1 times [2019-10-03 03:02:53,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:53,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:53,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:53,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:53,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:53,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:53,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:53,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:53,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:53,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:53,355 INFO L87 Difference]: Start difference. First operand 34179 states and 47276 transitions. Second operand 5 states. [2019-10-03 03:02:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:54,048 INFO L93 Difference]: Finished difference Result 73998 states and 99359 transitions. [2019-10-03 03:02:54,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:54,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-10-03 03:02:54,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:54,121 INFO L225 Difference]: With dead ends: 73998 [2019-10-03 03:02:54,121 INFO L226 Difference]: Without dead ends: 73998 [2019-10-03 03:02:54,122 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73998 states. [2019-10-03 03:02:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73998 to 41465. [2019-10-03 03:02:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41465 states. [2019-10-03 03:02:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41465 states to 41465 states and 55967 transitions. [2019-10-03 03:02:54,942 INFO L78 Accepts]: Start accepts. Automaton has 41465 states and 55967 transitions. Word has length 70 [2019-10-03 03:02:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:54,942 INFO L475 AbstractCegarLoop]: Abstraction has 41465 states and 55967 transitions. [2019-10-03 03:02:54,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 41465 states and 55967 transitions. [2019-10-03 03:02:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-03 03:02:54,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:54,947 INFO L411 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] [2019-10-03 03:02:54,947 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:54,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:54,947 INFO L82 PathProgramCache]: Analyzing trace with hash 538296260, now seen corresponding path program 1 times [2019-10-03 03:02:54,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:54,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:54,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:54,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:54,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:55,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:55,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:02:55,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:55,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:02:55,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:02:55,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:02:55,019 INFO L87 Difference]: Start difference. First operand 41465 states and 55967 transitions. Second operand 5 states. [2019-10-03 03:02:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:55,779 INFO L93 Difference]: Finished difference Result 115886 states and 153685 transitions. [2019-10-03 03:02:55,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 03:02:55,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-03 03:02:55,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:55,898 INFO L225 Difference]: With dead ends: 115886 [2019-10-03 03:02:55,898 INFO L226 Difference]: Without dead ends: 115886 [2019-10-03 03:02:55,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:02:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115886 states. [2019-10-03 03:02:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115886 to 77790. [2019-10-03 03:02:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77790 states. [2019-10-03 03:02:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77790 states to 77790 states and 104583 transitions. [2019-10-03 03:02:58,167 INFO L78 Accepts]: Start accepts. Automaton has 77790 states and 104583 transitions. Word has length 75 [2019-10-03 03:02:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:02:58,167 INFO L475 AbstractCegarLoop]: Abstraction has 77790 states and 104583 transitions. [2019-10-03 03:02:58,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:02:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 77790 states and 104583 transitions. [2019-10-03 03:02:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-03 03:02:58,172 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:02:58,172 INFO L411 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] [2019-10-03 03:02:58,172 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:02:58,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:02:58,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1290568497, now seen corresponding path program 1 times [2019-10-03 03:02:58,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:02:58,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:58,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:02:58,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:02:58,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:02:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:02:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:02:58,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:02:58,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:02:58,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:02:58,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:02:58,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:02:58,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:58,241 INFO L87 Difference]: Start difference. First operand 77790 states and 104583 transitions. Second operand 3 states. [2019-10-03 03:02:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:02:58,544 INFO L93 Difference]: Finished difference Result 138894 states and 182542 transitions. [2019-10-03 03:02:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:02:58,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-10-03 03:02:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:02:58,697 INFO L225 Difference]: With dead ends: 138894 [2019-10-03 03:02:58,697 INFO L226 Difference]: Without dead ends: 138894 [2019-10-03 03:02:58,697 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:02:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138894 states. [2019-10-03 03:03:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138894 to 100076. [2019-10-03 03:03:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100076 states. [2019-10-03 03:03:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100076 states to 100076 states and 132139 transitions. [2019-10-03 03:03:00,436 INFO L78 Accepts]: Start accepts. Automaton has 100076 states and 132139 transitions. Word has length 78 [2019-10-03 03:03:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:00,437 INFO L475 AbstractCegarLoop]: Abstraction has 100076 states and 132139 transitions. [2019-10-03 03:03:00,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 100076 states and 132139 transitions. [2019-10-03 03:03:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-03 03:03:00,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:00,446 INFO L411 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] [2019-10-03 03:03:00,446 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:00,446 INFO L82 PathProgramCache]: Analyzing trace with hash 162122952, now seen corresponding path program 1 times [2019-10-03 03:03:00,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:00,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:00,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:00,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:00,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:00,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:00,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:00,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:00,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:00,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:00,518 INFO L87 Difference]: Start difference. First operand 100076 states and 132139 transitions. Second operand 3 states. [2019-10-03 03:03:00,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:00,994 INFO L93 Difference]: Finished difference Result 131035 states and 168971 transitions. [2019-10-03 03:03:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:00,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-03 03:03:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:01,210 INFO L225 Difference]: With dead ends: 131035 [2019-10-03 03:03:01,210 INFO L226 Difference]: Without dead ends: 131035 [2019-10-03 03:03:01,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:01,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131035 states. [2019-10-03 03:03:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131035 to 101397. [2019-10-03 03:03:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101397 states. [2019-10-03 03:03:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101397 states to 101397 states and 131616 transitions. [2019-10-03 03:03:04,577 INFO L78 Accepts]: Start accepts. Automaton has 101397 states and 131616 transitions. Word has length 81 [2019-10-03 03:03:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:04,578 INFO L475 AbstractCegarLoop]: Abstraction has 101397 states and 131616 transitions. [2019-10-03 03:03:04,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:04,578 INFO L276 IsEmpty]: Start isEmpty. Operand 101397 states and 131616 transitions. [2019-10-03 03:03:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-03 03:03:04,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:04,584 INFO L411 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] [2019-10-03 03:03:04,584 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:04,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash 328610332, now seen corresponding path program 1 times [2019-10-03 03:03:04,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:04,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:04,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:04,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:04,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:04,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:04,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 03:03:04,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:04,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 03:03:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 03:03:04,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 03:03:04,727 INFO L87 Difference]: Start difference. First operand 101397 states and 131616 transitions. Second operand 6 states. [2019-10-03 03:03:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:05,710 INFO L93 Difference]: Finished difference Result 141001 states and 183148 transitions. [2019-10-03 03:03:05,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 03:03:05,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-10-03 03:03:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:05,939 INFO L225 Difference]: With dead ends: 141001 [2019-10-03 03:03:05,939 INFO L226 Difference]: Without dead ends: 141001 [2019-10-03 03:03:05,940 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141001 states. [2019-10-03 03:03:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141001 to 128451. [2019-10-03 03:03:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128451 states. [2019-10-03 03:03:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128451 states to 128451 states and 166896 transitions. [2019-10-03 03:03:08,109 INFO L78 Accepts]: Start accepts. Automaton has 128451 states and 166896 transitions. Word has length 84 [2019-10-03 03:03:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:08,109 INFO L475 AbstractCegarLoop]: Abstraction has 128451 states and 166896 transitions. [2019-10-03 03:03:08,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 03:03:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand 128451 states and 166896 transitions. [2019-10-03 03:03:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-03 03:03:08,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:08,115 INFO L411 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] [2019-10-03 03:03:08,115 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1028439201, now seen corresponding path program 1 times [2019-10-03 03:03:08,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:08,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:08,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:08,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:08,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:08,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:08,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:08,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:08,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:08,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:08,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:08,184 INFO L87 Difference]: Start difference. First operand 128451 states and 166896 transitions. Second operand 3 states. [2019-10-03 03:03:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:08,537 INFO L93 Difference]: Finished difference Result 145907 states and 185351 transitions. [2019-10-03 03:03:08,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:08,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-03 03:03:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:08,698 INFO L225 Difference]: With dead ends: 145907 [2019-10-03 03:03:08,698 INFO L226 Difference]: Without dead ends: 145907 [2019-10-03 03:03:08,698 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:08,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145907 states. [2019-10-03 03:03:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145907 to 138525. [2019-10-03 03:03:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138525 states. [2019-10-03 03:03:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138525 states to 138525 states and 177154 transitions. [2019-10-03 03:03:10,774 INFO L78 Accepts]: Start accepts. Automaton has 138525 states and 177154 transitions. Word has length 84 [2019-10-03 03:03:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:10,774 INFO L475 AbstractCegarLoop]: Abstraction has 138525 states and 177154 transitions. [2019-10-03 03:03:10,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 138525 states and 177154 transitions. [2019-10-03 03:03:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 03:03:10,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:10,781 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:10,781 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:10,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:10,782 INFO L82 PathProgramCache]: Analyzing trace with hash -217793458, now seen corresponding path program 1 times [2019-10-03 03:03:10,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:10,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:10,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:10,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:10,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:03:10,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:10,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:10,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:10,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:10,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:10,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:10,899 INFO L87 Difference]: Start difference. First operand 138525 states and 177154 transitions. Second operand 5 states. [2019-10-03 03:03:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:11,168 INFO L93 Difference]: Finished difference Result 71009 states and 89734 transitions. [2019-10-03 03:03:11,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:11,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-03 03:03:11,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:11,236 INFO L225 Difference]: With dead ends: 71009 [2019-10-03 03:03:11,236 INFO L226 Difference]: Without dead ends: 71009 [2019-10-03 03:03:11,236 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71009 states. [2019-10-03 03:03:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71009 to 68016. [2019-10-03 03:03:12,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68016 states. [2019-10-03 03:03:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68016 states to 68016 states and 86103 transitions. [2019-10-03 03:03:12,664 INFO L78 Accepts]: Start accepts. Automaton has 68016 states and 86103 transitions. Word has length 85 [2019-10-03 03:03:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:12,664 INFO L475 AbstractCegarLoop]: Abstraction has 68016 states and 86103 transitions. [2019-10-03 03:03:12,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 68016 states and 86103 transitions. [2019-10-03 03:03:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 03:03:12,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:12,670 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:12,670 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash 708629354, now seen corresponding path program 1 times [2019-10-03 03:03:12,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:12,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:12,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:03:12,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:12,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 03:03:12,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:12,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 03:03:12,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 03:03:12,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:12,821 INFO L87 Difference]: Start difference. First operand 68016 states and 86103 transitions. Second operand 9 states. [2019-10-03 03:03:14,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:14,118 INFO L93 Difference]: Finished difference Result 99735 states and 125792 transitions. [2019-10-03 03:03:14,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 03:03:14,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-10-03 03:03:14,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:14,218 INFO L225 Difference]: With dead ends: 99735 [2019-10-03 03:03:14,218 INFO L226 Difference]: Without dead ends: 99735 [2019-10-03 03:03:14,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:03:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99735 states. [2019-10-03 03:03:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99735 to 68004. [2019-10-03 03:03:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68004 states. [2019-10-03 03:03:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68004 states to 68004 states and 86090 transitions. [2019-10-03 03:03:17,096 INFO L78 Accepts]: Start accepts. Automaton has 68004 states and 86090 transitions. Word has length 88 [2019-10-03 03:03:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:17,096 INFO L475 AbstractCegarLoop]: Abstraction has 68004 states and 86090 transitions. [2019-10-03 03:03:17,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 03:03:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 68004 states and 86090 transitions. [2019-10-03 03:03:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-03 03:03:17,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:17,102 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:17,102 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash 48670285, now seen corresponding path program 1 times [2019-10-03 03:03:17,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:17,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:17,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:17,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:17,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 03:03:17,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:17,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:03:17,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:17,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:03:17,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:03:17,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:03:17,253 INFO L87 Difference]: Start difference. First operand 68004 states and 86090 transitions. Second operand 8 states. [2019-10-03 03:03:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:18,340 INFO L93 Difference]: Finished difference Result 131195 states and 166103 transitions. [2019-10-03 03:03:18,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:03:18,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-10-03 03:03:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:18,486 INFO L225 Difference]: With dead ends: 131195 [2019-10-03 03:03:18,486 INFO L226 Difference]: Without dead ends: 131195 [2019-10-03 03:03:18,486 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:03:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131195 states. [2019-10-03 03:03:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131195 to 68004. [2019-10-03 03:03:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68004 states. [2019-10-03 03:03:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68004 states to 68004 states and 86089 transitions. [2019-10-03 03:03:19,448 INFO L78 Accepts]: Start accepts. Automaton has 68004 states and 86089 transitions. Word has length 88 [2019-10-03 03:03:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:19,448 INFO L475 AbstractCegarLoop]: Abstraction has 68004 states and 86089 transitions. [2019-10-03 03:03:19,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:03:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 68004 states and 86089 transitions. [2019-10-03 03:03:19,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 03:03:19,455 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:19,455 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:19,455 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1485835272, now seen corresponding path program 1 times [2019-10-03 03:03:19,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:19,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:19,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:19,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:19,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:19,909 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 90 with the following transitions: [2019-10-03 03:03:19,911 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [164], [167], [168], [170], [173], [178], [180], [201], [203], [3199], [3203], [3206], [3209], [3212], [3216], [3325], [3328], [3349], [3351], [3412], [3458], [3461], [3464], [3468], [3471], [3475], [3479], [3481], [3484], [3488], [3491], [3494], [3498], [3636], [3639], [3660], [3662], [3664], [3667], [3670], [3672], [3677], [3682], [3684], [3703], [3705], [3724], [3839], [3842], [3845], [3849], [3853], [3857], [3859], [3863], [3866], [3869], [3872], [3874], [4485], [4486], [4490], [4491], [4492] [2019-10-03 03:03:19,955 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:19,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:20,226 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:20,687 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:20,690 INFO L272 AbstractInterpreter]: Visited 84 different actions 214 times. Merged at 27 different actions 118 times. Widened at 5 different actions 5 times. Performed 1072 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1072 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 13 fixpoints after 6 different actions. Largest state had 253 variables. [2019-10-03 03:03:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:20,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:20,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:20,697 INFO L193 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 [2019-10-03 03:03:20,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:20,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:21,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 1344 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:03:21,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:21,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:21,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:21,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:21,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:21,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:21,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:21,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:22,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:03:22,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2019-10-03 03:03:22,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:03:22,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 03:03:22,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 03:03:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-03 03:03:22,012 INFO L87 Difference]: Start difference. First operand 68004 states and 86089 transitions. Second operand 16 states. [2019-10-03 03:03:22,336 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-03 03:03:22,483 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-03 03:03:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:27,628 INFO L93 Difference]: Finished difference Result 115018 states and 144409 transitions. [2019-10-03 03:03:27,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 03:03:27,628 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-10-03 03:03:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:28,073 INFO L225 Difference]: With dead ends: 115018 [2019-10-03 03:03:28,074 INFO L226 Difference]: Without dead ends: 115018 [2019-10-03 03:03:28,077 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 160 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=309, Invalid=1023, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 03:03:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115018 states. [2019-10-03 03:03:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115018 to 68241. [2019-10-03 03:03:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68241 states. [2019-10-03 03:03:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68241 states to 68241 states and 86372 transitions. [2019-10-03 03:03:30,444 INFO L78 Accepts]: Start accepts. Automaton has 68241 states and 86372 transitions. Word has length 89 [2019-10-03 03:03:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:30,444 INFO L475 AbstractCegarLoop]: Abstraction has 68241 states and 86372 transitions. [2019-10-03 03:03:30,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 03:03:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 68241 states and 86372 transitions. [2019-10-03 03:03:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-03 03:03:30,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:30,462 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:30,463 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1635641784, now seen corresponding path program 1 times [2019-10-03 03:03:30,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:30,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:30,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:30,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:30,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:30,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 03:03:30,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:30,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:03:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:03:30,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-03 03:03:30,821 INFO L87 Difference]: Start difference. First operand 68241 states and 86372 transitions. Second operand 10 states. [2019-10-03 03:03:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:33,867 INFO L93 Difference]: Finished difference Result 190864 states and 240337 transitions. [2019-10-03 03:03:33,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-03 03:03:33,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-10-03 03:03:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:34,096 INFO L225 Difference]: With dead ends: 190864 [2019-10-03 03:03:34,097 INFO L226 Difference]: Without dead ends: 190864 [2019-10-03 03:03:34,097 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=383, Invalid=1099, Unknown=0, NotChecked=0, Total=1482 [2019-10-03 03:03:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190864 states. [2019-10-03 03:03:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190864 to 84366. [2019-10-03 03:03:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84366 states. [2019-10-03 03:03:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84366 states to 84366 states and 106772 transitions. [2019-10-03 03:03:35,907 INFO L78 Accepts]: Start accepts. Automaton has 84366 states and 106772 transitions. Word has length 89 [2019-10-03 03:03:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:35,907 INFO L475 AbstractCegarLoop]: Abstraction has 84366 states and 106772 transitions. [2019-10-03 03:03:35,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:03:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 84366 states and 106772 transitions. [2019-10-03 03:03:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 03:03:35,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:35,912 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:35,913 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:35,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:35,913 INFO L82 PathProgramCache]: Analyzing trace with hash -877671765, now seen corresponding path program 1 times [2019-10-03 03:03:35,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:35,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:35,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:36,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:36,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 03:03:36,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:36,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 03:03:36,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 03:03:36,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-03 03:03:36,134 INFO L87 Difference]: Start difference. First operand 84366 states and 106772 transitions. Second operand 12 states. [2019-10-03 03:03:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:38,251 INFO L93 Difference]: Finished difference Result 211114 states and 266990 transitions. [2019-10-03 03:03:38,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 03:03:38,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-10-03 03:03:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:38,653 INFO L225 Difference]: With dead ends: 211114 [2019-10-03 03:03:38,653 INFO L226 Difference]: Without dead ends: 211114 [2019-10-03 03:03:38,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-10-03 03:03:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211114 states. [2019-10-03 03:03:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211114 to 85266. [2019-10-03 03:03:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85266 states. [2019-10-03 03:03:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85266 states to 85266 states and 107852 transitions. [2019-10-03 03:03:40,489 INFO L78 Accepts]: Start accepts. Automaton has 85266 states and 107852 transitions. Word has length 90 [2019-10-03 03:03:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:40,490 INFO L475 AbstractCegarLoop]: Abstraction has 85266 states and 107852 transitions. [2019-10-03 03:03:40,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 03:03:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 85266 states and 107852 transitions. [2019-10-03 03:03:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 03:03:40,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:40,495 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:40,495 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1117583225, now seen corresponding path program 1 times [2019-10-03 03:03:40,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:40,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:40,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:40,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:40,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:40,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:40,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:40,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:40,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:40,562 INFO L87 Difference]: Start difference. First operand 85266 states and 107852 transitions. Second operand 3 states. [2019-10-03 03:03:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:40,847 INFO L93 Difference]: Finished difference Result 85268 states and 105875 transitions. [2019-10-03 03:03:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:40,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-10-03 03:03:40,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:40,965 INFO L225 Difference]: With dead ends: 85268 [2019-10-03 03:03:40,966 INFO L226 Difference]: Without dead ends: 85268 [2019-10-03 03:03:40,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85268 states. [2019-10-03 03:03:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85268 to 85225. [2019-10-03 03:03:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85225 states. [2019-10-03 03:03:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85225 states to 85225 states and 105829 transitions. [2019-10-03 03:03:42,564 INFO L78 Accepts]: Start accepts. Automaton has 85225 states and 105829 transitions. Word has length 90 [2019-10-03 03:03:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:42,565 INFO L475 AbstractCegarLoop]: Abstraction has 85225 states and 105829 transitions. [2019-10-03 03:03:42,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 85225 states and 105829 transitions. [2019-10-03 03:03:42,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-03 03:03:42,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:42,569 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:42,570 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:42,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:42,570 INFO L82 PathProgramCache]: Analyzing trace with hash 83626030, now seen corresponding path program 1 times [2019-10-03 03:03:42,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:42,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:42,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:42,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:42,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:42,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:42,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:42,698 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 91 with the following transitions: [2019-10-03 03:03:42,698 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [164], [167], [168], [170], [173], [178], [180], [201], [203], [3199], [3203], [3206], [3209], [3212], [3216], [3325], [3328], [3349], [3351], [3412], [3458], [3461], [3464], [3468], [3471], [3475], [3479], [3481], [3484], [3488], [3491], [3494], [3498], [3636], [3639], [3642], [3658], [3662], [3664], [3667], [3670], [3672], [3677], [3682], [3684], [3703], [3705], [3724], [3839], [3842], [3845], [3849], [3853], [3857], [3859], [3863], [3866], [3869], [3872], [3874], [4485], [4486], [4490], [4491], [4492] [2019-10-03 03:03:42,710 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:42,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:42,776 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:42,976 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:42,977 INFO L272 AbstractInterpreter]: Visited 85 different actions 208 times. Merged at 28 different actions 112 times. Widened at 5 different actions 5 times. Performed 1059 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1059 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 12 fixpoints after 6 different actions. Largest state had 253 variables. [2019-10-03 03:03:42,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:42,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:42,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:42,977 INFO L193 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 [2019-10-03 03:03:43,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:43,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:43,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-03 03:03:43,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:43,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:43,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:03:43,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 17 [2019-10-03 03:03:43,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:03:43,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 03:03:43,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 03:03:43,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-10-03 03:03:43,603 INFO L87 Difference]: Start difference. First operand 85225 states and 105829 transitions. Second operand 10 states. [2019-10-03 03:03:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:44,234 INFO L93 Difference]: Finished difference Result 126561 states and 156081 transitions. [2019-10-03 03:03:44,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:03:44,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-10-03 03:03:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:44,377 INFO L225 Difference]: With dead ends: 126561 [2019-10-03 03:03:44,377 INFO L226 Difference]: Without dead ends: 126561 [2019-10-03 03:03:44,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-10-03 03:03:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126561 states. [2019-10-03 03:03:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126561 to 113693. [2019-10-03 03:03:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113693 states. [2019-10-03 03:03:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113693 states to 113693 states and 140953 transitions. [2019-10-03 03:03:45,488 INFO L78 Accepts]: Start accepts. Automaton has 113693 states and 140953 transitions. Word has length 90 [2019-10-03 03:03:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:45,488 INFO L475 AbstractCegarLoop]: Abstraction has 113693 states and 140953 transitions. [2019-10-03 03:03:45,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 03:03:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 113693 states and 140953 transitions. [2019-10-03 03:03:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 03:03:45,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:45,493 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:45,493 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1407281803, now seen corresponding path program 1 times [2019-10-03 03:03:45,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:45,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:45,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:45,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:45,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:45,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:45,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:45,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:45,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:45,573 INFO L87 Difference]: Start difference. First operand 113693 states and 140953 transitions. Second operand 5 states. [2019-10-03 03:03:46,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:46,333 INFO L93 Difference]: Finished difference Result 118705 states and 144803 transitions. [2019-10-03 03:03:46,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 03:03:46,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-03 03:03:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:46,858 INFO L225 Difference]: With dead ends: 118705 [2019-10-03 03:03:46,858 INFO L226 Difference]: Without dead ends: 118705 [2019-10-03 03:03:46,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-03 03:03:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118705 states. [2019-10-03 03:03:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118705 to 106146. [2019-10-03 03:03:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106146 states. [2019-10-03 03:03:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106146 states to 106146 states and 129041 transitions. [2019-10-03 03:03:47,812 INFO L78 Accepts]: Start accepts. Automaton has 106146 states and 129041 transitions. Word has length 92 [2019-10-03 03:03:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:47,812 INFO L475 AbstractCegarLoop]: Abstraction has 106146 states and 129041 transitions. [2019-10-03 03:03:47,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:47,812 INFO L276 IsEmpty]: Start isEmpty. Operand 106146 states and 129041 transitions. [2019-10-03 03:03:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-03 03:03:47,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:47,818 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:47,818 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:47,818 INFO L82 PathProgramCache]: Analyzing trace with hash -522631261, now seen corresponding path program 1 times [2019-10-03 03:03:47,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:47,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:47,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:03:47,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:47,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:03:47,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:47,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:03:47,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:03:47,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:47,901 INFO L87 Difference]: Start difference. First operand 106146 states and 129041 transitions. Second operand 3 states. [2019-10-03 03:03:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:48,157 INFO L93 Difference]: Finished difference Result 106053 states and 127434 transitions. [2019-10-03 03:03:48,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:03:48,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-10-03 03:03:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:48,272 INFO L225 Difference]: With dead ends: 106053 [2019-10-03 03:03:48,273 INFO L226 Difference]: Without dead ends: 106053 [2019-10-03 03:03:48,273 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:03:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106053 states. [2019-10-03 03:03:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106053 to 87271. [2019-10-03 03:03:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87271 states. [2019-10-03 03:03:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87271 states to 87271 states and 105219 transitions. [2019-10-03 03:03:49,616 INFO L78 Accepts]: Start accepts. Automaton has 87271 states and 105219 transitions. Word has length 94 [2019-10-03 03:03:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:49,616 INFO L475 AbstractCegarLoop]: Abstraction has 87271 states and 105219 transitions. [2019-10-03 03:03:49,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:03:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 87271 states and 105219 transitions. [2019-10-03 03:03:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-03 03:03:49,620 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:49,620 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:49,620 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:49,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:49,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2106461639, now seen corresponding path program 1 times [2019-10-03 03:03:49,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:49,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:49,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:49,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:49,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-03 03:03:49,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:49,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:49,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:49,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:49,703 INFO L87 Difference]: Start difference. First operand 87271 states and 105219 transitions. Second operand 5 states. [2019-10-03 03:03:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:49,967 INFO L93 Difference]: Finished difference Result 103297 states and 124296 transitions. [2019-10-03 03:03:49,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:49,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-10-03 03:03:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:50,070 INFO L225 Difference]: With dead ends: 103297 [2019-10-03 03:03:50,071 INFO L226 Difference]: Without dead ends: 103297 [2019-10-03 03:03:50,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:03:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103297 states. [2019-10-03 03:03:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103297 to 86363. [2019-10-03 03:03:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86363 states. [2019-10-03 03:03:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86363 states to 86363 states and 104013 transitions. [2019-10-03 03:03:50,812 INFO L78 Accepts]: Start accepts. Automaton has 86363 states and 104013 transitions. Word has length 95 [2019-10-03 03:03:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:50,813 INFO L475 AbstractCegarLoop]: Abstraction has 86363 states and 104013 transitions. [2019-10-03 03:03:50,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 86363 states and 104013 transitions. [2019-10-03 03:03:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 03:03:50,818 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:50,818 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:50,818 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:50,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1960434292, now seen corresponding path program 1 times [2019-10-03 03:03:50,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:50,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:50,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:50,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:50,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:50,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:03:50,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:50,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:03:50,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:03:50,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:50,919 INFO L87 Difference]: Start difference. First operand 86363 states and 104013 transitions. Second operand 5 states. [2019-10-03 03:03:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:51,244 INFO L93 Difference]: Finished difference Result 125092 states and 150787 transitions. [2019-10-03 03:03:51,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:51,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-10-03 03:03:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:51,367 INFO L225 Difference]: With dead ends: 125092 [2019-10-03 03:03:51,367 INFO L226 Difference]: Without dead ends: 125092 [2019-10-03 03:03:51,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 03:03:51,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125092 states. [2019-10-03 03:03:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125092 to 105299. [2019-10-03 03:03:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105299 states. [2019-10-03 03:03:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105299 states to 105299 states and 126641 transitions. [2019-10-03 03:03:52,672 INFO L78 Accepts]: Start accepts. Automaton has 105299 states and 126641 transitions. Word has length 96 [2019-10-03 03:03:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:52,672 INFO L475 AbstractCegarLoop]: Abstraction has 105299 states and 126641 transitions. [2019-10-03 03:03:52,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:03:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 105299 states and 126641 transitions. [2019-10-03 03:03:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 03:03:52,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:52,680 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:52,681 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash 537181902, now seen corresponding path program 1 times [2019-10-03 03:03:52,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:52,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:52,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:52,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:52,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:03:52,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:03:52,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:03:52,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:03:52,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:03:52,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:03:52,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:03:52,742 INFO L87 Difference]: Start difference. First operand 105299 states and 126641 transitions. Second operand 4 states. [2019-10-03 03:03:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:03:53,404 INFO L93 Difference]: Finished difference Result 127726 states and 153233 transitions. [2019-10-03 03:03:53,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:03:53,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-03 03:03:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:03:53,531 INFO L225 Difference]: With dead ends: 127726 [2019-10-03 03:03:53,532 INFO L226 Difference]: Without dead ends: 127726 [2019-10-03 03:03:53,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:03:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127726 states. [2019-10-03 03:03:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127726 to 105299. [2019-10-03 03:03:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105299 states. [2019-10-03 03:03:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105299 states to 105299 states and 126641 transitions. [2019-10-03 03:03:54,461 INFO L78 Accepts]: Start accepts. Automaton has 105299 states and 126641 transitions. Word has length 102 [2019-10-03 03:03:54,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:03:54,461 INFO L475 AbstractCegarLoop]: Abstraction has 105299 states and 126641 transitions. [2019-10-03 03:03:54,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:03:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 105299 states and 126641 transitions. [2019-10-03 03:03:54,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-03 03:03:54,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:03:54,471 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:03:54,471 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:03:54,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:54,471 INFO L82 PathProgramCache]: Analyzing trace with hash -381792721, now seen corresponding path program 1 times [2019-10-03 03:03:54,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:03:54,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:54,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:54,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:03:54,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:03:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:54,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:54,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:03:54,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-10-03 03:03:54,703 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [164], [167], [168], [170], [173], [178], [180], [183], [186], [191], [194], [203], [353], [453], [456], [459], [463], [466], [470], [474], [476], [479], [482], [485], [490], [493], [496], [499], [503], [916], [919], [922], [926], [930], [933], [936], [939], [947], [3325], [3328], [3349], [3351], [3354], [3357], [3360], [3363], [3371], [3373], [3636], [3639], [3660], [3662], [3664], [3667], [3670], [3680], [3682], [3684], [3703], [3705], [3708], [3711], [3714], [3722], [4485], [4486], [4490], [4491], [4492] [2019-10-03 03:03:54,708 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:03:54,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:03:54,775 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:03:55,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:03:55,141 INFO L272 AbstractInterpreter]: Visited 97 different actions 309 times. Merged at 38 different actions 191 times. Widened at 9 different actions 20 times. Performed 1324 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1324 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 9 different actions. Largest state had 255 variables. [2019-10-03 03:03:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:03:55,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:03:55,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:03:55,142 INFO L193 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 [2019-10-03 03:03:55,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:03:55,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:03:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:03:55,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-03 03:03:55,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:03:55,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:55,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:56,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:03:56,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:03:56,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:56,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:56,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:56,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:03:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream Closed [2019-10-03 03:03:57,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:03:57,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2019-10-03 03:03:57,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:03:57,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 03:03:57,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 03:03:57,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-10-03 03:03:57,055 INFO L87 Difference]: Start difference. First operand 105299 states and 126641 transitions. Second operand 18 states. [2019-10-03 03:03:57,459 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-03 03:04:00,263 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-10-03 03:04:00,844 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2019-10-03 03:04:01,341 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:04:01,638 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-10-03 03:04:01,810 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-03 03:04:02,372 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-10-03 03:04:03,518 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-03 03:04:04,013 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-03 03:04:04,316 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-03 03:04:05,135 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-03 03:04:05,645 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-10-03 03:04:06,503 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-03 03:04:06,836 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:04:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:07,588 INFO L93 Difference]: Finished difference Result 316107 states and 375856 transitions. [2019-10-03 03:04:07,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-03 03:04:07,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 102 [2019-10-03 03:04:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:07,957 INFO L225 Difference]: With dead ends: 316107 [2019-10-03 03:04:07,957 INFO L226 Difference]: Without dead ends: 316107 [2019-10-03 03:04:07,959 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 181 SyntacticMatches, 12 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1126, Invalid=3566, Unknown=0, NotChecked=0, Total=4692 [2019-10-03 03:04:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316107 states. [2019-10-03 03:04:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316107 to 130559. [2019-10-03 03:04:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130559 states. [2019-10-03 03:04:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130559 states to 130559 states and 156481 transitions. [2019-10-03 03:04:12,823 INFO L78 Accepts]: Start accepts. Automaton has 130559 states and 156481 transitions. Word has length 102 [2019-10-03 03:04:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:12,823 INFO L475 AbstractCegarLoop]: Abstraction has 130559 states and 156481 transitions. [2019-10-03 03:04:12,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 03:04:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 130559 states and 156481 transitions. [2019-10-03 03:04:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 03:04:12,832 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:12,832 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:04:12,832 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:12,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1158856959, now seen corresponding path program 1 times [2019-10-03 03:04:12,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:12,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:12,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:12,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:12,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:12,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:04:12,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:12,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:04:12,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:04:12,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:04:12,896 INFO L87 Difference]: Start difference. First operand 130559 states and 156481 transitions. Second operand 3 states. [2019-10-03 03:04:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:13,035 INFO L93 Difference]: Finished difference Result 50376 states and 58974 transitions. [2019-10-03 03:04:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:04:13,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-03 03:04:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:13,075 INFO L225 Difference]: With dead ends: 50376 [2019-10-03 03:04:13,075 INFO L226 Difference]: Without dead ends: 50376 [2019-10-03 03:04:13,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:04:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50376 states. [2019-10-03 03:04:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50376 to 50374. [2019-10-03 03:04:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50374 states. [2019-10-03 03:04:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 58973 transitions. [2019-10-03 03:04:13,437 INFO L78 Accepts]: Start accepts. Automaton has 50374 states and 58973 transitions. Word has length 103 [2019-10-03 03:04:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:13,437 INFO L475 AbstractCegarLoop]: Abstraction has 50374 states and 58973 transitions. [2019-10-03 03:04:13,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:04:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 50374 states and 58973 transitions. [2019-10-03 03:04:13,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 03:04:13,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:13,441 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:04:13,441 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:13,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1037867407, now seen corresponding path program 1 times [2019-10-03 03:04:13,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:13,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:13,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:13,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:04:13,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:04:13,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 03:04:13,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:04:13,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 03:04:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 03:04:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-03 03:04:13,590 INFO L87 Difference]: Start difference. First operand 50374 states and 58973 transitions. Second operand 8 states. [2019-10-03 03:04:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:15,081 INFO L93 Difference]: Finished difference Result 56935 states and 66356 transitions. [2019-10-03 03:04:15,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 03:04:15,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 103 [2019-10-03 03:04:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:15,128 INFO L225 Difference]: With dead ends: 56935 [2019-10-03 03:04:15,128 INFO L226 Difference]: Without dead ends: 56935 [2019-10-03 03:04:15,128 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-10-03 03:04:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56935 states. [2019-10-03 03:04:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56935 to 50374. [2019-10-03 03:04:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50374 states. [2019-10-03 03:04:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50374 states to 50374 states and 58972 transitions. [2019-10-03 03:04:15,516 INFO L78 Accepts]: Start accepts. Automaton has 50374 states and 58972 transitions. Word has length 103 [2019-10-03 03:04:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:15,516 INFO L475 AbstractCegarLoop]: Abstraction has 50374 states and 58972 transitions. [2019-10-03 03:04:15,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 03:04:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 50374 states and 58972 transitions. [2019-10-03 03:04:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 03:04:15,520 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:04:15,521 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:04:15,521 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:04:15,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:15,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1287656073, now seen corresponding path program 1 times [2019-10-03 03:04:15,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:04:15,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:15,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:15,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:04:15,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:04:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:15,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:15,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:04:15,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 104 with the following transitions: [2019-10-03 03:04:15,718 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [58], [61], [64], [67], [71], [74], [77], [80], [84], [164], [167], [168], [170], [173], [178], [180], [183], [186], [191], [194], [203], [353], [453], [456], [459], [463], [466], [470], [474], [476], [479], [482], [485], [490], [493], [496], [499], [503], [916], [919], [922], [926], [930], [933], [936], [939], [947], [3325], [3328], [3349], [3351], [3354], [3357], [3360], [3363], [3371], [3373], [3636], [3639], [3642], [3658], [3662], [3664], [3667], [3670], [3680], [3682], [3684], [3703], [3705], [3708], [3711], [3714], [3722], [4485], [4486], [4490], [4491], [4492] [2019-10-03 03:04:15,722 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:04:15,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:04:15,779 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:04:16,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 03:04:16,223 INFO L272 AbstractInterpreter]: Visited 98 different actions 441 times. Merged at 39 different actions 311 times. Widened at 15 different actions 51 times. Performed 1672 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1672 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 10 different actions. Largest state had 255 variables. [2019-10-03 03:04:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:04:16,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 03:04:16,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:04:16,223 INFO L193 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 [2019-10-03 03:04:16,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:04:16,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 03:04:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:04:16,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-03 03:04:16,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 03:04:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:17,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 03:04:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:17,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:17,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 03:04:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:04:18,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 03:04:18,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 26 [2019-10-03 03:04:18,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 03:04:18,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 03:04:18,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 03:04:18,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2019-10-03 03:04:18,139 INFO L87 Difference]: Start difference. First operand 50374 states and 58972 transitions. Second operand 19 states. [2019-10-03 03:04:18,613 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-10-03 03:04:18,888 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-03 03:04:19,326 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-03 03:04:19,503 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-03 03:04:19,822 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-03 03:04:20,112 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-10-03 03:04:20,422 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-10-03 03:04:20,650 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:04:20,956 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-10-03 03:04:21,950 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-10-03 03:04:22,143 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-10-03 03:04:22,932 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-10-03 03:04:23,095 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-03 03:04:23,652 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-10-03 03:04:25,213 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-03 03:04:25,368 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-03 03:04:25,588 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-03 03:04:26,466 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-03 03:04:26,887 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-10-03 03:04:27,071 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-10-03 03:04:28,334 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-10-03 03:04:28,559 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-03 03:04:28,888 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-10-03 03:04:29,162 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-10-03 03:04:29,437 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-10-03 03:04:29,769 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-03 03:04:29,915 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-03 03:04:30,181 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:04:30,449 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-03 03:04:30,752 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:04:31,625 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:04:31,896 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:04:32,368 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-03 03:04:33,094 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-03 03:04:33,377 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-10-03 03:04:33,846 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:04:34,145 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:04:34,342 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-10-03 03:04:34,635 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-03 03:04:34,849 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:04:35,027 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-03 03:04:35,283 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-10-03 03:04:35,569 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-03 03:04:36,143 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:04:36,383 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-10-03 03:04:36,771 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-10-03 03:04:37,191 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-10-03 03:04:37,512 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-03 03:04:37,795 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-03 03:04:38,108 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-03 03:04:38,396 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-03 03:04:38,724 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:04:39,006 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:04:39,342 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-03 03:04:39,882 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-10-03 03:04:40,177 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-03 03:04:40,525 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-10-03 03:04:40,856 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-10-03 03:04:41,283 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-10-03 03:04:41,820 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-03 03:04:42,048 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-10-03 03:04:42,537 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-10-03 03:04:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:04:43,010 INFO L93 Difference]: Finished difference Result 129945 states and 151596 transitions. [2019-10-03 03:04:43,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-03 03:04:43,011 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 103 [2019-10-03 03:04:43,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:04:43,011 INFO L225 Difference]: With dead ends: 129945 [2019-10-03 03:04:43,011 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 03:04:43,013 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 223 SyntacticMatches, 16 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=1657, Invalid=6715, Unknown=0, NotChecked=0, Total=8372 [2019-10-03 03:04:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 03:04:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 03:04:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 03:04:43,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 03:04:43,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2019-10-03 03:04:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:04:43,014 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 03:04:43,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 03:04:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 03:04:43,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 03:04:43,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:04:43 BoogieIcfgContainer [2019-10-03 03:04:43,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 03:04:43,020 INFO L168 Benchmark]: Toolchain (without parser) took 166242.11 ms. Allocated memory was 138.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 80.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-03 03:04:43,021 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 138.4 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-03 03:04:43,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1557.28 ms. Allocated memory was 138.4 MB in the beginning and 217.1 MB in the end (delta: 78.6 MB). Free memory was 79.6 MB in the beginning and 126.3 MB in the end (delta: -46.7 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2019-10-03 03:04:43,022 INFO L168 Benchmark]: Boogie Preprocessor took 282.87 ms. Allocated memory is still 217.1 MB. Free memory was 126.3 MB in the beginning and 113.6 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-10-03 03:04:43,023 INFO L168 Benchmark]: RCFGBuilder took 3734.57 ms. Allocated memory was 217.1 MB in the beginning and 361.2 MB in the end (delta: 144.2 MB). Free memory was 113.6 MB in the beginning and 267.0 MB in the end (delta: -153.4 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. [2019-10-03 03:04:43,023 INFO L168 Benchmark]: TraceAbstraction took 160661.09 ms. Allocated memory was 361.2 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 267.0 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-03 03:04:43,026 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 138.4 MB. Free memory was 104.3 MB in the beginning and 104.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1557.28 ms. Allocated memory was 138.4 MB in the beginning and 217.1 MB in the end (delta: 78.6 MB). Free memory was 79.6 MB in the beginning and 126.3 MB in the end (delta: -46.7 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 282.87 ms. Allocated memory is still 217.1 MB. Free memory was 126.3 MB in the beginning and 113.6 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3734.57 ms. Allocated memory was 217.1 MB in the beginning and 361.2 MB in the end (delta: 144.2 MB). Free memory was 113.6 MB in the beginning and 267.0 MB in the end (delta: -153.4 MB). Peak memory consumption was 103.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 160661.09 ms. Allocated memory was 361.2 MB in the beginning and 2.8 GB in the end (delta: 2.4 GB). Free memory was 267.0 MB in the beginning and 1.3 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3360]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1795]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 691]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5192]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1288]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 1126 locations, 6 error locations. SAFE Result, 160.5s OverallTime, 43 OverallIterations, 2 TraceHistogramMax, 100.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23033 SDtfs, 78149 SDslu, 64493 SDs, 0 SdLazy, 42685 SolverSat, 2636 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1488 GetRequests, 822 SyntacticMatches, 39 SemanticMatches, 627 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5919 ImplicationChecksByTransitivity, 40.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138525occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 42.7s AutomataMinimizationTime, 43 MinimizatonAttempts, 952139 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 3636 NumberOfCodeBlocks, 3636 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 3969 ConstructedInterpolants, 146 QuantifiedInterpolants, 3248822 SizeOfPredicates, 39 NumberOfNonLiveVariables, 5434 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 51 InterpolantComputations, 39 PerfectInterpolantSequences, 164/210 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...