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-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:51:04,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:51:04,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:51:04,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:51:04,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:51:04,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:51:04,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:51:04,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:51:04,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:51:04,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:51:04,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:51:04,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:51:04,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:51:04,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:51:04,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:51:04,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:51:04,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:51:04,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:51:04,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:51:04,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:51:04,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:51:04,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:51:04,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:51:04,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:51:04,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:51:04,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:51:04,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:51:04,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:51:04,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:51:04,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:51:04,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:51:04,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:51:04,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:51:04,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:51:04,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:51:04,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:51:04,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:51:04,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:51:04,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:51:04,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:51:04,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:51:04,598 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 10:51:04,617 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:51:04,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:51:04,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:51:04,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:51:04,620 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:51:04,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:51:04,620 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:51:04,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:51:04,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:51:04,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:51:04,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:51:04,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:51:04,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:51:04,622 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:51:04,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:51:04,623 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:51:04,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:51:04,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:51:04,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:51:04,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:51:04,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:51:04,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:51:04,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:51:04,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:51:04,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:51:04,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:51:04,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:51:04,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:51:04,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:51:04,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:51:04,678 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:51:04,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:51:04,682 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:51:04,683 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:51:04,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:51:04,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34b274a2/c7c74e071d6e4b528a292c98475e0d24/FLAG798897abc [2019-09-08 10:51:05,267 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:51:05,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:51:05,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34b274a2/c7c74e071d6e4b528a292c98475e0d24/FLAG798897abc [2019-09-08 10:51:05,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34b274a2/c7c74e071d6e4b528a292c98475e0d24 [2019-09-08 10:51:05,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:51:05,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:51:05,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:51:05,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:51:05,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:51:05,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:51:05" (1/1) ... [2019-09-08 10:51:05,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b46dfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:05, skipping insertion in model container [2019-09-08 10:51:05,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:51:05" (1/1) ... [2019-09-08 10:51:05,645 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:51:05,694 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:51:06,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:51:06,090 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:51:06,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:51:06,201 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:51:06,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06 WrapperNode [2019-09-08 10:51:06,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:51:06,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:51:06,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:51:06,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:51:06,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06" (1/1) ... [2019-09-08 10:51:06,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06" (1/1) ... [2019-09-08 10:51:06,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06" (1/1) ... [2019-09-08 10:51:06,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06" (1/1) ... [2019-09-08 10:51:06,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06" (1/1) ... [2019-09-08 10:51:06,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06" (1/1) ... [2019-09-08 10:51:06,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06" (1/1) ... [2019-09-08 10:51:06,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:51:06,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:51:06,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:51:06,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:51:06,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06" (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 10:51:06,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:51:06,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:51:06,335 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:51:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:51:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:51:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:51:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:51:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:51:06,336 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:51:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:51:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:51:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:51:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:51:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:51:06,337 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:51:06,338 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:51:06,338 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:51:06,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:51:06,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:51:06,974 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:51:06,975 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:51:06,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:51:06 BoogieIcfgContainer [2019-09-08 10:51:06,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:51:06,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:51:06,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:51:06,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:51:06,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:51:05" (1/3) ... [2019-09-08 10:51:06,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b129e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:51:06, skipping insertion in model container [2019-09-08 10:51:06,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:51:06" (2/3) ... [2019-09-08 10:51:06,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b129e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:51:06, skipping insertion in model container [2019-09-08 10:51:06,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:51:06" (3/3) ... [2019-09-08 10:51:06,985 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:51:06,994 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:51:07,002 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:51:07,020 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:51:07,052 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:51:07,053 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:51:07,053 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:51:07,053 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:51:07,054 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:51:07,054 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:51:07,054 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:51:07,054 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:51:07,054 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:51:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-09-08 10:51:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 10:51:07,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:07,087 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] [2019-09-08 10:51:07,089 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1173815041, now seen corresponding path program 1 times [2019-09-08 10:51:07,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:07,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:07,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:07,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:07,475 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 10:51:07,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:07,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:07,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:07,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:07,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:07,501 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-09-08 10:51:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:07,586 INFO L93 Difference]: Finished difference Result 267 states and 426 transitions. [2019-09-08 10:51:07,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:07,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-08 10:51:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:07,611 INFO L225 Difference]: With dead ends: 267 [2019-09-08 10:51:07,612 INFO L226 Difference]: Without dead ends: 175 [2019-09-08 10:51:07,620 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 10:51:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-08 10:51:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2019-09-08 10:51:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-08 10:51:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2019-09-08 10:51:07,710 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 52 [2019-09-08 10:51:07,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:07,711 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2019-09-08 10:51:07,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:51:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2019-09-08 10:51:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-08 10:51:07,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:07,714 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] [2019-09-08 10:51:07,714 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:07,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1357822606, now seen corresponding path program 1 times [2019-09-08 10:51:07,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:07,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:07,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:07,873 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 10:51:07,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:07,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:07,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:07,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:07,877 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand 3 states. [2019-09-08 10:51:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:07,955 INFO L93 Difference]: Finished difference Result 425 states and 657 transitions. [2019-09-08 10:51:07,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:07,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-08 10:51:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:07,961 INFO L225 Difference]: With dead ends: 425 [2019-09-08 10:51:07,961 INFO L226 Difference]: Without dead ends: 283 [2019-09-08 10:51:07,965 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 10:51:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-08 10:51:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2019-09-08 10:51:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-09-08 10:51:08,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 428 transitions. [2019-09-08 10:51:08,015 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 428 transitions. Word has length 53 [2019-09-08 10:51:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:08,015 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 428 transitions. [2019-09-08 10:51:08,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:51:08,015 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 428 transitions. [2019-09-08 10:51:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:51:08,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:08,019 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] [2019-09-08 10:51:08,019 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1224986484, now seen corresponding path program 1 times [2019-09-08 10:51:08,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:08,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:08,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:08,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:08,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:08,138 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 10:51:08,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:08,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:08,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:08,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:08,140 INFO L87 Difference]: Start difference. First operand 281 states and 428 transitions. Second operand 3 states. [2019-09-08 10:51:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:08,225 INFO L93 Difference]: Finished difference Result 717 states and 1118 transitions. [2019-09-08 10:51:08,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:08,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-08 10:51:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:08,231 INFO L225 Difference]: With dead ends: 717 [2019-09-08 10:51:08,232 INFO L226 Difference]: Without dead ends: 467 [2019-09-08 10:51:08,234 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 10:51:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-08 10:51:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2019-09-08 10:51:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 10:51:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 716 transitions. [2019-09-08 10:51:08,289 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 716 transitions. Word has length 54 [2019-09-08 10:51:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:08,291 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 716 transitions. [2019-09-08 10:51:08,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:51:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 716 transitions. [2019-09-08 10:51:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:51:08,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:08,300 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] [2019-09-08 10:51:08,300 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash 781354829, now seen corresponding path program 1 times [2019-09-08 10:51:08,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:08,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:08,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:08,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:08,434 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 10:51:08,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:08,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:08,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:08,436 INFO L87 Difference]: Start difference. First operand 465 states and 716 transitions. Second operand 3 states. [2019-09-08 10:51:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:08,488 INFO L93 Difference]: Finished difference Result 1205 states and 1878 transitions. [2019-09-08 10:51:08,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:08,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:51:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:08,493 INFO L225 Difference]: With dead ends: 1205 [2019-09-08 10:51:08,494 INFO L226 Difference]: Without dead ends: 771 [2019-09-08 10:51:08,495 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 10:51:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-09-08 10:51:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 769. [2019-09-08 10:51:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-09-08 10:51:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1184 transitions. [2019-09-08 10:51:08,537 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1184 transitions. Word has length 55 [2019-09-08 10:51:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:08,538 INFO L475 AbstractCegarLoop]: Abstraction has 769 states and 1184 transitions. [2019-09-08 10:51:08,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:51:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1184 transitions. [2019-09-08 10:51:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:51:08,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:08,539 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] [2019-09-08 10:51:08,540 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:08,540 INFO L82 PathProgramCache]: Analyzing trace with hash -895952899, now seen corresponding path program 1 times [2019-09-08 10:51:08,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:08,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:08,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:08,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:08,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:08,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:08,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:51:08,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:51:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:51:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:51:08,642 INFO L87 Difference]: Start difference. First operand 769 states and 1184 transitions. Second operand 6 states. [2019-09-08 10:51:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:08,987 INFO L93 Difference]: Finished difference Result 4459 states and 6949 transitions. [2019-09-08 10:51:08,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:51:08,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:51:08,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:09,007 INFO L225 Difference]: With dead ends: 4459 [2019-09-08 10:51:09,008 INFO L226 Difference]: Without dead ends: 3721 [2019-09-08 10:51:09,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:51:09,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2019-09-08 10:51:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 1505. [2019-09-08 10:51:09,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2019-09-08 10:51:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2304 transitions. [2019-09-08 10:51:09,148 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2304 transitions. Word has length 56 [2019-09-08 10:51:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:09,149 INFO L475 AbstractCegarLoop]: Abstraction has 1505 states and 2304 transitions. [2019-09-08 10:51:09,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:51:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2304 transitions. [2019-09-08 10:51:09,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:51:09,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:09,150 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] [2019-09-08 10:51:09,150 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:09,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2023268854, now seen corresponding path program 1 times [2019-09-08 10:51:09,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:09,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:09,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:09,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:09,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:09,285 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 10:51:09,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:09,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:51:09,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:51:09,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:51:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:51:09,287 INFO L87 Difference]: Start difference. First operand 1505 states and 2304 transitions. Second operand 6 states. [2019-09-08 10:51:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:09,712 INFO L93 Difference]: Finished difference Result 6505 states and 9924 transitions. [2019-09-08 10:51:09,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:51:09,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-08 10:51:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:09,739 INFO L225 Difference]: With dead ends: 6505 [2019-09-08 10:51:09,740 INFO L226 Difference]: Without dead ends: 5031 [2019-09-08 10:51:09,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:51:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2019-09-08 10:51:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 5025. [2019-09-08 10:51:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-09-08 10:51:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 7616 transitions. [2019-09-08 10:51:10,121 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 7616 transitions. Word has length 57 [2019-09-08 10:51:10,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:10,122 INFO L475 AbstractCegarLoop]: Abstraction has 5025 states and 7616 transitions. [2019-09-08 10:51:10,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:51:10,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 7616 transitions. [2019-09-08 10:51:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:51:10,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:10,123 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] [2019-09-08 10:51:10,124 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:10,124 INFO L82 PathProgramCache]: Analyzing trace with hash -837113055, now seen corresponding path program 1 times [2019-09-08 10:51:10,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:10,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:10,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:10,195 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 10:51:10,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:10,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:51:10,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:51:10,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:51:10,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:51:10,197 INFO L87 Difference]: Start difference. First operand 5025 states and 7616 transitions. Second operand 5 states. [2019-09-08 10:51:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:11,060 INFO L93 Difference]: Finished difference Result 13909 states and 21122 transitions. [2019-09-08 10:51:11,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:51:11,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 10:51:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:11,107 INFO L225 Difference]: With dead ends: 13909 [2019-09-08 10:51:11,107 INFO L226 Difference]: Without dead ends: 8915 [2019-09-08 10:51:11,119 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 10:51:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8915 states. [2019-09-08 10:51:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 8913. [2019-09-08 10:51:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8913 states. [2019-09-08 10:51:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8913 states to 8913 states and 13424 transitions. [2019-09-08 10:51:11,891 INFO L78 Accepts]: Start accepts. Automaton has 8913 states and 13424 transitions. Word has length 59 [2019-09-08 10:51:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:11,892 INFO L475 AbstractCegarLoop]: Abstraction has 8913 states and 13424 transitions. [2019-09-08 10:51:11,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:51:11,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8913 states and 13424 transitions. [2019-09-08 10:51:11,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:51:11,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:11,893 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] [2019-09-08 10:51:11,894 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:11,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash 932858652, now seen corresponding path program 1 times [2019-09-08 10:51:11,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:11,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:11,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:11,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:11,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:12,006 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 10:51:12,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:12,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:51:12,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:51:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:51:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:51:12,008 INFO L87 Difference]: Start difference. First operand 8913 states and 13424 transitions. Second operand 5 states. [2019-09-08 10:51:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:13,133 INFO L93 Difference]: Finished difference Result 18243 states and 27265 transitions. [2019-09-08 10:51:13,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:51:13,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 10:51:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:13,193 INFO L225 Difference]: With dead ends: 18243 [2019-09-08 10:51:13,193 INFO L226 Difference]: Without dead ends: 18241 [2019-09-08 10:51:13,199 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 10:51:13,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18241 states. [2019-09-08 10:51:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18241 to 9361. [2019-09-08 10:51:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9361 states. [2019-09-08 10:51:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9361 states to 9361 states and 13872 transitions. [2019-09-08 10:51:14,059 INFO L78 Accepts]: Start accepts. Automaton has 9361 states and 13872 transitions. Word has length 59 [2019-09-08 10:51:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:14,059 INFO L475 AbstractCegarLoop]: Abstraction has 9361 states and 13872 transitions. [2019-09-08 10:51:14,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:51:14,060 INFO L276 IsEmpty]: Start isEmpty. Operand 9361 states and 13872 transitions. [2019-09-08 10:51:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:51:14,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:14,061 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] [2019-09-08 10:51:14,061 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1136533126, now seen corresponding path program 1 times [2019-09-08 10:51:14,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:14,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:14,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:14,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:14,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:14,113 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 10:51:14,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:14,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:14,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:14,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:14,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:14,115 INFO L87 Difference]: Start difference. First operand 9361 states and 13872 transitions. Second operand 3 states. [2019-09-08 10:51:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:14,787 INFO L93 Difference]: Finished difference Result 21055 states and 31136 transitions. [2019-09-08 10:51:14,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:14,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:51:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:14,814 INFO L225 Difference]: With dead ends: 21055 [2019-09-08 10:51:14,814 INFO L226 Difference]: Without dead ends: 11725 [2019-09-08 10:51:14,834 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 10:51:14,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11725 states. [2019-09-08 10:51:15,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11725 to 11723. [2019-09-08 10:51:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11723 states. [2019-09-08 10:51:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11723 states to 11723 states and 17238 transitions. [2019-09-08 10:51:16,001 INFO L78 Accepts]: Start accepts. Automaton has 11723 states and 17238 transitions. Word has length 60 [2019-09-08 10:51:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:16,001 INFO L475 AbstractCegarLoop]: Abstraction has 11723 states and 17238 transitions. [2019-09-08 10:51:16,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:51:16,002 INFO L276 IsEmpty]: Start isEmpty. Operand 11723 states and 17238 transitions. [2019-09-08 10:51:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:51:16,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:16,008 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:51:16,008 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash 324055568, now seen corresponding path program 1 times [2019-09-08 10:51:16,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:16,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:16,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:51:16,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:51:16,110 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 10:51:16,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:16,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 10:51:16,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:51:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 10:51:16,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:51:16,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2019-09-08 10:51:16,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:51:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:51:16,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:51:16,330 INFO L87 Difference]: Start difference. First operand 11723 states and 17238 transitions. Second operand 5 states. [2019-09-08 10:51:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:17,964 INFO L93 Difference]: Finished difference Result 30743 states and 45297 transitions. [2019-09-08 10:51:17,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:51:17,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 10:51:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:18,039 INFO L225 Difference]: With dead ends: 30743 [2019-09-08 10:51:18,039 INFO L226 Difference]: Without dead ends: 21413 [2019-09-08 10:51:18,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:51:18,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21413 states. [2019-09-08 10:51:19,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21413 to 20379. [2019-09-08 10:51:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20379 states. [2019-09-08 10:51:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20379 states to 20379 states and 29734 transitions. [2019-09-08 10:51:19,685 INFO L78 Accepts]: Start accepts. Automaton has 20379 states and 29734 transitions. Word has length 81 [2019-09-08 10:51:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:19,686 INFO L475 AbstractCegarLoop]: Abstraction has 20379 states and 29734 transitions. [2019-09-08 10:51:19,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:51:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 20379 states and 29734 transitions. [2019-09-08 10:51:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:51:19,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:19,693 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:51:19,693 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:19,694 INFO L82 PathProgramCache]: Analyzing trace with hash 429171158, now seen corresponding path program 1 times [2019-09-08 10:51:19,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:19,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:19,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:19,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:19,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:19,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:19,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:19,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:19,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:19,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:19,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:19,762 INFO L87 Difference]: Start difference. First operand 20379 states and 29734 transitions. Second operand 3 states. [2019-09-08 10:51:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:21,715 INFO L93 Difference]: Finished difference Result 50588 states and 73632 transitions. [2019-09-08 10:51:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:21,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 10:51:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:21,789 INFO L225 Difference]: With dead ends: 50588 [2019-09-08 10:51:21,789 INFO L226 Difference]: Without dead ends: 32754 [2019-09-08 10:51:21,824 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 10:51:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32754 states. [2019-09-08 10:51:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32754 to 31576. [2019-09-08 10:51:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31576 states. [2019-09-08 10:51:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31576 states to 31576 states and 45526 transitions. [2019-09-08 10:51:23,518 INFO L78 Accepts]: Start accepts. Automaton has 31576 states and 45526 transitions. Word has length 82 [2019-09-08 10:51:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:23,519 INFO L475 AbstractCegarLoop]: Abstraction has 31576 states and 45526 transitions. [2019-09-08 10:51:23,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:51:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 31576 states and 45526 transitions. [2019-09-08 10:51:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:51:23,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:23,528 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:51:23,528 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:23,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1049279691, now seen corresponding path program 1 times [2019-09-08 10:51:23,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:23,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:23,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:23,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:23,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:23,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:23,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:23,594 INFO L87 Difference]: Start difference. First operand 31576 states and 45526 transitions. Second operand 3 states. [2019-09-08 10:51:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:26,050 INFO L93 Difference]: Finished difference Result 68670 states and 98538 transitions. [2019-09-08 10:51:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:26,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 10:51:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:26,224 INFO L225 Difference]: With dead ends: 68670 [2019-09-08 10:51:26,224 INFO L226 Difference]: Without dead ends: 45612 [2019-09-08 10:51:26,293 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 10:51:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45612 states. [2019-09-08 10:51:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45612 to 43538. [2019-09-08 10:51:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43538 states. [2019-09-08 10:51:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43538 states to 43538 states and 61892 transitions. [2019-09-08 10:51:29,340 INFO L78 Accepts]: Start accepts. Automaton has 43538 states and 61892 transitions. Word has length 82 [2019-09-08 10:51:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:29,340 INFO L475 AbstractCegarLoop]: Abstraction has 43538 states and 61892 transitions. [2019-09-08 10:51:29,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:51:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 43538 states and 61892 transitions. [2019-09-08 10:51:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:51:29,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:29,351 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:51:29,351 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:29,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:29,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1536115522, now seen corresponding path program 1 times [2019-09-08 10:51:29,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:29,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:29,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:29,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:29,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:29,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:29,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:29,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:29,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:29,415 INFO L87 Difference]: Start difference. First operand 43538 states and 61892 transitions. Second operand 3 states. [2019-09-08 10:51:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:31,602 INFO L93 Difference]: Finished difference Result 73081 states and 103217 transitions. [2019-09-08 10:51:31,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:31,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 10:51:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:31,710 INFO L225 Difference]: With dead ends: 73081 [2019-09-08 10:51:31,710 INFO L226 Difference]: Without dead ends: 45589 [2019-09-08 10:51:31,747 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 10:51:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45589 states. [2019-09-08 10:51:35,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45589 to 43759. [2019-09-08 10:51:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43759 states. [2019-09-08 10:51:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43759 states to 43759 states and 61234 transitions. [2019-09-08 10:51:35,165 INFO L78 Accepts]: Start accepts. Automaton has 43759 states and 61234 transitions. Word has length 82 [2019-09-08 10:51:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:35,165 INFO L475 AbstractCegarLoop]: Abstraction has 43759 states and 61234 transitions. [2019-09-08 10:51:35,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:51:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 43759 states and 61234 transitions. [2019-09-08 10:51:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:51:35,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:35,175 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:51:35,175 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:35,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1323355809, now seen corresponding path program 1 times [2019-09-08 10:51:35,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:35,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:35,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:35,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:35,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:51:35,278 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 10:51:35,293 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 10:51:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:35,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:51:35,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:51:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:35,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:51:35,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:51:35,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:51:35,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:51:35,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:51:35,485 INFO L87 Difference]: Start difference. First operand 43759 states and 61234 transitions. Second operand 11 states. [2019-09-08 10:51:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:39,483 INFO L93 Difference]: Finished difference Result 94681 states and 131550 transitions. [2019-09-08 10:51:39,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:51:39,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-09-08 10:51:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:39,565 INFO L225 Difference]: With dead ends: 94681 [2019-09-08 10:51:39,566 INFO L226 Difference]: Without dead ends: 65782 [2019-09-08 10:51:39,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:51:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65782 states. [2019-09-08 10:51:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65782 to 45624. [2019-09-08 10:51:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45624 states. [2019-09-08 10:51:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45624 states to 45624 states and 63344 transitions. [2019-09-08 10:51:42,378 INFO L78 Accepts]: Start accepts. Automaton has 45624 states and 63344 transitions. Word has length 82 [2019-09-08 10:51:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:42,379 INFO L475 AbstractCegarLoop]: Abstraction has 45624 states and 63344 transitions. [2019-09-08 10:51:42,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:51:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 45624 states and 63344 transitions. [2019-09-08 10:51:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:51:42,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:42,385 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:51:42,386 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1637885217, now seen corresponding path program 1 times [2019-09-08 10:51:42,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:42,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:42,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:51:42,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:42,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:51:42,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:51:42,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:51:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:51:42,468 INFO L87 Difference]: Start difference. First operand 45624 states and 63344 transitions. Second operand 6 states. [2019-09-08 10:51:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:49,388 INFO L93 Difference]: Finished difference Result 156382 states and 216340 transitions. [2019-09-08 10:51:49,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:51:49,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-08 10:51:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:49,519 INFO L225 Difference]: With dead ends: 156382 [2019-09-08 10:51:49,519 INFO L226 Difference]: Without dead ends: 110817 [2019-09-08 10:51:49,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:51:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110817 states. [2019-09-08 10:51:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110817 to 109374. [2019-09-08 10:51:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109374 states. [2019-09-08 10:51:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109374 states to 109374 states and 150772 transitions. [2019-09-08 10:51:55,925 INFO L78 Accepts]: Start accepts. Automaton has 109374 states and 150772 transitions. Word has length 82 [2019-09-08 10:51:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:55,926 INFO L475 AbstractCegarLoop]: Abstraction has 109374 states and 150772 transitions. [2019-09-08 10:51:55,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:51:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 109374 states and 150772 transitions. [2019-09-08 10:51:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:51:55,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:55,936 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:51:55,936 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1092382182, now seen corresponding path program 1 times [2019-09-08 10:51:55,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:55,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:55,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:55,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:56,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:51:56,020 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 10:51:56,035 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 10:51:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:56,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:51:56,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:51:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:56,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:51:56,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:51:56,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:51:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:51:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:51:56,258 INFO L87 Difference]: Start difference. First operand 109374 states and 150772 transitions. Second operand 11 states. [2019-09-08 10:52:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:13,743 INFO L93 Difference]: Finished difference Result 351646 states and 485059 transitions. [2019-09-08 10:52:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:52:13,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-09-08 10:52:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:14,109 INFO L225 Difference]: With dead ends: 351646 [2019-09-08 10:52:14,109 INFO L226 Difference]: Without dead ends: 253368 [2019-09-08 10:52:14,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:52:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253368 states. [2019-09-08 10:52:26,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253368 to 124971. [2019-09-08 10:52:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124971 states. [2019-09-08 10:52:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124971 states to 124971 states and 172549 transitions. [2019-09-08 10:52:27,221 INFO L78 Accepts]: Start accepts. Automaton has 124971 states and 172549 transitions. Word has length 82 [2019-09-08 10:52:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:27,221 INFO L475 AbstractCegarLoop]: Abstraction has 124971 states and 172549 transitions. [2019-09-08 10:52:27,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:52:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 124971 states and 172549 transitions. [2019-09-08 10:52:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:52:27,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:27,230 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:52:27,230 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1308447856, now seen corresponding path program 1 times [2019-09-08 10:52:27,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:27,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:27,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 10:52:27,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:27,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:52:27,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:52:27,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:52:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:52:27,312 INFO L87 Difference]: Start difference. First operand 124971 states and 172549 transitions. Second operand 6 states. [2019-09-08 10:52:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:50,054 INFO L93 Difference]: Finished difference Result 430337 states and 592022 transitions. [2019-09-08 10:52:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:52:50,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-08 10:52:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:50,480 INFO L225 Difference]: With dead ends: 430337 [2019-09-08 10:52:50,480 INFO L226 Difference]: Without dead ends: 305470 [2019-09-08 10:52:50,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:52:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305470 states. [2019-09-08 10:53:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305470 to 299992. [2019-09-08 10:53:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299992 states. [2019-09-08 10:53:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299992 states to 299992 states and 411312 transitions. [2019-09-08 10:53:20,986 INFO L78 Accepts]: Start accepts. Automaton has 299992 states and 411312 transitions. Word has length 82 [2019-09-08 10:53:20,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:20,986 INFO L475 AbstractCegarLoop]: Abstraction has 299992 states and 411312 transitions. [2019-09-08 10:53:20,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:53:20,986 INFO L276 IsEmpty]: Start isEmpty. Operand 299992 states and 411312 transitions. [2019-09-08 10:53:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:53:20,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:20,999 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:53:21,000 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:21,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:21,000 INFO L82 PathProgramCache]: Analyzing trace with hash 596777845, now seen corresponding path program 1 times [2019-09-08 10:53:21,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:21,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:21,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:21,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:21,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:53:21,102 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) [2019-09-08 10:53:21,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:53:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:21,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:53:21,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:53:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:21,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:53:21,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:53:21,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:53:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:53:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:53:21,341 INFO L87 Difference]: Start difference. First operand 299992 states and 411312 transitions. Second operand 11 states. [2019-09-08 10:54:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:07,583 INFO L93 Difference]: Finished difference Result 707554 states and 967483 transitions. [2019-09-08 10:54:07,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:54:07,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-09-08 10:54:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:08,307 INFO L225 Difference]: With dead ends: 707554 [2019-09-08 10:54:08,307 INFO L226 Difference]: Without dead ends: 488615 [2019-09-08 10:54:09,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:54:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488615 states. [2019-09-08 10:54:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488615 to 316408. [2019-09-08 10:54:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316408 states. [2019-09-08 10:54:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316408 states to 316408 states and 433534 transitions. [2019-09-08 10:54:43,904 INFO L78 Accepts]: Start accepts. Automaton has 316408 states and 433534 transitions. Word has length 82 [2019-09-08 10:54:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:43,904 INFO L475 AbstractCegarLoop]: Abstraction has 316408 states and 433534 transitions. [2019-09-08 10:54:43,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:54:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 316408 states and 433534 transitions. [2019-09-08 10:54:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:54:43,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:43,917 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:54:43,917 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:43,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash 761692103, now seen corresponding path program 1 times [2019-09-08 10:54:43,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:43,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:43,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:43,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:43,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 10:54:44,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:44,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:54:44,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:54:44,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:54:44,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:54:44,011 INFO L87 Difference]: Start difference. First operand 316408 states and 433534 transitions. Second operand 6 states. [2019-09-08 10:55:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:58,748 INFO L93 Difference]: Finished difference Result 1067622 states and 1457622 transitions. [2019-09-08 10:55:58,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:55:58,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-09-08 10:55:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:59,863 INFO L225 Difference]: With dead ends: 1067622 [2019-09-08 10:55:59,863 INFO L226 Difference]: Without dead ends: 751370 [2019-09-08 10:56:00,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:56:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751370 states. [2019-09-08 10:57:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751370 to 740386. [2019-09-08 10:57:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740386 states. [2019-09-08 10:57:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740386 states to 740386 states and 1007154 transitions. [2019-09-08 10:57:26,157 INFO L78 Accepts]: Start accepts. Automaton has 740386 states and 1007154 transitions. Word has length 82 [2019-09-08 10:57:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:26,158 INFO L475 AbstractCegarLoop]: Abstraction has 740386 states and 1007154 transitions. [2019-09-08 10:57:26,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:57:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 740386 states and 1007154 transitions. [2019-09-08 10:57:26,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 10:57:26,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:26,172 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:57:26,172 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:26,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:26,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2014317374, now seen corresponding path program 1 times [2019-09-08 10:57:26,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:26,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:26,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:26,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:26,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:26,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:57:26,270 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:57:26,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:26,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 10:57:26,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:57:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:26,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:57:26,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 10:57:26,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:57:26,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:57:26,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:57:26,510 INFO L87 Difference]: Start difference. First operand 740386 states and 1007154 transitions. Second operand 11 states. [2019-09-08 10:59:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:48,945 INFO L93 Difference]: Finished difference Result 1487571 states and 2012147 transitions. [2019-09-08 10:59:48,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:59:48,946 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2019-09-08 10:59:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:50,901 INFO L225 Difference]: With dead ends: 1487571 [2019-09-08 10:59:50,901 INFO L226 Difference]: Without dead ends: 1169221 [2019-09-08 10:59:51,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:59:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169221 states. [2019-09-08 11:01:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169221 to 782006. [2019-09-08 11:01:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782006 states. [2019-09-08 11:01:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782006 states to 782006 states and 1061749 transitions. [2019-09-08 11:01:44,414 INFO L78 Accepts]: Start accepts. Automaton has 782006 states and 1061749 transitions. Word has length 82 [2019-09-08 11:01:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:44,414 INFO L475 AbstractCegarLoop]: Abstraction has 782006 states and 1061749 transitions. [2019-09-08 11:01:44,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:01:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 782006 states and 1061749 transitions. [2019-09-08 11:01:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:01:44,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:44,430 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 11:01:44,430 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash 845153957, now seen corresponding path program 1 times [2019-09-08 11:01:44,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:44,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:44,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:44,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:44,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:44,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:44,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:44,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:44,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:44,482 INFO L87 Difference]: Start difference. First operand 782006 states and 1061749 transitions. Second operand 3 states.