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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:27:47,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:27:47,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:27:47,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:27:47,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:27:47,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:27:47,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:27:47,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:27:47,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:27:47,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:27:47,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:27:47,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:27:47,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:27:47,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:27:47,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:27:47,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:27:47,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:27:47,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:27:47,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:27:47,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:27:47,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:27:47,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:27:47,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:27:47,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:27:47,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:27:47,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:27:47,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:27:47,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:27:47,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:27:47,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:27:47,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:27:47,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:27:47,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:27:47,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:27:47,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:27:47,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:27:47,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:27:47,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:27:47,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:27:47,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:27:47,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:27:47,138 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 09:27:47,163 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:27:47,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:27:47,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:27:47,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:27:47,166 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:27:47,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:27:47,166 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:27:47,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:27:47,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:27:47,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:27:47,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:27:47,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:27:47,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:27:47,168 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:27:47,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:27:47,169 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:27:47,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:27:47,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:27:47,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:27:47,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:27:47,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:27:47,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:27:47,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:27:47,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:27:47,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:27:47,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:27:47,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:27:47,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:27:47,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:27:47,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:27:47,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:27:47,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:27:47,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:27:47,238 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:27:47,238 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:27:47,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3318692bb/029cda28c2c24a4db3e19e96789a893a/FLAGceea360ab [2019-09-08 09:27:47,751 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:27:47,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:27:47,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3318692bb/029cda28c2c24a4db3e19e96789a893a/FLAGceea360ab [2019-09-08 09:27:48,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3318692bb/029cda28c2c24a4db3e19e96789a893a [2019-09-08 09:27:48,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:27:48,126 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:27:48,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:27:48,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:27:48,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:27:48,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:27:48" (1/1) ... [2019-09-08 09:27:48,134 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48, skipping insertion in model container [2019-09-08 09:27:48,134 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:27:48" (1/1) ... [2019-09-08 09:27:48,141 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:27:48,202 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:27:48,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:27:48,567 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:27:48,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:27:48,675 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:27:48,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48 WrapperNode [2019-09-08 09:27:48,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:27:48,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:27:48,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:27:48,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:27:48,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48" (1/1) ... [2019-09-08 09:27:48,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48" (1/1) ... [2019-09-08 09:27:48,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48" (1/1) ... [2019-09-08 09:27:48,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48" (1/1) ... [2019-09-08 09:27:48,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48" (1/1) ... [2019-09-08 09:27:48,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48" (1/1) ... [2019-09-08 09:27:48,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48" (1/1) ... [2019-09-08 09:27:48,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:27:48,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:27:48,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:27:48,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:27:48,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48" (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 09:27:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:27:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:27:48,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:27:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:27:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:27:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:27:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:27:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:27:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:27:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:27:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:27:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:27:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:27:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:27:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:27:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:27:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:27:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:27:49,567 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:27:49,568 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:27:49,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:27:49 BoogieIcfgContainer [2019-09-08 09:27:49,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:27:49,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:27:49,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:27:49,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:27:49,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:27:48" (1/3) ... [2019-09-08 09:27:49,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754f4469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:27:49, skipping insertion in model container [2019-09-08 09:27:49,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:27:48" (2/3) ... [2019-09-08 09:27:49,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754f4469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:27:49, skipping insertion in model container [2019-09-08 09:27:49,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:27:49" (3/3) ... [2019-09-08 09:27:49,577 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:27:49,586 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:27:49,595 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:27:49,611 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:27:49,646 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:27:49,646 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:27:49,646 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:27:49,646 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:27:49,647 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:27:49,647 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:27:49,647 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:27:49,647 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:27:49,647 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:27:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-08 09:27:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 09:27:49,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:49,678 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] [2019-09-08 09:27:49,680 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash 8502252, now seen corresponding path program 1 times [2019-09-08 09:27:49,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:49,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:49,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:49,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:49,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:50,099 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 09:27:50,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:50,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:50,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:50,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:50,140 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-08 09:27:50,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:50,267 INFO L93 Difference]: Finished difference Result 295 states and 498 transitions. [2019-09-08 09:27:50,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:50,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 09:27:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:50,284 INFO L225 Difference]: With dead ends: 295 [2019-09-08 09:27:50,284 INFO L226 Difference]: Without dead ends: 205 [2019-09-08 09:27:50,288 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 09:27:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-08 09:27:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2019-09-08 09:27:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 09:27:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 317 transitions. [2019-09-08 09:27:50,353 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 317 transitions. Word has length 61 [2019-09-08 09:27:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:50,354 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 317 transitions. [2019-09-08 09:27:50,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 317 transitions. [2019-09-08 09:27:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 09:27:50,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:50,361 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] [2019-09-08 09:27:50,362 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:50,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash -851487175, now seen corresponding path program 1 times [2019-09-08 09:27:50,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:50,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:50,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:50,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:50,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:50,506 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 09:27:50,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:50,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:50,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:50,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:50,509 INFO L87 Difference]: Start difference. First operand 203 states and 317 transitions. Second operand 3 states. [2019-09-08 09:27:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:50,558 INFO L93 Difference]: Finished difference Result 479 states and 773 transitions. [2019-09-08 09:27:50,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:50,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 09:27:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:50,563 INFO L225 Difference]: With dead ends: 479 [2019-09-08 09:27:50,563 INFO L226 Difference]: Without dead ends: 334 [2019-09-08 09:27:50,565 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 09:27:50,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-08 09:27:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-09-08 09:27:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-08 09:27:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 529 transitions. [2019-09-08 09:27:50,598 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 529 transitions. Word has length 63 [2019-09-08 09:27:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:50,599 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 529 transitions. [2019-09-08 09:27:50,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 529 transitions. [2019-09-08 09:27:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 09:27:50,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:50,602 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] [2019-09-08 09:27:50,603 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash 812724513, now seen corresponding path program 1 times [2019-09-08 09:27:50,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:50,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:50,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:50,735 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 09:27:50,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:50,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:50,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:50,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:50,737 INFO L87 Difference]: Start difference. First operand 332 states and 529 transitions. Second operand 3 states. [2019-09-08 09:27:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:50,792 INFO L93 Difference]: Finished difference Result 607 states and 985 transitions. [2019-09-08 09:27:50,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:50,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 09:27:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:50,796 INFO L225 Difference]: With dead ends: 607 [2019-09-08 09:27:50,796 INFO L226 Difference]: Without dead ends: 462 [2019-09-08 09:27:50,797 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 09:27:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-08 09:27:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2019-09-08 09:27:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 09:27:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 739 transitions. [2019-09-08 09:27:50,832 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 739 transitions. Word has length 65 [2019-09-08 09:27:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:50,833 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 739 transitions. [2019-09-08 09:27:50,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 739 transitions. [2019-09-08 09:27:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 09:27:50,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:50,836 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] [2019-09-08 09:27:50,836 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1750058316, now seen corresponding path program 1 times [2019-09-08 09:27:50,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:50,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:50,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:50,909 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 09:27:50,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:50,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:50,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:50,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:50,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:50,910 INFO L87 Difference]: Start difference. First operand 460 states and 739 transitions. Second operand 3 states. [2019-09-08 09:27:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:50,959 INFO L93 Difference]: Finished difference Result 1176 states and 1915 transitions. [2019-09-08 09:27:50,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:50,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 09:27:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:50,964 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 09:27:50,965 INFO L226 Difference]: Without dead ends: 797 [2019-09-08 09:27:50,967 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 09:27:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-08 09:27:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 795. [2019-09-08 09:27:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-09-08 09:27:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1281 transitions. [2019-09-08 09:27:51,015 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1281 transitions. Word has length 65 [2019-09-08 09:27:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:51,015 INFO L475 AbstractCegarLoop]: Abstraction has 795 states and 1281 transitions. [2019-09-08 09:27:51,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1281 transitions. [2019-09-08 09:27:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 09:27:51,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:51,018 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] [2019-09-08 09:27:51,018 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1895724377, now seen corresponding path program 1 times [2019-09-08 09:27:51,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:51,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:51,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:51,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:51,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:51,194 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 09:27:51,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:51,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:51,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:51,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:51,196 INFO L87 Difference]: Start difference. First operand 795 states and 1281 transitions. Second operand 5 states. [2019-09-08 09:27:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:51,384 INFO L93 Difference]: Finished difference Result 2733 states and 4488 transitions. [2019-09-08 09:27:51,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:27:51,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-08 09:27:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:51,397 INFO L225 Difference]: With dead ends: 2733 [2019-09-08 09:27:51,397 INFO L226 Difference]: Without dead ends: 2019 [2019-09-08 09:27:51,399 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 09:27:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-09-08 09:27:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1761. [2019-09-08 09:27:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-09-08 09:27:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2868 transitions. [2019-09-08 09:27:51,502 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2868 transitions. Word has length 67 [2019-09-08 09:27:51,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:51,504 INFO L475 AbstractCegarLoop]: Abstraction has 1761 states and 2868 transitions. [2019-09-08 09:27:51,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:27:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2868 transitions. [2019-09-08 09:27:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:27:51,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:51,507 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 09:27:51,507 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:51,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1423696929, now seen corresponding path program 1 times [2019-09-08 09:27:51,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:51,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:51,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:51,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:51,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:51,643 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 09:27:51,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:51,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:27:51,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:27:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:27:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:27:51,644 INFO L87 Difference]: Start difference. First operand 1761 states and 2868 transitions. Second operand 6 states. [2019-09-08 09:27:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:52,095 INFO L93 Difference]: Finished difference Result 6678 states and 10958 transitions. [2019-09-08 09:27:52,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:27:52,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-08 09:27:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:52,127 INFO L225 Difference]: With dead ends: 6678 [2019-09-08 09:27:52,128 INFO L226 Difference]: Without dead ends: 5000 [2019-09-08 09:27:52,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:27:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2019-09-08 09:27:52,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 4931. [2019-09-08 09:27:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4931 states. [2019-09-08 09:27:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4931 states to 4931 states and 8050 transitions. [2019-09-08 09:27:52,476 INFO L78 Accepts]: Start accepts. Automaton has 4931 states and 8050 transitions. Word has length 68 [2019-09-08 09:27:52,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:52,477 INFO L475 AbstractCegarLoop]: Abstraction has 4931 states and 8050 transitions. [2019-09-08 09:27:52,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:27:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4931 states and 8050 transitions. [2019-09-08 09:27:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:27:52,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:52,479 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 09:27:52,479 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:52,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1771341997, now seen corresponding path program 1 times [2019-09-08 09:27:52,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:52,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:52,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:52,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:52,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:52,532 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 09:27:52,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:52,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:52,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:52,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:52,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:52,534 INFO L87 Difference]: Start difference. First operand 4931 states and 8050 transitions. Second operand 3 states. [2019-09-08 09:27:52,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:52,867 INFO L93 Difference]: Finished difference Result 9889 states and 16204 transitions. [2019-09-08 09:27:52,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:52,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 09:27:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:52,903 INFO L225 Difference]: With dead ends: 9889 [2019-09-08 09:27:52,903 INFO L226 Difference]: Without dead ends: 6705 [2019-09-08 09:27:52,912 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 09:27:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2019-09-08 09:27:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6703. [2019-09-08 09:27:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6703 states. [2019-09-08 09:27:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6703 states to 6703 states and 10897 transitions. [2019-09-08 09:27:53,300 INFO L78 Accepts]: Start accepts. Automaton has 6703 states and 10897 transitions. Word has length 68 [2019-09-08 09:27:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:53,300 INFO L475 AbstractCegarLoop]: Abstraction has 6703 states and 10897 transitions. [2019-09-08 09:27:53,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 6703 states and 10897 transitions. [2019-09-08 09:27:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:27:53,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:53,302 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 09:27:53,303 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:53,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:53,303 INFO L82 PathProgramCache]: Analyzing trace with hash 334558445, now seen corresponding path program 1 times [2019-09-08 09:27:53,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:53,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:53,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:53,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:53,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:53,362 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 09:27:53,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:53,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:27:53,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:27:53,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:27:53,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:27:53,364 INFO L87 Difference]: Start difference. First operand 6703 states and 10897 transitions. Second operand 3 states. [2019-09-08 09:27:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:53,801 INFO L93 Difference]: Finished difference Result 14965 states and 24539 transitions. [2019-09-08 09:27:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:27:53,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 09:27:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:53,850 INFO L225 Difference]: With dead ends: 14965 [2019-09-08 09:27:53,851 INFO L226 Difference]: Without dead ends: 9919 [2019-09-08 09:27:53,862 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 09:27:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9919 states. [2019-09-08 09:27:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9919 to 9917. [2019-09-08 09:27:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9917 states. [2019-09-08 09:27:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9917 states to 9917 states and 16099 transitions. [2019-09-08 09:27:54,388 INFO L78 Accepts]: Start accepts. Automaton has 9917 states and 16099 transitions. Word has length 68 [2019-09-08 09:27:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:54,389 INFO L475 AbstractCegarLoop]: Abstraction has 9917 states and 16099 transitions. [2019-09-08 09:27:54,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:27:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 9917 states and 16099 transitions. [2019-09-08 09:27:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:27:54,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:54,390 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] [2019-09-08 09:27:54,390 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1241984288, now seen corresponding path program 1 times [2019-09-08 09:27:54,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:54,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:54,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:54,468 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 09:27:54,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:54,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:27:54,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:27:54,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:27:54,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:27:54,469 INFO L87 Difference]: Start difference. First operand 9917 states and 16099 transitions. Second operand 4 states. [2019-09-08 09:27:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:55,395 INFO L93 Difference]: Finished difference Result 25315 states and 41189 transitions. [2019-09-08 09:27:55,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:27:55,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-08 09:27:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:55,432 INFO L225 Difference]: With dead ends: 25315 [2019-09-08 09:27:55,432 INFO L226 Difference]: Without dead ends: 15484 [2019-09-08 09:27:55,455 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 09:27:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15484 states. [2019-09-08 09:27:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15484 to 15417. [2019-09-08 09:27:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2019-09-08 09:27:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 24955 transitions. [2019-09-08 09:27:56,419 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 24955 transitions. Word has length 69 [2019-09-08 09:27:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:56,420 INFO L475 AbstractCegarLoop]: Abstraction has 15417 states and 24955 transitions. [2019-09-08 09:27:56,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:27:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 24955 transitions. [2019-09-08 09:27:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 09:27:56,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:56,421 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 09:27:56,421 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash 100698310, now seen corresponding path program 1 times [2019-09-08 09:27:56,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:56,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:56,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:56,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:56,500 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 09:27:56,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:56,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:27:56,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:27:56,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:27:56,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:27:56,502 INFO L87 Difference]: Start difference. First operand 15417 states and 24955 transitions. Second operand 4 states. [2019-09-08 09:27:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:27:58,017 INFO L93 Difference]: Finished difference Result 45538 states and 73914 transitions. [2019-09-08 09:27:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:27:58,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-09-08 09:27:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:27:58,093 INFO L225 Difference]: With dead ends: 45538 [2019-09-08 09:27:58,093 INFO L226 Difference]: Without dead ends: 30207 [2019-09-08 09:27:58,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30207 states. [2019-09-08 09:27:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30207 to 22725. [2019-09-08 09:27:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-09-08 09:27:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 36691 transitions. [2019-09-08 09:27:59,370 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 36691 transitions. Word has length 70 [2019-09-08 09:27:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:27:59,371 INFO L475 AbstractCegarLoop]: Abstraction has 22725 states and 36691 transitions. [2019-09-08 09:27:59,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:27:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 36691 transitions. [2019-09-08 09:27:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 09:27:59,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:27:59,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:27:59,374 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:27:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:27:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash 792159510, now seen corresponding path program 1 times [2019-09-08 09:27:59,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:27:59,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:27:59,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:59,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:27:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:27:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:27:59,535 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 09:27:59,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:27:59,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:27:59,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:27:59,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:27:59,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:27:59,537 INFO L87 Difference]: Start difference. First operand 22725 states and 36691 transitions. Second operand 5 states. [2019-09-08 09:28:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:00,477 INFO L93 Difference]: Finished difference Result 47072 states and 76081 transitions. [2019-09-08 09:28:00,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:28:00,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 09:28:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:00,523 INFO L225 Difference]: With dead ends: 47072 [2019-09-08 09:28:00,523 INFO L226 Difference]: Without dead ends: 24433 [2019-09-08 09:28:00,571 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 09:28:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24433 states. [2019-09-08 09:28:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24433 to 22725. [2019-09-08 09:28:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-09-08 09:28:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 36556 transitions. [2019-09-08 09:28:02,133 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 36556 transitions. Word has length 72 [2019-09-08 09:28:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:02,134 INFO L475 AbstractCegarLoop]: Abstraction has 22725 states and 36556 transitions. [2019-09-08 09:28:02,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:28:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 36556 transitions. [2019-09-08 09:28:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 09:28:02,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:02,135 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 09:28:02,135 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash 624122737, now seen corresponding path program 1 times [2019-09-08 09:28:02,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:02,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:02,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:02,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:02,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:02,278 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 09:28:02,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:02,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:28:02,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:28:02,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:28:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:28:02,280 INFO L87 Difference]: Start difference. First operand 22725 states and 36556 transitions. Second operand 5 states. [2019-09-08 09:28:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:03,377 INFO L93 Difference]: Finished difference Result 64027 states and 103196 transitions. [2019-09-08 09:28:03,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:28:03,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 09:28:03,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:03,454 INFO L225 Difference]: With dead ends: 64027 [2019-09-08 09:28:03,454 INFO L226 Difference]: Without dead ends: 41388 [2019-09-08 09:28:03,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 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 09:28:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41388 states. [2019-09-08 09:28:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41388 to 41386. [2019-09-08 09:28:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41386 states. [2019-09-08 09:28:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41386 states to 41386 states and 66190 transitions. [2019-09-08 09:28:05,949 INFO L78 Accepts]: Start accepts. Automaton has 41386 states and 66190 transitions. Word has length 75 [2019-09-08 09:28:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:05,950 INFO L475 AbstractCegarLoop]: Abstraction has 41386 states and 66190 transitions. [2019-09-08 09:28:05,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:28:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 41386 states and 66190 transitions. [2019-09-08 09:28:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 09:28:05,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:05,951 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 09:28:05,951 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2128940941, now seen corresponding path program 1 times [2019-09-08 09:28:05,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:05,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:05,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:05,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:05,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:06,063 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 09:28:06,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:06,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:28:06,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:28:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:28:06,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:28:06,067 INFO L87 Difference]: Start difference. First operand 41386 states and 66190 transitions. Second operand 5 states. [2019-09-08 09:28:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:08,243 INFO L93 Difference]: Finished difference Result 72836 states and 115824 transitions. [2019-09-08 09:28:08,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:28:08,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 09:28:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:08,372 INFO L225 Difference]: With dead ends: 72836 [2019-09-08 09:28:08,372 INFO L226 Difference]: Without dead ends: 72834 [2019-09-08 09:28:08,391 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 09:28:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72834 states. [2019-09-08 09:28:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72834 to 42462. [2019-09-08 09:28:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42462 states. [2019-09-08 09:28:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42462 states to 42462 states and 67257 transitions. [2019-09-08 09:28:10,180 INFO L78 Accepts]: Start accepts. Automaton has 42462 states and 67257 transitions. Word has length 76 [2019-09-08 09:28:10,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:10,181 INFO L475 AbstractCegarLoop]: Abstraction has 42462 states and 67257 transitions. [2019-09-08 09:28:10,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:28:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 42462 states and 67257 transitions. [2019-09-08 09:28:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:28:10,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:10,184 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:28:10,185 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:10,185 INFO L82 PathProgramCache]: Analyzing trace with hash -294350133, now seen corresponding path program 1 times [2019-09-08 09:28:10,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:10,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:10,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:10,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:10,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:28:10,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:10,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:28:10,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:28:10,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:28:10,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:28:10,374 INFO L87 Difference]: Start difference. First operand 42462 states and 67257 transitions. Second operand 4 states. [2019-09-08 09:28:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:14,069 INFO L93 Difference]: Finished difference Result 89615 states and 142839 transitions. [2019-09-08 09:28:14,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:28:14,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 09:28:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:14,154 INFO L225 Difference]: With dead ends: 89615 [2019-09-08 09:28:14,154 INFO L226 Difference]: Without dead ends: 69547 [2019-09-08 09:28:14,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:28:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69547 states. [2019-09-08 09:28:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69547 to 61175. [2019-09-08 09:28:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61175 states. [2019-09-08 09:28:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61175 states to 61175 states and 97106 transitions. [2019-09-08 09:28:16,612 INFO L78 Accepts]: Start accepts. Automaton has 61175 states and 97106 transitions. Word has length 97 [2019-09-08 09:28:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:16,613 INFO L475 AbstractCegarLoop]: Abstraction has 61175 states and 97106 transitions. [2019-09-08 09:28:16,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:28:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 61175 states and 97106 transitions. [2019-09-08 09:28:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:28:16,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:16,614 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:28:16,615 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:16,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:16,615 INFO L82 PathProgramCache]: Analyzing trace with hash -266072244, now seen corresponding path program 1 times [2019-09-08 09:28:16,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:16,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:16,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:16,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:16,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:28:16,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:28:16,695 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 09:28:16,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:16,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:28:16,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:28:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 09:28:16,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:28:16,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:28:16,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:28:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:28:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:28:16,946 INFO L87 Difference]: Start difference. First operand 61175 states and 97106 transitions. Second operand 8 states. [2019-09-08 09:28:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:24,120 INFO L93 Difference]: Finished difference Result 142883 states and 228405 transitions. [2019-09-08 09:28:24,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:28:24,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-09-08 09:28:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:24,605 INFO L225 Difference]: With dead ends: 142883 [2019-09-08 09:28:24,605 INFO L226 Difference]: Without dead ends: 111893 [2019-09-08 09:28:24,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:28:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111893 states. [2019-09-08 09:28:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111893 to 92591. [2019-09-08 09:28:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92591 states. [2019-09-08 09:28:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92591 states to 92591 states and 147495 transitions. [2019-09-08 09:28:29,825 INFO L78 Accepts]: Start accepts. Automaton has 92591 states and 147495 transitions. Word has length 97 [2019-09-08 09:28:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:29,825 INFO L475 AbstractCegarLoop]: Abstraction has 92591 states and 147495 transitions. [2019-09-08 09:28:29,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:28:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 92591 states and 147495 transitions. [2019-09-08 09:28:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:28:29,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:29,827 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:28:29,827 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:29,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1991425558, now seen corresponding path program 1 times [2019-09-08 09:28:29,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:29,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:29,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:29,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:28:29,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:29,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:28:29,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:28:29,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:28:29,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:28:29,924 INFO L87 Difference]: Start difference. First operand 92591 states and 147495 transitions. Second operand 5 states. [2019-09-08 09:28:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:36,500 INFO L93 Difference]: Finished difference Result 172624 states and 276549 transitions. [2019-09-08 09:28:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:28:36,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 09:28:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:36,702 INFO L225 Difference]: With dead ends: 172624 [2019-09-08 09:28:36,703 INFO L226 Difference]: Without dead ends: 111792 [2019-09-08 09:28:36,775 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 09:28:36,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111792 states. [2019-09-08 09:28:41,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111792 to 110854. [2019-09-08 09:28:41,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110854 states. [2019-09-08 09:28:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110854 states to 110854 states and 176327 transitions. [2019-09-08 09:28:41,679 INFO L78 Accepts]: Start accepts. Automaton has 110854 states and 176327 transitions. Word has length 97 [2019-09-08 09:28:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:28:41,679 INFO L475 AbstractCegarLoop]: Abstraction has 110854 states and 176327 transitions. [2019-09-08 09:28:41,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:28:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 110854 states and 176327 transitions. [2019-09-08 09:28:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 09:28:41,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:28:41,681 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:28:41,681 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:28:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:28:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1914840343, now seen corresponding path program 1 times [2019-09-08 09:28:41,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:28:41,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:28:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:41,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:28:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:28:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:28:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:28:41,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:28:41,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:28:41,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:28:41,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:28:41,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:28:41,746 INFO L87 Difference]: Start difference. First operand 110854 states and 176327 transitions. Second operand 3 states. [2019-09-08 09:28:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:28:51,187 INFO L93 Difference]: Finished difference Result 287758 states and 459531 transitions. [2019-09-08 09:28:51,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:28:51,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 09:28:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:28:51,500 INFO L225 Difference]: With dead ends: 287758 [2019-09-08 09:28:51,501 INFO L226 Difference]: Without dead ends: 192633 [2019-09-08 09:28:51,592 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 09:28:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192633 states. [2019-09-08 09:29:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192633 to 192150. [2019-09-08 09:29:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192150 states. [2019-09-08 09:29:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192150 states to 192150 states and 306047 transitions. [2019-09-08 09:29:04,223 INFO L78 Accepts]: Start accepts. Automaton has 192150 states and 306047 transitions. Word has length 98 [2019-09-08 09:29:04,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:04,223 INFO L475 AbstractCegarLoop]: Abstraction has 192150 states and 306047 transitions. [2019-09-08 09:29:04,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:29:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 192150 states and 306047 transitions. [2019-09-08 09:29:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 09:29:04,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:04,226 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:04,226 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:04,227 INFO L82 PathProgramCache]: Analyzing trace with hash 443111312, now seen corresponding path program 1 times [2019-09-08 09:29:04,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:04,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:04,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:04,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:04,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 09:29:04,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:04,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:29:04,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:29:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:29:04,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:29:04,400 INFO L87 Difference]: Start difference. First operand 192150 states and 306047 transitions. Second operand 4 states. [2019-09-08 09:29:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:29:23,493 INFO L93 Difference]: Finished difference Result 482785 states and 772499 transitions. [2019-09-08 09:29:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:29:23,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-09-08 09:29:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:29:24,070 INFO L225 Difference]: With dead ends: 482785 [2019-09-08 09:29:24,071 INFO L226 Difference]: Without dead ends: 361396 [2019-09-08 09:29:24,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:29:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361396 states. [2019-09-08 09:29:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361396 to 309545. [2019-09-08 09:29:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309545 states. [2019-09-08 09:29:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309545 states to 309545 states and 493480 transitions. [2019-09-08 09:29:46,631 INFO L78 Accepts]: Start accepts. Automaton has 309545 states and 493480 transitions. Word has length 98 [2019-09-08 09:29:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:29:46,631 INFO L475 AbstractCegarLoop]: Abstraction has 309545 states and 493480 transitions. [2019-09-08 09:29:46,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:29:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand 309545 states and 493480 transitions. [2019-09-08 09:29:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:29:46,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:29:46,633 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:29:46,633 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:29:46,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:29:46,633 INFO L82 PathProgramCache]: Analyzing trace with hash 587107172, now seen corresponding path program 1 times [2019-09-08 09:29:46,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:29:46,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:29:46,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:46,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:29:46,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:29:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:29:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:29:46,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:29:46,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:29:46,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:29:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:29:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:29:46,698 INFO L87 Difference]: Start difference. First operand 309545 states and 493480 transitions. Second operand 3 states. [2019-09-08 09:30:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:30:28,630 INFO L93 Difference]: Finished difference Result 911556 states and 1453234 transitions. [2019-09-08 09:30:28,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:30:28,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 09:30:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:30:29,687 INFO L225 Difference]: With dead ends: 911556 [2019-09-08 09:30:29,688 INFO L226 Difference]: Without dead ends: 602097 [2019-09-08 09:30:29,935 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 09:30:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602097 states. [2019-09-08 09:31:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602097 to 602095. [2019-09-08 09:31:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602095 states. [2019-09-08 09:31:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602095 states to 602095 states and 953225 transitions. [2019-09-08 09:31:18,506 INFO L78 Accepts]: Start accepts. Automaton has 602095 states and 953225 transitions. Word has length 99 [2019-09-08 09:31:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:31:18,506 INFO L475 AbstractCegarLoop]: Abstraction has 602095 states and 953225 transitions. [2019-09-08 09:31:18,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:31:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 602095 states and 953225 transitions. [2019-09-08 09:31:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:31:18,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:31:18,509 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:31:18,509 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:31:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:31:18,510 INFO L82 PathProgramCache]: Analyzing trace with hash -133241042, now seen corresponding path program 1 times [2019-09-08 09:31:18,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:31:18,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:31:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:18,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:31:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:31:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:31:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:31:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:31:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:31:18,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:31:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:31:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:31:18,583 INFO L87 Difference]: Start difference. First operand 602095 states and 953225 transitions. Second operand 3 states. [2019-09-08 09:32:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:42,182 INFO L93 Difference]: Finished difference Result 1769071 states and 2800675 transitions. [2019-09-08 09:32:42,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:42,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 09:32:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:44,278 INFO L225 Difference]: With dead ends: 1769071 [2019-09-08 09:32:44,278 INFO L226 Difference]: Without dead ends: 1167109 [2019-09-08 09:32:44,819 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 09:32:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167109 states. [2019-09-08 09:34:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167109 to 1167107. [2019-09-08 09:34:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167107 states. [2019-09-08 09:34:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167107 states to 1167107 states and 1833561 transitions. [2019-09-08 09:34:42,160 INFO L78 Accepts]: Start accepts. Automaton has 1167107 states and 1833561 transitions. Word has length 99 [2019-09-08 09:34:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:34:42,160 INFO L475 AbstractCegarLoop]: Abstraction has 1167107 states and 1833561 transitions. [2019-09-08 09:34:42,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:34:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1167107 states and 1833561 transitions. [2019-09-08 09:34:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:34:42,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:34:42,165 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 09:34:42,165 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:34:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:34:42,166 INFO L82 PathProgramCache]: Analyzing trace with hash 999057199, now seen corresponding path program 1 times [2019-09-08 09:34:42,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:34:42,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:34:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:42,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:34:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:34:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:34:42,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:34:42,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:34:42,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:34:42,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:34:42,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:34:42,242 INFO L87 Difference]: Start difference. First operand 1167107 states and 1833561 transitions. Second operand 3 states. [2019-09-08 09:36:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:22,930 INFO L93 Difference]: Finished difference Result 1733683 states and 2716628 transitions. [2019-09-08 09:36:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:36:22,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 09:36:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:25,378 INFO L225 Difference]: With dead ends: 1733683 [2019-09-08 09:36:25,379 INFO L226 Difference]: Without dead ends: 1167239 [2019-09-08 09:36:25,896 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 09:36:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167239 states.