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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:54:42,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:54:42,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:54:42,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:54:42,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:54:42,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:54:42,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:54:42,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:54:42,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:54:42,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:54:42,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:54:42,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:54:42,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:54:42,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:54:42,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:54:42,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:54:42,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:54:42,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:54:42,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:54:42,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:54:42,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:54:42,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:54:42,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:54:42,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:54:42,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:54:42,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:54:42,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:54:42,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:54:42,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:54:42,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:54:42,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:54:42,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:54:42,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:54:42,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:54:42,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:54:42,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:54:42,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:54:42,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:54:42,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:54:42,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:54:42,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:54:42,661 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:54:42,676 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:54:42,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:54:42,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:54:42,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:54:42,678 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:54:42,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:54:42,678 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:54:42,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:54:42,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:54:42,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:54:42,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:54:42,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:54:42,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:54:42,680 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:54:42,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:54:42,680 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:54:42,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:54:42,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:54:42,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:54:42,681 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:54:42,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:54:42,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:54:42,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:54:42,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:54:42,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:54:42,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:54:42,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:54:42,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:54:42,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:54:42,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:54:42,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:54:42,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:54:42,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:54:42,730 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:54:42,731 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:54:42,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41af0e682/a12d13acd3384ea7a8278c27997112e7/FLAG488609822 [2019-09-08 12:54:43,299 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:54:43,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:54:43,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41af0e682/a12d13acd3384ea7a8278c27997112e7/FLAG488609822 [2019-09-08 12:54:43,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41af0e682/a12d13acd3384ea7a8278c27997112e7 [2019-09-08 12:54:43,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:54:43,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:54:43,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:54:43,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:54:43,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:54:43,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:54:43" (1/1) ... [2019-09-08 12:54:43,661 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 12:54:43, skipping insertion in model container [2019-09-08 12:54:43,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:54:43" (1/1) ... [2019-09-08 12:54:43,669 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:54:43,716 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:54:44,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:54:44,160 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:54:44,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:54:44,297 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:54:44,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44 WrapperNode [2019-09-08 12:54:44,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:54:44,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:54:44,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:54:44,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:54:44,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44" (1/1) ... [2019-09-08 12:54:44,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44" (1/1) ... [2019-09-08 12:54:44,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44" (1/1) ... [2019-09-08 12:54:44,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44" (1/1) ... [2019-09-08 12:54:44,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44" (1/1) ... [2019-09-08 12:54:44,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44" (1/1) ... [2019-09-08 12:54:44,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44" (1/1) ... [2019-09-08 12:54:44,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:54:44,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:54:44,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:54:44,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:54:44,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:54:44,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:54:44,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:54:44,427 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:54:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:54:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:54:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:54:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:54:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:54:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:54:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:54:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:54:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:54:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:54:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:54:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:54:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:54:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:54:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:54:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:54:45,253 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:54:45,254 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:54:45,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:54:45 BoogieIcfgContainer [2019-09-08 12:54:45,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:54:45,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:54:45,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:54:45,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:54:45,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:54:43" (1/3) ... [2019-09-08 12:54:45,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c65364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:54:45, skipping insertion in model container [2019-09-08 12:54:45,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:44" (2/3) ... [2019-09-08 12:54:45,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c65364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:54:45, skipping insertion in model container [2019-09-08 12:54:45,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:54:45" (3/3) ... [2019-09-08 12:54:45,263 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:54:45,272 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:54:45,280 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:54:45,297 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:54:45,329 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:54:45,330 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:54:45,330 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:54:45,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:54:45,331 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:54:45,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:54:45,331 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:54:45,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:54:45,331 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:54:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-08 12:54:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 12:54:45,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:45,367 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:45,369 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:45,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash 170153311, now seen corresponding path program 1 times [2019-09-08 12:54:45,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:45,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:45,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:45,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:45,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:45,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:45,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:45,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:45,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:45,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:45,857 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 3 states. [2019-09-08 12:54:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:46,008 INFO L93 Difference]: Finished difference Result 348 states and 578 transitions. [2019-09-08 12:54:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:46,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 12:54:46,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:46,025 INFO L225 Difference]: With dead ends: 348 [2019-09-08 12:54:46,026 INFO L226 Difference]: Without dead ends: 241 [2019-09-08 12:54:46,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-08 12:54:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2019-09-08 12:54:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-08 12:54:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 369 transitions. [2019-09-08 12:54:46,094 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 369 transitions. Word has length 66 [2019-09-08 12:54:46,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:46,094 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 369 transitions. [2019-09-08 12:54:46,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 369 transitions. [2019-09-08 12:54:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:54:46,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:46,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:46,099 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:46,100 INFO L82 PathProgramCache]: Analyzing trace with hash -340326208, now seen corresponding path program 1 times [2019-09-08 12:54:46,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:46,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:46,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:46,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:46,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:46,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:46,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:46,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:46,276 INFO L87 Difference]: Start difference. First operand 238 states and 369 transitions. Second operand 3 states. [2019-09-08 12:54:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:46,343 INFO L93 Difference]: Finished difference Result 576 states and 921 transitions. [2019-09-08 12:54:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:46,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 12:54:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:46,348 INFO L225 Difference]: With dead ends: 576 [2019-09-08 12:54:46,348 INFO L226 Difference]: Without dead ends: 399 [2019-09-08 12:54:46,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-08 12:54:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2019-09-08 12:54:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-09-08 12:54:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 624 transitions. [2019-09-08 12:54:46,402 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 624 transitions. Word has length 68 [2019-09-08 12:54:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:46,403 INFO L475 AbstractCegarLoop]: Abstraction has 395 states and 624 transitions. [2019-09-08 12:54:46,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 624 transitions. [2019-09-08 12:54:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:54:46,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:46,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:46,408 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1584902111, now seen corresponding path program 1 times [2019-09-08 12:54:46,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:46,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:46,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:46,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:46,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:46,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:46,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:46,523 INFO L87 Difference]: Start difference. First operand 395 states and 624 transitions. Second operand 3 states. [2019-09-08 12:54:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:46,599 INFO L93 Difference]: Finished difference Result 1031 states and 1658 transitions. [2019-09-08 12:54:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:46,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 12:54:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:46,607 INFO L225 Difference]: With dead ends: 1031 [2019-09-08 12:54:46,608 INFO L226 Difference]: Without dead ends: 697 [2019-09-08 12:54:46,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-08 12:54:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 691. [2019-09-08 12:54:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-08 12:54:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1100 transitions. [2019-09-08 12:54:46,677 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1100 transitions. Word has length 70 [2019-09-08 12:54:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:46,678 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1100 transitions. [2019-09-08 12:54:46,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1100 transitions. [2019-09-08 12:54:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 12:54:46,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:46,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:46,693 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:46,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:46,693 INFO L82 PathProgramCache]: Analyzing trace with hash 834475330, now seen corresponding path program 1 times [2019-09-08 12:54:46,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:46,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:46,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:46,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:46,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:46,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:46,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:46,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:46,939 INFO L87 Difference]: Start difference. First operand 691 states and 1100 transitions. Second operand 5 states. [2019-09-08 12:54:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:47,295 INFO L93 Difference]: Finished difference Result 2645 states and 4297 transitions. [2019-09-08 12:54:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:54:47,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 12:54:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:47,315 INFO L225 Difference]: With dead ends: 2645 [2019-09-08 12:54:47,315 INFO L226 Difference]: Without dead ends: 2015 [2019-09-08 12:54:47,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:54:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2019-09-08 12:54:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1504. [2019-09-08 12:54:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2019-09-08 12:54:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2432 transitions. [2019-09-08 12:54:47,436 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2432 transitions. Word has length 72 [2019-09-08 12:54:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:47,436 INFO L475 AbstractCegarLoop]: Abstraction has 1504 states and 2432 transitions. [2019-09-08 12:54:47,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2432 transitions. [2019-09-08 12:54:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 12:54:47,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:47,439 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:47,439 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:47,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:47,439 INFO L82 PathProgramCache]: Analyzing trace with hash 37321009, now seen corresponding path program 1 times [2019-09-08 12:54:47,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:47,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:47,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:47,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:47,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:47,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:47,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:54:47,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:54:47,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:54:47,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:47,601 INFO L87 Difference]: Start difference. First operand 1504 states and 2432 transitions. Second operand 4 states. [2019-09-08 12:54:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:47,767 INFO L93 Difference]: Finished difference Result 3548 states and 5776 transitions. [2019-09-08 12:54:47,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:54:47,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-08 12:54:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:47,780 INFO L225 Difference]: With dead ends: 3548 [2019-09-08 12:54:47,781 INFO L226 Difference]: Without dead ends: 2105 [2019-09-08 12:54:47,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2019-09-08 12:54:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2094. [2019-09-08 12:54:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-09-08 12:54:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3393 transitions. [2019-09-08 12:54:47,914 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3393 transitions. Word has length 73 [2019-09-08 12:54:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:47,916 INFO L475 AbstractCegarLoop]: Abstraction has 2094 states and 3393 transitions. [2019-09-08 12:54:47,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:54:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3393 transitions. [2019-09-08 12:54:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:54:47,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:47,920 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:47,920 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:47,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1099898857, now seen corresponding path program 1 times [2019-09-08 12:54:47,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:47,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:47,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:47,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:48,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:48,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:54:48,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:54:48,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:54:48,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:54:48,106 INFO L87 Difference]: Start difference. First operand 2094 states and 3393 transitions. Second operand 7 states. [2019-09-08 12:54:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:48,618 INFO L93 Difference]: Finished difference Result 7778 states and 12595 transitions. [2019-09-08 12:54:48,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:54:48,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 12:54:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:48,651 INFO L225 Difference]: With dead ends: 7778 [2019-09-08 12:54:48,651 INFO L226 Difference]: Without dead ends: 5745 [2019-09-08 12:54:48,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:54:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5745 states. [2019-09-08 12:54:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5745 to 5598. [2019-09-08 12:54:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5598 states. [2019-09-08 12:54:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5598 states to 5598 states and 9025 transitions. [2019-09-08 12:54:49,029 INFO L78 Accepts]: Start accepts. Automaton has 5598 states and 9025 transitions. Word has length 74 [2019-09-08 12:54:49,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:49,030 INFO L475 AbstractCegarLoop]: Abstraction has 5598 states and 9025 transitions. [2019-09-08 12:54:49,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:54:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 5598 states and 9025 transitions. [2019-09-08 12:54:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 12:54:49,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:49,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:49,035 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash -315368200, now seen corresponding path program 1 times [2019-09-08 12:54:49,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:49,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:49,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:49,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:49,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:49,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:49,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:54:49,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:54:49,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:54:49,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:49,230 INFO L87 Difference]: Start difference. First operand 5598 states and 9025 transitions. Second operand 4 states. [2019-09-08 12:54:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:49,951 INFO L93 Difference]: Finished difference Result 16234 states and 26288 transitions. [2019-09-08 12:54:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:54:49,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-08 12:54:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:50,010 INFO L225 Difference]: With dead ends: 16234 [2019-09-08 12:54:50,011 INFO L226 Difference]: Without dead ends: 11221 [2019-09-08 12:54:50,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11221 states. [2019-09-08 12:54:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11221 to 7916. [2019-09-08 12:54:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7916 states. [2019-09-08 12:54:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7916 states to 7916 states and 12765 transitions. [2019-09-08 12:54:50,591 INFO L78 Accepts]: Start accepts. Automaton has 7916 states and 12765 transitions. Word has length 75 [2019-09-08 12:54:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:50,591 INFO L475 AbstractCegarLoop]: Abstraction has 7916 states and 12765 transitions. [2019-09-08 12:54:50,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:54:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7916 states and 12765 transitions. [2019-09-08 12:54:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:54:50,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:50,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:50,595 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:50,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:50,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1281911695, now seen corresponding path program 1 times [2019-09-08 12:54:50,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:50,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:50,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:50,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:50,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:50,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:50,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:50,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:50,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:50,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:50,735 INFO L87 Difference]: Start difference. First operand 7916 states and 12765 transitions. Second operand 3 states. [2019-09-08 12:54:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:51,196 INFO L93 Difference]: Finished difference Result 17382 states and 28191 transitions. [2019-09-08 12:54:51,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:51,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 12:54:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:51,248 INFO L225 Difference]: With dead ends: 17382 [2019-09-08 12:54:51,249 INFO L226 Difference]: Without dead ends: 11626 [2019-09-08 12:54:51,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11626 states. [2019-09-08 12:54:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11626 to 11624. [2019-09-08 12:54:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11624 states. [2019-09-08 12:54:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11624 states to 11624 states and 18726 transitions. [2019-09-08 12:54:51,874 INFO L78 Accepts]: Start accepts. Automaton has 11624 states and 18726 transitions. Word has length 76 [2019-09-08 12:54:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:51,874 INFO L475 AbstractCegarLoop]: Abstraction has 11624 states and 18726 transitions. [2019-09-08 12:54:51,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 11624 states and 18726 transitions. [2019-09-08 12:54:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:54:51,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:51,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:51,877 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1289808927, now seen corresponding path program 1 times [2019-09-08 12:54:51,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:51,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:51,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:51,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:51,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:51,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:51,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:51,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:51,942 INFO L87 Difference]: Start difference. First operand 11624 states and 18726 transitions. Second operand 3 states. [2019-09-08 12:54:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:52,624 INFO L93 Difference]: Finished difference Result 25953 states and 41794 transitions. [2019-09-08 12:54:52,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:52,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 12:54:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:52,680 INFO L225 Difference]: With dead ends: 25953 [2019-09-08 12:54:52,681 INFO L226 Difference]: Without dead ends: 17390 [2019-09-08 12:54:52,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:52,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17390 states. [2019-09-08 12:54:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17390 to 17388. [2019-09-08 12:54:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17388 states. [2019-09-08 12:54:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17388 states to 17388 states and 27820 transitions. [2019-09-08 12:54:54,201 INFO L78 Accepts]: Start accepts. Automaton has 17388 states and 27820 transitions. Word has length 76 [2019-09-08 12:54:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:54,201 INFO L475 AbstractCegarLoop]: Abstraction has 17388 states and 27820 transitions. [2019-09-08 12:54:54,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 17388 states and 27820 transitions. [2019-09-08 12:54:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 12:54:54,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:54,203 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:54,203 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:54,203 INFO L82 PathProgramCache]: Analyzing trace with hash -645952435, now seen corresponding path program 1 times [2019-09-08 12:54:54,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:54,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:54,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:54,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:54,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:54,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:54,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:54,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:54,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:54,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:54,273 INFO L87 Difference]: Start difference. First operand 17388 states and 27820 transitions. Second operand 3 states. [2019-09-08 12:54:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:55,367 INFO L93 Difference]: Finished difference Result 37167 states and 59546 transitions. [2019-09-08 12:54:55,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:55,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 12:54:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:55,430 INFO L225 Difference]: With dead ends: 37167 [2019-09-08 12:54:55,430 INFO L226 Difference]: Without dead ends: 24648 [2019-09-08 12:54:55,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24648 states. [2019-09-08 12:54:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24648 to 24646. [2019-09-08 12:54:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24646 states. [2019-09-08 12:54:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24646 states to 24646 states and 39157 transitions. [2019-09-08 12:54:56,695 INFO L78 Accepts]: Start accepts. Automaton has 24646 states and 39157 transitions. Word has length 76 [2019-09-08 12:54:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:56,695 INFO L475 AbstractCegarLoop]: Abstraction has 24646 states and 39157 transitions. [2019-09-08 12:54:56,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 24646 states and 39157 transitions. [2019-09-08 12:54:56,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:54:56,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:56,697 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:56,697 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:56,697 INFO L82 PathProgramCache]: Analyzing trace with hash 384202792, now seen corresponding path program 1 times [2019-09-08 12:54:56,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:56,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:56,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:56,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:56,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:56,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:56,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:56,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:56,839 INFO L87 Difference]: Start difference. First operand 24646 states and 39157 transitions. Second operand 5 states. [2019-09-08 12:54:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:58,513 INFO L93 Difference]: Finished difference Result 60564 states and 96201 transitions. [2019-09-08 12:54:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:54:58,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:54:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:58,615 INFO L225 Difference]: With dead ends: 60564 [2019-09-08 12:54:58,615 INFO L226 Difference]: Without dead ends: 36013 [2019-09-08 12:54:58,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36013 states. [2019-09-08 12:54:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36013 to 36007. [2019-09-08 12:54:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36007 states. [2019-09-08 12:54:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36007 states to 36007 states and 57035 transitions. [2019-09-08 12:54:59,989 INFO L78 Accepts]: Start accepts. Automaton has 36007 states and 57035 transitions. Word has length 77 [2019-09-08 12:54:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:59,990 INFO L475 AbstractCegarLoop]: Abstraction has 36007 states and 57035 transitions. [2019-09-08 12:54:59,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 36007 states and 57035 transitions. [2019-09-08 12:54:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:54:59,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:59,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:59,991 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1943011290, now seen corresponding path program 1 times [2019-09-08 12:54:59,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:59,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:59,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:59,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:59,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:00,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:00,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:55:00,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:55:00,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:55:00,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:55:00,159 INFO L87 Difference]: Start difference. First operand 36007 states and 57035 transitions. Second operand 5 states. [2019-09-08 12:55:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:03,746 INFO L93 Difference]: Finished difference Result 115521 states and 183312 transitions. [2019-09-08 12:55:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:55:03,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 12:55:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:03,961 INFO L225 Difference]: With dead ends: 115521 [2019-09-08 12:55:03,961 INFO L226 Difference]: Without dead ends: 79609 [2019-09-08 12:55:04,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:55:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79609 states. [2019-09-08 12:55:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79609 to 49651. [2019-09-08 12:55:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49651 states. [2019-09-08 12:55:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49651 states to 49651 states and 78372 transitions. [2019-09-08 12:55:06,007 INFO L78 Accepts]: Start accepts. Automaton has 49651 states and 78372 transitions. Word has length 80 [2019-09-08 12:55:06,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:06,007 INFO L475 AbstractCegarLoop]: Abstraction has 49651 states and 78372 transitions. [2019-09-08 12:55:06,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:55:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 49651 states and 78372 transitions. [2019-09-08 12:55:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:55:06,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:06,009 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:06,009 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash 101898565, now seen corresponding path program 1 times [2019-09-08 12:55:06,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:06,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:06,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:06,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:06,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:06,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:06,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:55:06,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:55:06,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:55:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:55:06,345 INFO L87 Difference]: Start difference. First operand 49651 states and 78372 transitions. Second operand 5 states. [2019-09-08 12:55:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:09,887 INFO L93 Difference]: Finished difference Result 85331 states and 134007 transitions. [2019-09-08 12:55:09,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:55:09,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 12:55:09,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:10,121 INFO L225 Difference]: With dead ends: 85331 [2019-09-08 12:55:10,121 INFO L226 Difference]: Without dead ends: 85329 [2019-09-08 12:55:10,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:55:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85329 states. [2019-09-08 12:55:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85329 to 50739. [2019-09-08 12:55:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50739 states. [2019-09-08 12:55:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50739 states to 50739 states and 79451 transitions. [2019-09-08 12:55:12,496 INFO L78 Accepts]: Start accepts. Automaton has 50739 states and 79451 transitions. Word has length 81 [2019-09-08 12:55:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:12,496 INFO L475 AbstractCegarLoop]: Abstraction has 50739 states and 79451 transitions. [2019-09-08 12:55:12,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:55:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 50739 states and 79451 transitions. [2019-09-08 12:55:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:55:12,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:12,499 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:12,500 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:12,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:12,500 INFO L82 PathProgramCache]: Analyzing trace with hash 477987945, now seen corresponding path program 1 times [2019-09-08 12:55:12,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:12,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:12,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:12,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:12,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:12,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:12,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:55:12,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:55:12,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:55:12,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:12,579 INFO L87 Difference]: Start difference. First operand 50739 states and 79451 transitions. Second operand 3 states. [2019-09-08 12:55:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:14,399 INFO L93 Difference]: Finished difference Result 93373 states and 146368 transitions. [2019-09-08 12:55:14,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:55:14,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 12:55:14,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:14,472 INFO L225 Difference]: With dead ends: 93373 [2019-09-08 12:55:14,472 INFO L226 Difference]: Without dead ends: 42729 [2019-09-08 12:55:14,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42729 states. [2019-09-08 12:55:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42729 to 42727. [2019-09-08 12:55:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42727 states. [2019-09-08 12:55:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42727 states to 42727 states and 66644 transitions. [2019-09-08 12:55:17,737 INFO L78 Accepts]: Start accepts. Automaton has 42727 states and 66644 transitions. Word has length 107 [2019-09-08 12:55:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:17,737 INFO L475 AbstractCegarLoop]: Abstraction has 42727 states and 66644 transitions. [2019-09-08 12:55:17,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 42727 states and 66644 transitions. [2019-09-08 12:55:17,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:55:17,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:17,739 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:17,739 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:17,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:17,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1113947205, now seen corresponding path program 1 times [2019-09-08 12:55:17,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:17,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:17,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:17,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:17,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:17,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:55:17,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:55:17,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:17,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:55:18,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:55:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:55:18,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:55:18,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 12:55:18,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:55:18,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:55:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:55:18,112 INFO L87 Difference]: Start difference. First operand 42727 states and 66644 transitions. Second operand 8 states. [2019-09-08 12:55:23,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:23,069 INFO L93 Difference]: Finished difference Result 86180 states and 134924 transitions. [2019-09-08 12:55:23,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:55:23,072 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-08 12:55:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:23,322 INFO L225 Difference]: With dead ends: 86180 [2019-09-08 12:55:23,322 INFO L226 Difference]: Without dead ends: 59216 [2019-09-08 12:55:23,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:55:23,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59216 states. [2019-09-08 12:55:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59216 to 51362. [2019-09-08 12:55:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51362 states. [2019-09-08 12:55:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51362 states to 51362 states and 80292 transitions. [2019-09-08 12:55:26,688 INFO L78 Accepts]: Start accepts. Automaton has 51362 states and 80292 transitions. Word has length 107 [2019-09-08 12:55:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:26,688 INFO L475 AbstractCegarLoop]: Abstraction has 51362 states and 80292 transitions. [2019-09-08 12:55:26,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:55:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 51362 states and 80292 transitions. [2019-09-08 12:55:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:55:26,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:26,691 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:26,691 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:26,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:26,692 INFO L82 PathProgramCache]: Analyzing trace with hash 723995340, now seen corresponding path program 1 times [2019-09-08 12:55:26,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:26,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:26,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:26,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:55:26,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:26,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:55:26,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:55:26,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:55:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:55:26,815 INFO L87 Difference]: Start difference. First operand 51362 states and 80292 transitions. Second operand 5 states. [2019-09-08 12:55:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:29,441 INFO L93 Difference]: Finished difference Result 73580 states and 115616 transitions. [2019-09-08 12:55:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:55:29,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-08 12:55:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:29,628 INFO L225 Difference]: With dead ends: 73580 [2019-09-08 12:55:29,629 INFO L226 Difference]: Without dead ends: 63754 [2019-09-08 12:55:29,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:55:29,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63754 states. [2019-09-08 12:55:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63754 to 59776. [2019-09-08 12:55:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59776 states. [2019-09-08 12:55:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59776 states to 59776 states and 93504 transitions. [2019-09-08 12:55:33,737 INFO L78 Accepts]: Start accepts. Automaton has 59776 states and 93504 transitions. Word has length 110 [2019-09-08 12:55:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:33,738 INFO L475 AbstractCegarLoop]: Abstraction has 59776 states and 93504 transitions. [2019-09-08 12:55:33,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:55:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 59776 states and 93504 transitions. [2019-09-08 12:55:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:55:33,739 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:33,740 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:33,740 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1226419294, now seen corresponding path program 1 times [2019-09-08 12:55:33,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:33,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:33,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:33,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:33,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:33,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:55:33,833 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:55:33,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:55:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:33,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:55:34,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:55:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:55:34,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:55:34,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 12:55:34,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:55:34,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:55:34,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:55:34,099 INFO L87 Difference]: Start difference. First operand 59776 states and 93504 transitions. Second operand 8 states. [2019-09-08 12:55:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:38,064 INFO L93 Difference]: Finished difference Result 125666 states and 197552 transitions. [2019-09-08 12:55:38,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:55:38,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2019-09-08 12:55:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:38,210 INFO L225 Difference]: With dead ends: 125666 [2019-09-08 12:55:38,210 INFO L226 Difference]: Without dead ends: 85968 [2019-09-08 12:55:38,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:55:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85968 states. [2019-09-08 12:55:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85968 to 77544. [2019-09-08 12:55:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77544 states. [2019-09-08 12:55:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77544 states to 77544 states and 121388 transitions. [2019-09-08 12:55:43,845 INFO L78 Accepts]: Start accepts. Automaton has 77544 states and 121388 transitions. Word has length 110 [2019-09-08 12:55:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:43,845 INFO L475 AbstractCegarLoop]: Abstraction has 77544 states and 121388 transitions. [2019-09-08 12:55:43,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:55:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 77544 states and 121388 transitions. [2019-09-08 12:55:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:55:43,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:43,848 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:43,848 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:43,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:43,849 INFO L82 PathProgramCache]: Analyzing trace with hash -461997720, now seen corresponding path program 1 times [2019-09-08 12:55:43,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:43,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:43,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:55:43,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:43,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:55:43,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:55:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:55:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:43,922 INFO L87 Difference]: Start difference. First operand 77544 states and 121388 transitions. Second operand 3 states. [2019-09-08 12:55:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:49,757 INFO L93 Difference]: Finished difference Result 187474 states and 294034 transitions. [2019-09-08 12:55:49,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:55:49,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 12:55:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:49,972 INFO L225 Difference]: With dead ends: 187474 [2019-09-08 12:55:49,973 INFO L226 Difference]: Without dead ends: 148218 [2019-09-08 12:55:50,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:50,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148218 states. [2019-09-08 12:55:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148218 to 147844. [2019-09-08 12:55:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147844 states. [2019-09-08 12:55:59,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147844 states to 147844 states and 231247 transitions. [2019-09-08 12:55:59,472 INFO L78 Accepts]: Start accepts. Automaton has 147844 states and 231247 transitions. Word has length 110 [2019-09-08 12:55:59,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:59,473 INFO L475 AbstractCegarLoop]: Abstraction has 147844 states and 231247 transitions. [2019-09-08 12:55:59,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 147844 states and 231247 transitions. [2019-09-08 12:55:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:55:59,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:59,475 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:59,475 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1784640277, now seen corresponding path program 1 times [2019-09-08 12:55:59,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:59,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:59,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:59,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:55:59,589 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:55:59,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:59,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 12:55:59,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:55:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 12:55:59,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:55:59,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-08 12:55:59,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:55:59,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:55:59,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:55:59,851 INFO L87 Difference]: Start difference. First operand 147844 states and 231247 transitions. Second operand 10 states. [2019-09-08 12:57:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:18,725 INFO L93 Difference]: Finished difference Result 1417301 states and 2240570 transitions. [2019-09-08 12:57:18,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 12:57:18,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2019-09-08 12:57:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:21,163 INFO L225 Difference]: With dead ends: 1417301 [2019-09-08 12:57:21,164 INFO L226 Difference]: Without dead ends: 1311885 [2019-09-08 12:57:21,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=672, Invalid=2520, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 12:57:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311885 states. [2019-09-08 12:59:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311885 to 1301616. [2019-09-08 12:59:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301616 states. [2019-09-08 12:59:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301616 states to 1301616 states and 2043702 transitions. [2019-09-08 12:59:17,268 INFO L78 Accepts]: Start accepts. Automaton has 1301616 states and 2043702 transitions. Word has length 110 [2019-09-08 12:59:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:17,269 INFO L475 AbstractCegarLoop]: Abstraction has 1301616 states and 2043702 transitions. [2019-09-08 12:59:17,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:59:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1301616 states and 2043702 transitions. [2019-09-08 12:59:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:59:17,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:17,271 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:17,271 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:17,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1672529094, now seen corresponding path program 1 times [2019-09-08 12:59:17,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:17,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:17,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:17,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:59:17,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:17,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:17,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:17,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:17,342 INFO L87 Difference]: Start difference. First operand 1301616 states and 2043702 transitions. Second operand 3 states. [2019-09-08 13:02:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:03,568 INFO L93 Difference]: Finished difference Result 2873365 states and 4523181 transitions. [2019-09-08 13:02:03,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:03,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 13:02:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:08,681 INFO L225 Difference]: With dead ends: 2873365 [2019-09-08 13:02:08,681 INFO L226 Difference]: Without dead ends: 2002956 [2019-09-08 13:02:09,475 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 13:02:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002956 states.