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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:44:13,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:44:13,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:44:13,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:44:13,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:44:13,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:44:13,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:44:13,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:44:13,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:44:13,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:44:13,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:44:13,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:44:13,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:44:13,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:44:13,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:44:13,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:44:13,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:44:13,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:44:13,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:44:13,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:44:13,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:44:13,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:44:13,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:44:13,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:44:13,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:44:13,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:44:13,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:44:13,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:44:13,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:44:13,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:44:13,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:44:13,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:44:13,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:44:13,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:44:13,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:44:13,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:44:13,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:44:13,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:44:13,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:44:13,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:44:13,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:44:13,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:44:13,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:44:13,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:44:13,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:44:13,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:44:13,802 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:44:13,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:44:13,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:44:13,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:44:13,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:44:13,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:44:13,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:44:13,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:44:13,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:44:13,805 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:44:13,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:44:13,805 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:44:13,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:44:13,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:44:13,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:44:13,806 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:44:13,806 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:44:13,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:44:13,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:44:13,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:44:13,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:44:13,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:44:13,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:44:13,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:44:13,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:44:13,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:44:13,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:44:13,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:44:13,858 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:44:13,859 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:44:13,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:44:13,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b003b4cd/3d2439ece67f404a9078d8c8b0162245/FLAGa9bd3c4c7 [2019-09-08 12:44:14,417 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:44:14,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:44:14,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b003b4cd/3d2439ece67f404a9078d8c8b0162245/FLAGa9bd3c4c7 [2019-09-08 12:44:14,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b003b4cd/3d2439ece67f404a9078d8c8b0162245 [2019-09-08 12:44:14,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:44:14,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:44:14,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:44:14,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:44:14,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:44:14,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:44:14" (1/1) ... [2019-09-08 12:44:14,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697a5658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:14, skipping insertion in model container [2019-09-08 12:44:14,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:44:14" (1/1) ... [2019-09-08 12:44:14,788 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:44:14,864 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:44:15,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:44:15,356 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:44:15,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:44:15,525 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:44:15,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15 WrapperNode [2019-09-08 12:44:15,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:44:15,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:44:15,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:44:15,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:44:15,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15" (1/1) ... [2019-09-08 12:44:15,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15" (1/1) ... [2019-09-08 12:44:15,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15" (1/1) ... [2019-09-08 12:44:15,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15" (1/1) ... [2019-09-08 12:44:15,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15" (1/1) ... [2019-09-08 12:44:15,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15" (1/1) ... [2019-09-08 12:44:15,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15" (1/1) ... [2019-09-08 12:44:15,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:44:15,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:44:15,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:44:15,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:44:15,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15" (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-09-08 12:44:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:44:15,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:44:15,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:44:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:44:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:44:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:44:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:44:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:44:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:44:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:44:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:44:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:44:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:44:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:44:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:44:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:44:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:44:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:44:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:44:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:44:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:44:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:44:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:44:16,478 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:44:16,479 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:44:16,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:44:16 BoogieIcfgContainer [2019-09-08 12:44:16,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:44:16,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:44:16,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:44:16,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:44:16,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:44:14" (1/3) ... [2019-09-08 12:44:16,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbe4624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:44:16, skipping insertion in model container [2019-09-08 12:44:16,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:44:15" (2/3) ... [2019-09-08 12:44:16,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbe4624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:44:16, skipping insertion in model container [2019-09-08 12:44:16,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:44:16" (3/3) ... [2019-09-08 12:44:16,494 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:44:16,504 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:44:16,515 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:44:16,532 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:44:16,569 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:44:16,569 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:44:16,569 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:44:16,569 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:44:16,570 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:44:16,570 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:44:16,570 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:44:16,570 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:44:16,570 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:44:16,592 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-09-08 12:44:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:44:16,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:16,603 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:16,604 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:16,609 INFO L82 PathProgramCache]: Analyzing trace with hash -134323180, now seen corresponding path program 1 times [2019-09-08 12:44:16,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:16,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:16,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:17,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:17,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:17,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:17,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:17,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:17,203 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-09-08 12:44:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:17,298 INFO L93 Difference]: Finished difference Result 307 states and 497 transitions. [2019-09-08 12:44:17,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:17,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-08 12:44:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:17,314 INFO L225 Difference]: With dead ends: 307 [2019-09-08 12:44:17,314 INFO L226 Difference]: Without dead ends: 213 [2019-09-08 12:44:17,318 INFO L628 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-09-08 12:44:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-08 12:44:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-09-08 12:44:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-08 12:44:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2019-09-08 12:44:17,379 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 91 [2019-09-08 12:44:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:17,380 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2019-09-08 12:44:17,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2019-09-08 12:44:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 12:44:17,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:17,384 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:17,385 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1153087707, now seen corresponding path program 1 times [2019-09-08 12:44:17,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:17,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:17,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:17,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:17,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:17,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:17,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:17,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:17,617 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand 3 states. [2019-09-08 12:44:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:17,681 INFO L93 Difference]: Finished difference Result 503 states and 766 transitions. [2019-09-08 12:44:17,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:17,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-08 12:44:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:17,686 INFO L225 Difference]: With dead ends: 503 [2019-09-08 12:44:17,686 INFO L226 Difference]: Without dead ends: 349 [2019-09-08 12:44:17,688 INFO L628 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-09-08 12:44:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-09-08 12:44:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-09-08 12:44:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-09-08 12:44:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 518 transitions. [2019-09-08 12:44:17,727 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 518 transitions. Word has length 92 [2019-09-08 12:44:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:17,731 INFO L475 AbstractCegarLoop]: Abstraction has 347 states and 518 transitions. [2019-09-08 12:44:17,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 518 transitions. [2019-09-08 12:44:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:44:17,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:17,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:17,733 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash 453064733, now seen corresponding path program 1 times [2019-09-08 12:44:17,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:17,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:17,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:17,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:17,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:17,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:17,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:17,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:17,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:17,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:17,928 INFO L87 Difference]: Start difference. First operand 347 states and 518 transitions. Second operand 3 states. [2019-09-08 12:44:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:18,018 INFO L93 Difference]: Finished difference Result 895 states and 1388 transitions. [2019-09-08 12:44:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:18,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 12:44:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:18,024 INFO L225 Difference]: With dead ends: 895 [2019-09-08 12:44:18,025 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 12:44:18,027 INFO L628 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-09-08 12:44:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 12:44:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-09-08 12:44:18,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 12:44:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 922 transitions. [2019-09-08 12:44:18,105 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 922 transitions. Word has length 93 [2019-09-08 12:44:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:18,105 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 922 transitions. [2019-09-08 12:44:18,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 922 transitions. [2019-09-08 12:44:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 12:44:18,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:18,108 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:18,108 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1052328474, now seen corresponding path program 1 times [2019-09-08 12:44:18,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:18,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:18,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:18,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:18,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:18,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:18,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:18,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:18,227 INFO L87 Difference]: Start difference. First operand 603 states and 922 transitions. Second operand 3 states. [2019-09-08 12:44:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:18,288 INFO L93 Difference]: Finished difference Result 1631 states and 2548 transitions. [2019-09-08 12:44:18,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:18,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-08 12:44:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:18,300 INFO L225 Difference]: With dead ends: 1631 [2019-09-08 12:44:18,300 INFO L226 Difference]: Without dead ends: 1085 [2019-09-08 12:44:18,303 INFO L628 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-09-08 12:44:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-08 12:44:18,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1083. [2019-09-08 12:44:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2019-09-08 12:44:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1674 transitions. [2019-09-08 12:44:18,364 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1674 transitions. Word has length 94 [2019-09-08 12:44:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:18,365 INFO L475 AbstractCegarLoop]: Abstraction has 1083 states and 1674 transitions. [2019-09-08 12:44:18,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1674 transitions. [2019-09-08 12:44:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:44:18,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:18,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:18,373 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:18,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash 178473406, now seen corresponding path program 1 times [2019-09-08 12:44:18,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:18,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:18,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:18,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:18,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:18,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:18,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:18,494 INFO L87 Difference]: Start difference. First operand 1083 states and 1674 transitions. Second operand 3 states. [2019-09-08 12:44:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:18,596 INFO L93 Difference]: Finished difference Result 3007 states and 4700 transitions. [2019-09-08 12:44:18,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:18,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 12:44:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:18,608 INFO L225 Difference]: With dead ends: 3007 [2019-09-08 12:44:18,608 INFO L226 Difference]: Without dead ends: 1981 [2019-09-08 12:44:18,611 INFO L628 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-09-08 12:44:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-09-08 12:44:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1979. [2019-09-08 12:44:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2019-09-08 12:44:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 3066 transitions. [2019-09-08 12:44:18,708 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 3066 transitions. Word has length 95 [2019-09-08 12:44:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:18,709 INFO L475 AbstractCegarLoop]: Abstraction has 1979 states and 3066 transitions. [2019-09-08 12:44:18,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 3066 transitions. [2019-09-08 12:44:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 12:44:18,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:18,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:18,712 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash -502513908, now seen corresponding path program 1 times [2019-09-08 12:44:18,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:18,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:18,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:18,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:18,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:18,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:18,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:18,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:18,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:18,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:18,841 INFO L87 Difference]: Start difference. First operand 1979 states and 3066 transitions. Second operand 3 states. [2019-09-08 12:44:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:19,018 INFO L93 Difference]: Finished difference Result 5567 states and 8668 transitions. [2019-09-08 12:44:19,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:19,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-08 12:44:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:19,040 INFO L225 Difference]: With dead ends: 5567 [2019-09-08 12:44:19,040 INFO L226 Difference]: Without dead ends: 3645 [2019-09-08 12:44:19,045 INFO L628 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-09-08 12:44:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3645 states. [2019-09-08 12:44:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3643. [2019-09-08 12:44:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:44:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5626 transitions. [2019-09-08 12:44:19,255 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5626 transitions. Word has length 96 [2019-09-08 12:44:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:19,257 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5626 transitions. [2019-09-08 12:44:19,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5626 transitions. [2019-09-08 12:44:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:44:19,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:19,265 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:19,265 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1106092338, now seen corresponding path program 1 times [2019-09-08 12:44:19,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:19,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:19,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:19,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:19,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:19,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:19,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:19,535 INFO L87 Difference]: Start difference. First operand 3643 states and 5626 transitions. Second operand 5 states. [2019-09-08 12:44:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:19,988 INFO L93 Difference]: Finished difference Result 7229 states and 11195 transitions. [2019-09-08 12:44:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:19,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:44:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:20,010 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:44:20,010 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:44:20,018 INFO L628 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-09-08 12:44:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:44:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:44:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:44:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5594 transitions. [2019-09-08 12:44:20,258 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5594 transitions. Word has length 97 [2019-09-08 12:44:20,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:20,259 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5594 transitions. [2019-09-08 12:44:20,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:20,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5594 transitions. [2019-09-08 12:44:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:44:20,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:20,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:20,261 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1467544083, now seen corresponding path program 1 times [2019-09-08 12:44:20,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:20,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:20,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:20,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:20,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:20,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:20,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:20,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:20,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:20,397 INFO L87 Difference]: Start difference. First operand 3643 states and 5594 transitions. Second operand 5 states. [2019-09-08 12:44:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:20,758 INFO L93 Difference]: Finished difference Result 7229 states and 11131 transitions. [2019-09-08 12:44:20,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:20,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:44:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:20,783 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:44:20,783 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:44:20,794 INFO L628 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-09-08 12:44:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:44:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:44:21,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:44:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5562 transitions. [2019-09-08 12:44:21,110 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5562 transitions. Word has length 97 [2019-09-08 12:44:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:21,110 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5562 transitions. [2019-09-08 12:44:21,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5562 transitions. [2019-09-08 12:44:21,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:44:21,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:21,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:21,113 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:21,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:21,114 INFO L82 PathProgramCache]: Analyzing trace with hash -193676078, now seen corresponding path program 1 times [2019-09-08 12:44:21,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:21,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:21,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:21,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:21,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:21,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:21,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:21,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:21,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:21,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:21,265 INFO L87 Difference]: Start difference. First operand 3643 states and 5562 transitions. Second operand 5 states. [2019-09-08 12:44:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:21,821 INFO L93 Difference]: Finished difference Result 7229 states and 11067 transitions. [2019-09-08 12:44:21,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:21,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:44:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:21,847 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:44:21,848 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:44:21,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:44:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:44:22,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:44:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:44:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5530 transitions. [2019-09-08 12:44:22,201 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5530 transitions. Word has length 97 [2019-09-08 12:44:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:22,201 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5530 transitions. [2019-09-08 12:44:22,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5530 transitions. [2019-09-08 12:44:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:44:22,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:22,204 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:22,204 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:22,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:22,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1657747635, now seen corresponding path program 1 times [2019-09-08 12:44:22,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:22,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:22,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:22,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:22,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:22,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:22,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:22,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:22,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:22,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:22,353 INFO L87 Difference]: Start difference. First operand 3643 states and 5530 transitions. Second operand 5 states. [2019-09-08 12:44:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:22,981 INFO L93 Difference]: Finished difference Result 7229 states and 11003 transitions. [2019-09-08 12:44:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:22,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:44:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:23,007 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:44:23,007 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:44:23,018 INFO L628 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-09-08 12:44:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:44:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:44:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:44:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5498 transitions. [2019-09-08 12:44:23,282 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5498 transitions. Word has length 97 [2019-09-08 12:44:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:23,282 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5498 transitions. [2019-09-08 12:44:23,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5498 transitions. [2019-09-08 12:44:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:44:23,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:23,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:23,284 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:23,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1190190066, now seen corresponding path program 1 times [2019-09-08 12:44:23,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:23,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:23,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:23,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:23,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:23,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:23,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:23,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:23,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:23,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:23,377 INFO L87 Difference]: Start difference. First operand 3643 states and 5498 transitions. Second operand 5 states. [2019-09-08 12:44:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:23,861 INFO L93 Difference]: Finished difference Result 7229 states and 10939 transitions. [2019-09-08 12:44:23,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:44:23,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:44:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:23,895 INFO L225 Difference]: With dead ends: 7229 [2019-09-08 12:44:23,895 INFO L226 Difference]: Without dead ends: 3643 [2019-09-08 12:44:23,902 INFO L628 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-09-08 12:44:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-08 12:44:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3643. [2019-09-08 12:44:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3643 states. [2019-09-08 12:44:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 5466 transitions. [2019-09-08 12:44:24,176 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 5466 transitions. Word has length 97 [2019-09-08 12:44:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:24,176 INFO L475 AbstractCegarLoop]: Abstraction has 3643 states and 5466 transitions. [2019-09-08 12:44:24,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 5466 transitions. [2019-09-08 12:44:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:44:24,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:24,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:24,178 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:24,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1777392041, now seen corresponding path program 1 times [2019-09-08 12:44:24,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:24,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:24,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:24,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:24,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:24,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:24,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:24,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:24,385 INFO L87 Difference]: Start difference. First operand 3643 states and 5466 transitions. Second operand 9 states. [2019-09-08 12:44:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:27,961 INFO L93 Difference]: Finished difference Result 50261 states and 75783 transitions. [2019-09-08 12:44:27,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:44:27,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-08 12:44:27,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:28,083 INFO L225 Difference]: With dead ends: 50261 [2019-09-08 12:44:28,084 INFO L226 Difference]: Without dead ends: 46675 [2019-09-08 12:44:28,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:44:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46675 states. [2019-09-08 12:44:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46675 to 10811. [2019-09-08 12:44:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10811 states. [2019-09-08 12:44:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10811 states to 10811 states and 16154 transitions. [2019-09-08 12:44:30,237 INFO L78 Accepts]: Start accepts. Automaton has 10811 states and 16154 transitions. Word has length 97 [2019-09-08 12:44:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:30,238 INFO L475 AbstractCegarLoop]: Abstraction has 10811 states and 16154 transitions. [2019-09-08 12:44:30,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 10811 states and 16154 transitions. [2019-09-08 12:44:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:44:30,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:30,239 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:30,240 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:30,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:30,240 INFO L82 PathProgramCache]: Analyzing trace with hash 430043314, now seen corresponding path program 1 times [2019-09-08 12:44:30,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:30,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:30,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:30,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:30,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:30,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:30,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:30,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:30,337 INFO L87 Difference]: Start difference. First operand 10811 states and 16154 transitions. Second operand 3 states. [2019-09-08 12:44:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:31,629 INFO L93 Difference]: Finished difference Result 28031 states and 41724 transitions. [2019-09-08 12:44:31,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:31,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 12:44:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:31,665 INFO L225 Difference]: With dead ends: 28031 [2019-09-08 12:44:31,666 INFO L226 Difference]: Without dead ends: 17277 [2019-09-08 12:44:31,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:31,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17277 states. [2019-09-08 12:44:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17277 to 17147. [2019-09-08 12:44:32,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17147 states. [2019-09-08 12:44:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17147 states to 17147 states and 25178 transitions. [2019-09-08 12:44:32,912 INFO L78 Accepts]: Start accepts. Automaton has 17147 states and 25178 transitions. Word has length 99 [2019-09-08 12:44:32,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:32,912 INFO L475 AbstractCegarLoop]: Abstraction has 17147 states and 25178 transitions. [2019-09-08 12:44:32,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 17147 states and 25178 transitions. [2019-09-08 12:44:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:44:32,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:32,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:32,914 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:32,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash 450092657, now seen corresponding path program 1 times [2019-09-08 12:44:32,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:32,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:32,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:32,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:33,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:33,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:44:33,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:44:33,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:44:33,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:44:33,294 INFO L87 Difference]: Start difference. First operand 17147 states and 25178 transitions. Second operand 9 states. [2019-09-08 12:44:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:36,276 INFO L93 Difference]: Finished difference Result 47747 states and 70014 transitions. [2019-09-08 12:44:36,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:44:36,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:44:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:36,325 INFO L225 Difference]: With dead ends: 47747 [2019-09-08 12:44:36,325 INFO L226 Difference]: Without dead ends: 30657 [2019-09-08 12:44:36,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:44:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30657 states. [2019-09-08 12:44:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30657 to 30651. [2019-09-08 12:44:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30651 states. [2019-09-08 12:44:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30651 states to 30651 states and 44762 transitions. [2019-09-08 12:44:38,401 INFO L78 Accepts]: Start accepts. Automaton has 30651 states and 44762 transitions. Word has length 99 [2019-09-08 12:44:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:38,401 INFO L475 AbstractCegarLoop]: Abstraction has 30651 states and 44762 transitions. [2019-09-08 12:44:38,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:44:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 30651 states and 44762 transitions. [2019-09-08 12:44:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:44:38,403 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:38,403 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:38,403 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:38,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1066061208, now seen corresponding path program 1 times [2019-09-08 12:44:38,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:38,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:38,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:38,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:38,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:44:38,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:44:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:44:38,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:44:38,507 INFO L87 Difference]: Start difference. First operand 30651 states and 44762 transitions. Second operand 5 states. [2019-09-08 12:44:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:43,378 INFO L93 Difference]: Finished difference Result 56190 states and 81865 transitions. [2019-09-08 12:44:43,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:44:43,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 12:44:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:43,432 INFO L225 Difference]: With dead ends: 56190 [2019-09-08 12:44:43,432 INFO L226 Difference]: Without dead ends: 56188 [2019-09-08 12:44:43,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:44:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56188 states. [2019-09-08 12:44:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56188 to 31419. [2019-09-08 12:44:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31419 states. [2019-09-08 12:44:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31419 states to 31419 states and 45466 transitions. [2019-09-08 12:44:45,727 INFO L78 Accepts]: Start accepts. Automaton has 31419 states and 45466 transitions. Word has length 100 [2019-09-08 12:44:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:45,727 INFO L475 AbstractCegarLoop]: Abstraction has 31419 states and 45466 transitions. [2019-09-08 12:44:45,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:44:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 31419 states and 45466 transitions. [2019-09-08 12:44:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:44:45,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:45,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:45,729 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:45,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:45,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2144763645, now seen corresponding path program 1 times [2019-09-08 12:44:45,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:45,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:45,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:45,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:44:45,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:44:45,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:44:45,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:44:45,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:44:45,795 INFO L87 Difference]: Start difference. First operand 31419 states and 45466 transitions. Second operand 3 states. [2019-09-08 12:44:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:44:49,191 INFO L93 Difference]: Finished difference Result 65346 states and 95072 transitions. [2019-09-08 12:44:49,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:44:49,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 12:44:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:44:49,241 INFO L225 Difference]: With dead ends: 65346 [2019-09-08 12:44:49,241 INFO L226 Difference]: Without dead ends: 46783 [2019-09-08 12:44:49,266 INFO L628 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-09-08 12:44:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46783 states. [2019-09-08 12:44:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46783 to 46781. [2019-09-08 12:44:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46781 states. [2019-09-08 12:44:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46781 states to 46781 states and 67388 transitions. [2019-09-08 12:44:53,751 INFO L78 Accepts]: Start accepts. Automaton has 46781 states and 67388 transitions. Word has length 100 [2019-09-08 12:44:53,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:44:53,751 INFO L475 AbstractCegarLoop]: Abstraction has 46781 states and 67388 transitions. [2019-09-08 12:44:53,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:44:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 46781 states and 67388 transitions. [2019-09-08 12:44:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:44:53,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:44:53,765 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:44:53,765 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:44:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:44:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1614271803, now seen corresponding path program 1 times [2019-09-08 12:44:53,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:44:53,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:44:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:53,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:44:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:44:53,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:44:53,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-08 12:44:53,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:44:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:44:54,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:44:54,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:44:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:44:54,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:44:54,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:44:54,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:44:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:44:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:44:54,376 INFO L87 Difference]: Start difference. First operand 46781 states and 67388 transitions. Second operand 12 states. [2019-09-08 12:45:22,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:45:22,933 INFO L93 Difference]: Finished difference Result 383921 states and 552758 transitions. [2019-09-08 12:45:22,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:45:22,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:45:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:45:24,085 INFO L225 Difference]: With dead ends: 383921 [2019-09-08 12:45:24,085 INFO L226 Difference]: Without dead ends: 357103 [2019-09-08 12:45:24,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:45:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357103 states. [2019-09-08 12:45:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357103 to 87165. [2019-09-08 12:45:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87165 states. [2019-09-08 12:45:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87165 states to 87165 states and 125628 transitions. [2019-09-08 12:45:36,207 INFO L78 Accepts]: Start accepts. Automaton has 87165 states and 125628 transitions. Word has length 135 [2019-09-08 12:45:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:45:36,207 INFO L475 AbstractCegarLoop]: Abstraction has 87165 states and 125628 transitions. [2019-09-08 12:45:36,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:45:36,208 INFO L276 IsEmpty]: Start isEmpty. Operand 87165 states and 125628 transitions. [2019-09-08 12:45:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:45:36,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:45:36,226 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:45:36,226 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:45:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:45:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2110676875, now seen corresponding path program 1 times [2019-09-08 12:45:36,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:45:36,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:45:36,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:36,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:45:36,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:45:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:45:36,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:45:36,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-08 12:45:36,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:45:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:45:37,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:45:37,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:45:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 12:45:37,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:45:37,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:45:37,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:45:37,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:45:37,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:45:37,310 INFO L87 Difference]: Start difference. First operand 87165 states and 125628 transitions. Second operand 12 states. [2019-09-08 12:46:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:05,643 INFO L93 Difference]: Finished difference Result 397477 states and 571440 transitions. [2019-09-08 12:46:05,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:46:05,644 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:46:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:06,079 INFO L225 Difference]: With dead ends: 397477 [2019-09-08 12:46:06,079 INFO L226 Difference]: Without dead ends: 310371 [2019-09-08 12:46:06,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:46:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310371 states. [2019-09-08 12:46:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310371 to 134141. [2019-09-08 12:46:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134141 states. [2019-09-08 12:46:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134141 states to 134141 states and 193788 transitions. [2019-09-08 12:46:18,217 INFO L78 Accepts]: Start accepts. Automaton has 134141 states and 193788 transitions. Word has length 135 [2019-09-08 12:46:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:46:18,217 INFO L475 AbstractCegarLoop]: Abstraction has 134141 states and 193788 transitions. [2019-09-08 12:46:18,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:46:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 134141 states and 193788 transitions. [2019-09-08 12:46:18,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:46:18,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:46:18,233 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:46:18,233 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:46:18,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:46:18,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1788947165, now seen corresponding path program 1 times [2019-09-08 12:46:18,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:46:18,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:46:18,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:18,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:46:18,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:46:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:18,360 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:46:18,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:46:18,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-08 12:46:18,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:46:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:46:18,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:46:18,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:46:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 12:46:18,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:46:18,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:46:18,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:46:18,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:46:18,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:46:18,704 INFO L87 Difference]: Start difference. First operand 134141 states and 193788 transitions. Second operand 12 states. [2019-09-08 12:46:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:46:56,343 INFO L93 Difference]: Finished difference Result 491429 states and 707760 transitions. [2019-09-08 12:46:56,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:46:56,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:46:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:46:56,780 INFO L225 Difference]: With dead ends: 491429 [2019-09-08 12:46:56,780 INFO L226 Difference]: Without dead ends: 357347 [2019-09-08 12:46:56,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:46:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357347 states. [2019-09-08 12:47:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357347 to 174333. [2019-09-08 12:47:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174333 states. [2019-09-08 12:47:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174333 states to 174333 states and 251964 transitions. [2019-09-08 12:47:15,104 INFO L78 Accepts]: Start accepts. Automaton has 174333 states and 251964 transitions. Word has length 135 [2019-09-08 12:47:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:47:15,104 INFO L475 AbstractCegarLoop]: Abstraction has 174333 states and 251964 transitions. [2019-09-08 12:47:15,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:47:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 174333 states and 251964 transitions. [2019-09-08 12:47:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:47:15,119 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:47:15,119 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:47:15,120 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:47:15,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:47:15,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1812692387, now seen corresponding path program 1 times [2019-09-08 12:47:15,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:47:15,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:47:15,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:15,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:15,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:47:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:47:15,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:47:15,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-08 12:47:15,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:47:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:47:15,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:47:15,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:47:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 12:47:15,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:47:15,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:47:15,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:47:15,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:47:15,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:47:15,603 INFO L87 Difference]: Start difference. First operand 174333 states and 251964 transitions. Second operand 12 states. [2019-09-08 12:48:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:48:02,626 INFO L93 Difference]: Finished difference Result 594789 states and 857168 transitions. [2019-09-08 12:48:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:48:02,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:48:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:48:03,200 INFO L225 Difference]: With dead ends: 594789 [2019-09-08 12:48:03,200 INFO L226 Difference]: Without dead ends: 420515 [2019-09-08 12:48:03,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=578, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:48:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420515 states. [2019-09-08 12:48:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420515 to 207741. [2019-09-08 12:48:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207741 states. [2019-09-08 12:48:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207741 states to 207741 states and 300284 transitions. [2019-09-08 12:48:30,055 INFO L78 Accepts]: Start accepts. Automaton has 207741 states and 300284 transitions. Word has length 135 [2019-09-08 12:48:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:48:30,056 INFO L475 AbstractCegarLoop]: Abstraction has 207741 states and 300284 transitions. [2019-09-08 12:48:30,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:48:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 207741 states and 300284 transitions. [2019-09-08 12:48:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:48:30,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:48:30,071 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:48:30,071 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:48:30,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:48:30,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1416421271, now seen corresponding path program 1 times [2019-09-08 12:48:30,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:48:30,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:48:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:30,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:48:30,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:48:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:48:30,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:48:30,186 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:48:30,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:48:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:48:30,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:48:30,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:48:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-08 12:48:30,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:48:30,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:48:30,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:48:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:48:30,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:48:30,542 INFO L87 Difference]: Start difference. First operand 207741 states and 300284 transitions. Second operand 12 states. [2019-09-08 12:49:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:49:27,877 INFO L93 Difference]: Finished difference Result 681445 states and 982416 transitions. [2019-09-08 12:49:27,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:49:27,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:49:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:49:28,510 INFO L225 Difference]: With dead ends: 681445 [2019-09-08 12:49:28,510 INFO L226 Difference]: Without dead ends: 473763 [2019-09-08 12:49:28,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:49:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473763 states. [2019-09-08 12:50:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473763 to 241149. [2019-09-08 12:50:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241149 states. [2019-09-08 12:50:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241149 states to 241149 states and 348604 transitions. [2019-09-08 12:50:01,329 INFO L78 Accepts]: Start accepts. Automaton has 241149 states and 348604 transitions. Word has length 135 [2019-09-08 12:50:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:01,329 INFO L475 AbstractCegarLoop]: Abstraction has 241149 states and 348604 transitions. [2019-09-08 12:50:01,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:50:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 241149 states and 348604 transitions. [2019-09-08 12:50:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:50:01,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:01,341 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:01,342 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:01,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash -495936559, now seen corresponding path program 1 times [2019-09-08 12:50:01,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:01,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:01,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:01,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:01,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:50:01,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:50:01,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:50:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:01,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 12:50:01,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:50:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 12:50:01,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:50:01,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 12:50:01,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:50:01,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:50:01,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:50:01,813 INFO L87 Difference]: Start difference. First operand 241149 states and 348604 transitions. Second operand 12 states. [2019-09-08 12:51:07,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:07,302 INFO L93 Difference]: Finished difference Result 758181 states and 1093360 transitions. [2019-09-08 12:51:07,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:51:07,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 12:51:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:07,978 INFO L225 Difference]: With dead ends: 758181 [2019-09-08 12:51:07,978 INFO L226 Difference]: Without dead ends: 517091 [2019-09-08 12:51:08,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=615, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:51:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517091 states. [2019-09-08 12:51:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517091 to 274557. [2019-09-08 12:51:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274557 states. [2019-09-08 12:51:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274557 states to 274557 states and 396924 transitions. [2019-09-08 12:51:45,439 INFO L78 Accepts]: Start accepts. Automaton has 274557 states and 396924 transitions. Word has length 135 [2019-09-08 12:51:45,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:45,440 INFO L475 AbstractCegarLoop]: Abstraction has 274557 states and 396924 transitions. [2019-09-08 12:51:45,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:51:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 274557 states and 396924 transitions. [2019-09-08 12:51:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:51:45,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:45,452 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 12:51:45,452 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1796801820, now seen corresponding path program 1 times [2019-09-08 12:51:45,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:45,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:45,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:45,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:51:45,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:45,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:45,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:45,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:45,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:45,646 INFO L87 Difference]: Start difference. First operand 274557 states and 396924 transitions. Second operand 9 states. [2019-09-08 12:52:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:52,075 INFO L93 Difference]: Finished difference Result 704461 states and 1018308 transitions. [2019-09-08 12:52:52,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:52:52,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:52:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:52,849 INFO L225 Difference]: With dead ends: 704461 [2019-09-08 12:52:52,849 INFO L226 Difference]: Without dead ends: 589131 [2019-09-08 12:52:52,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:52:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589131 states. [2019-09-08 12:53:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589131 to 298109. [2019-09-08 12:53:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298109 states. [2019-09-08 12:53:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298109 states to 298109 states and 430492 transitions. [2019-09-08 12:53:35,750 INFO L78 Accepts]: Start accepts. Automaton has 298109 states and 430492 transitions. Word has length 136 [2019-09-08 12:53:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:35,750 INFO L475 AbstractCegarLoop]: Abstraction has 298109 states and 430492 transitions. [2019-09-08 12:53:35,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 298109 states and 430492 transitions. [2019-09-08 12:53:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:53:35,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:35,765 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:35,765 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash 658413086, now seen corresponding path program 1 times [2019-09-08 12:53:35,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:35,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:35,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:35,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:35,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:35,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:53:35,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:53:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:53:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:53:35,844 INFO L87 Difference]: Start difference. First operand 298109 states and 430492 transitions. Second operand 3 states. [2019-09-08 12:54:04,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:04,072 INFO L93 Difference]: Finished difference Result 542387 states and 784986 transitions. [2019-09-08 12:54:04,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:04,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-08 12:54:04,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:04,373 INFO L225 Difference]: With dead ends: 542387 [2019-09-08 12:54:04,373 INFO L226 Difference]: Without dead ends: 244337 [2019-09-08 12:54:04,528 INFO L628 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-09-08 12:54:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244337 states. [2019-09-08 12:54:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244337 to 244335. [2019-09-08 12:54:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244335 states. [2019-09-08 12:54:28,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244335 states to 244335 states and 352247 transitions. [2019-09-08 12:54:28,942 INFO L78 Accepts]: Start accepts. Automaton has 244335 states and 352247 transitions. Word has length 137 [2019-09-08 12:54:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:28,942 INFO L475 AbstractCegarLoop]: Abstraction has 244335 states and 352247 transitions. [2019-09-08 12:54:28,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 244335 states and 352247 transitions. [2019-09-08 12:54:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 12:54:28,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:28,954 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:28,954 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:28,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:28,954 INFO L82 PathProgramCache]: Analyzing trace with hash -99959780, now seen corresponding path program 1 times [2019-09-08 12:54:28,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:28,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:28,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:28,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:28,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:29,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:54:29,196 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:54:29,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:29,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:54:29,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:54:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream closed [2019-09-08 12:54:29,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:54:29,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 12:54:29,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:54:29,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:54:29,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:54:29,501 INFO L87 Difference]: Start difference. First operand 244335 states and 352247 transitions. Second operand 12 states.