java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:47:46,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:47:46,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:47:46,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:47:46,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:47:46,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:47:46,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:47:46,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:47:46,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:47:46,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:47:46,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:47:46,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:47:46,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:47:46,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:47:46,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:47:46,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:47:46,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:47:46,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:47:46,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:47:46,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:47:46,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:47:46,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:47:46,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:47:46,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:47:46,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:47:46,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:47:46,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:47:46,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:47:46,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:47:46,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:47:46,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:47:46,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:47:46,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:47:46,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:47:46,622 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:47:46,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:47:46,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:47:46,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:47:46,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:47:46,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:47:46,625 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:47:46,626 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:47:46,645 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:47:46,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:47:46,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:47:46,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:47:46,648 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:47:46,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:47:46,648 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:47:46,648 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:47:46,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:47:46,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:47:46,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:47:46,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:47:46,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:47:46,650 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:47:46,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:47:46,651 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:47:46,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:47:46,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:47:46,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:47:46,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:47:46,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:47:46,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:47:46,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:47:46,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:47:46,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:47:46,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:47:46,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:47:46,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:47:46,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:47:46,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:47:46,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:47:46,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:47:46,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:47:46,735 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:47:46,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 10:47:46,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93edbdd75/6635aa494ef0423da36b1119eb555ea4/FLAGb735a2098 [2019-09-08 10:47:47,289 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:47:47,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 10:47:47,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93edbdd75/6635aa494ef0423da36b1119eb555ea4/FLAGb735a2098 [2019-09-08 10:47:47,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93edbdd75/6635aa494ef0423da36b1119eb555ea4 [2019-09-08 10:47:47,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:47:47,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:47:47,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:47:47,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:47:47,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:47:47,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:47:47" (1/1) ... [2019-09-08 10:47:47,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc34360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:47, skipping insertion in model container [2019-09-08 10:47:47,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:47:47" (1/1) ... [2019-09-08 10:47:47,631 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:47:47,681 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:47:48,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:47:48,077 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:47:48,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:47:48,216 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:47:48,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:48 WrapperNode [2019-09-08 10:47:48,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:47:48,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:47:48,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:47:48,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:47:48,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:48" (1/1) ... [2019-09-08 10:47:48,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:48" (1/1) ... [2019-09-08 10:47:48,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:48" (1/1) ... [2019-09-08 10:47:48,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:48" (1/1) ... [2019-09-08 10:47:48,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:48" (1/1) ... [2019-09-08 10:47:48,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:48" (1/1) ... [2019-09-08 10:47:48,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:48" (1/1) ... [2019-09-08 10:47:48,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:47:48,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:47:48,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:47:48,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:47:48,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47: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 10:47:48,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:47:48,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:47:48,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:47:48,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:47:48,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:47:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:47:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:47:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:47:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:47:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:47:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:47:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:47:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:47:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:47:49,311 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:47:49,311 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:47:49,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:47:49 BoogieIcfgContainer [2019-09-08 10:47:49,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:47:49,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:47:49,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:47:49,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:47:49,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:47:47" (1/3) ... [2019-09-08 10:47:49,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f24a3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:47:49, skipping insertion in model container [2019-09-08 10:47:49,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:48" (2/3) ... [2019-09-08 10:47:49,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f24a3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:47:49, skipping insertion in model container [2019-09-08 10:47:49,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:47:49" (3/3) ... [2019-09-08 10:47:49,322 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 10:47:49,334 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:47:49,358 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:47:49,378 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:47:49,424 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:47:49,425 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:47:49,425 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:47:49,426 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:47:49,426 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:47:49,427 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:47:49,427 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:47:49,427 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:47:49,427 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:47:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states. [2019-09-08 10:47:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:47:49,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:49,480 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 10:47:49,481 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:49,487 INFO L82 PathProgramCache]: Analyzing trace with hash 683550828, now seen corresponding path program 1 times [2019-09-08 10:47:49,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:49,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:49,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:49,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:49,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:50,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:50,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:47:50,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:47:50,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:47:50,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:47:50,118 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 7 states. [2019-09-08 10:47:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:50,679 INFO L93 Difference]: Finished difference Result 1094 states and 1732 transitions. [2019-09-08 10:47:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:47:50,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-08 10:47:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:50,705 INFO L225 Difference]: With dead ends: 1094 [2019-09-08 10:47:50,705 INFO L226 Difference]: Without dead ends: 966 [2019-09-08 10:47:50,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:47:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-09-08 10:47:50,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 486. [2019-09-08 10:47:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-09-08 10:47:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 744 transitions. [2019-09-08 10:47:50,811 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 744 transitions. Word has length 68 [2019-09-08 10:47:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:50,812 INFO L475 AbstractCegarLoop]: Abstraction has 486 states and 744 transitions. [2019-09-08 10:47:50,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:47:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 744 transitions. [2019-09-08 10:47:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:47:50,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:50,819 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 10:47:50,819 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:50,820 INFO L82 PathProgramCache]: Analyzing trace with hash -544332480, now seen corresponding path program 1 times [2019-09-08 10:47:50,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:50,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:50,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:50,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:50,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:51,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:51,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:47:51,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:47:51,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:47:51,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:47:51,080 INFO L87 Difference]: Start difference. First operand 486 states and 744 transitions. Second operand 6 states. [2019-09-08 10:47:51,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:51,411 INFO L93 Difference]: Finished difference Result 1746 states and 2707 transitions. [2019-09-08 10:47:51,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:47:51,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:47:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:51,422 INFO L225 Difference]: With dead ends: 1746 [2019-09-08 10:47:51,422 INFO L226 Difference]: Without dead ends: 1323 [2019-09-08 10:47:51,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:47:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2019-09-08 10:47:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1317. [2019-09-08 10:47:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-09-08 10:47:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 2022 transitions. [2019-09-08 10:47:51,539 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 2022 transitions. Word has length 69 [2019-09-08 10:47:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:51,539 INFO L475 AbstractCegarLoop]: Abstraction has 1317 states and 2022 transitions. [2019-09-08 10:47:51,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:47:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 2022 transitions. [2019-09-08 10:47:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:47:51,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:51,543 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 10:47:51,543 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:51,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1350032547, now seen corresponding path program 1 times [2019-09-08 10:47:51,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:51,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:51,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:51,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:51,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:51,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:51,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:47:51,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:47:51,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:47:51,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:47:51,691 INFO L87 Difference]: Start difference. First operand 1317 states and 2022 transitions. Second operand 6 states. [2019-09-08 10:47:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:52,218 INFO L93 Difference]: Finished difference Result 4712 states and 7296 transitions. [2019-09-08 10:47:52,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:47:52,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:47:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:52,239 INFO L225 Difference]: With dead ends: 4712 [2019-09-08 10:47:52,240 INFO L226 Difference]: Without dead ends: 3446 [2019-09-08 10:47:52,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:47:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3446 states. [2019-09-08 10:47:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3446 to 3442. [2019-09-08 10:47:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3442 states. [2019-09-08 10:47:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 5303 transitions. [2019-09-08 10:47:52,463 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 5303 transitions. Word has length 70 [2019-09-08 10:47:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:52,465 INFO L475 AbstractCegarLoop]: Abstraction has 3442 states and 5303 transitions. [2019-09-08 10:47:52,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:47:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 5303 transitions. [2019-09-08 10:47:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:47:52,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:52,472 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 10:47:52,472 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:52,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:52,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1943826305, now seen corresponding path program 1 times [2019-09-08 10:47:52,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:52,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:52,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:52,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:52,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:52,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:52,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:47:52,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:47:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:47:52,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:47:52,672 INFO L87 Difference]: Start difference. First operand 3442 states and 5303 transitions. Second operand 6 states. [2019-09-08 10:47:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:53,671 INFO L93 Difference]: Finished difference Result 12661 states and 19581 transitions. [2019-09-08 10:47:53,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:47:53,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:47:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:53,720 INFO L225 Difference]: With dead ends: 12661 [2019-09-08 10:47:53,720 INFO L226 Difference]: Without dead ends: 9320 [2019-09-08 10:47:53,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:47:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9320 states. [2019-09-08 10:47:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9320 to 8301. [2019-09-08 10:47:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8301 states. [2019-09-08 10:47:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 12771 transitions. [2019-09-08 10:47:54,264 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 12771 transitions. Word has length 70 [2019-09-08 10:47:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:54,264 INFO L475 AbstractCegarLoop]: Abstraction has 8301 states and 12771 transitions. [2019-09-08 10:47:54,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:47:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 12771 transitions. [2019-09-08 10:47:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:47:54,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:54,267 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 10:47:54,267 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:54,268 INFO L82 PathProgramCache]: Analyzing trace with hash -109542418, now seen corresponding path program 1 times [2019-09-08 10:47:54,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:54,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:54,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:54,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:54,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:54,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:47:54,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:47:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:47:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:47:54,363 INFO L87 Difference]: Start difference. First operand 8301 states and 12771 transitions. Second operand 6 states. [2019-09-08 10:47:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:55,639 INFO L93 Difference]: Finished difference Result 31818 states and 48956 transitions. [2019-09-08 10:47:55,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:47:55,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:47:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:55,736 INFO L225 Difference]: With dead ends: 31818 [2019-09-08 10:47:55,737 INFO L226 Difference]: Without dead ends: 23591 [2019-09-08 10:47:55,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:47:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23591 states. [2019-09-08 10:47:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23591 to 23587. [2019-09-08 10:47:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23587 states. [2019-09-08 10:47:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23587 states to 23587 states and 36101 transitions. [2019-09-08 10:47:57,225 INFO L78 Accepts]: Start accepts. Automaton has 23587 states and 36101 transitions. Word has length 70 [2019-09-08 10:47:57,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:57,225 INFO L475 AbstractCegarLoop]: Abstraction has 23587 states and 36101 transitions. [2019-09-08 10:47:57,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:47:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 23587 states and 36101 transitions. [2019-09-08 10:47:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:47:57,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:57,228 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] [2019-09-08 10:47:57,229 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:57,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:57,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1108561564, now seen corresponding path program 1 times [2019-09-08 10:47:57,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:57,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:57,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:57,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:47:57,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:57,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:47:57,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:47:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:47:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:47:57,329 INFO L87 Difference]: Start difference. First operand 23587 states and 36101 transitions. Second operand 5 states. [2019-09-08 10:47:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:59,701 INFO L93 Difference]: Finished difference Result 64971 states and 99488 transitions. [2019-09-08 10:47:59,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:47:59,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:47:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:59,806 INFO L225 Difference]: With dead ends: 64971 [2019-09-08 10:47:59,807 INFO L226 Difference]: Without dead ends: 41437 [2019-09-08 10:47:59,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:47:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41437 states. [2019-09-08 10:48:01,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41437 to 41435. [2019-09-08 10:48:01,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41435 states. [2019-09-08 10:48:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41435 states to 41435 states and 63030 transitions. [2019-09-08 10:48:01,676 INFO L78 Accepts]: Start accepts. Automaton has 41435 states and 63030 transitions. Word has length 71 [2019-09-08 10:48:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:01,677 INFO L475 AbstractCegarLoop]: Abstraction has 41435 states and 63030 transitions. [2019-09-08 10:48:01,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:48:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 41435 states and 63030 transitions. [2019-09-08 10:48:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:48:01,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:01,684 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] [2019-09-08 10:48:01,685 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash -303530613, now seen corresponding path program 1 times [2019-09-08 10:48:01,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:01,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:01,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:01,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:01,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:01,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:01,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:48:01,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:48:01,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:48:01,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:48:01,786 INFO L87 Difference]: Start difference. First operand 41435 states and 63030 transitions. Second operand 5 states. [2019-09-08 10:48:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:05,050 INFO L93 Difference]: Finished difference Result 69247 states and 104728 transitions. [2019-09-08 10:48:05,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:48:05,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:48:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:05,218 INFO L225 Difference]: With dead ends: 69247 [2019-09-08 10:48:05,219 INFO L226 Difference]: Without dead ends: 69245 [2019-09-08 10:48:05,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69245 states. [2019-09-08 10:48:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69245 to 42119. [2019-09-08 10:48:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42119 states. [2019-09-08 10:48:07,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42119 states to 42119 states and 63507 transitions. [2019-09-08 10:48:07,235 INFO L78 Accepts]: Start accepts. Automaton has 42119 states and 63507 transitions. Word has length 71 [2019-09-08 10:48:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:07,235 INFO L475 AbstractCegarLoop]: Abstraction has 42119 states and 63507 transitions. [2019-09-08 10:48:07,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:48:07,236 INFO L276 IsEmpty]: Start isEmpty. Operand 42119 states and 63507 transitions. [2019-09-08 10:48:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:48:07,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:07,241 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 10:48:07,241 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:07,242 INFO L82 PathProgramCache]: Analyzing trace with hash -561080171, now seen corresponding path program 1 times [2019-09-08 10:48:07,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:07,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:07,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:07,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:07,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:07,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:48:07,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:48:07,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:48:07,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:48:07,320 INFO L87 Difference]: Start difference. First operand 42119 states and 63507 transitions. Second operand 4 states. [2019-09-08 10:48:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:11,009 INFO L93 Difference]: Finished difference Result 109848 states and 165119 transitions. [2019-09-08 10:48:11,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:48:11,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-09-08 10:48:11,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:11,148 INFO L225 Difference]: With dead ends: 109848 [2019-09-08 10:48:11,148 INFO L226 Difference]: Without dead ends: 68638 [2019-09-08 10:48:11,220 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 10:48:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68638 states. [2019-09-08 10:48:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68638 to 68636. [2019-09-08 10:48:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68636 states. [2019-09-08 10:48:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68636 states to 68636 states and 102519 transitions. [2019-09-08 10:48:14,008 INFO L78 Accepts]: Start accepts. Automaton has 68636 states and 102519 transitions. Word has length 72 [2019-09-08 10:48:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:14,008 INFO L475 AbstractCegarLoop]: Abstraction has 68636 states and 102519 transitions. [2019-09-08 10:48:14,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:48:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 68636 states and 102519 transitions. [2019-09-08 10:48:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:48:14,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:14,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:14,013 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:14,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2048899875, now seen corresponding path program 1 times [2019-09-08 10:48:14,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:14,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:14,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:14,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:14,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:14,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:14,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:48:14,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:48:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:48:14,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:48:14,120 INFO L87 Difference]: Start difference. First operand 68636 states and 102519 transitions. Second operand 7 states. [2019-09-08 10:48:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:36,796 INFO L93 Difference]: Finished difference Result 487755 states and 723238 transitions. [2019-09-08 10:48:36,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:48:36,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-08 10:48:36,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:37,662 INFO L225 Difference]: With dead ends: 487755 [2019-09-08 10:48:37,663 INFO L226 Difference]: Without dead ends: 433851 [2019-09-08 10:48:37,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:48:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433851 states. [2019-09-08 10:48:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433851 to 68750. [2019-09-08 10:48:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2019-09-08 10:48:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 102669 transitions. [2019-09-08 10:48:48,335 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 102669 transitions. Word has length 73 [2019-09-08 10:48:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:48,335 INFO L475 AbstractCegarLoop]: Abstraction has 68750 states and 102669 transitions. [2019-09-08 10:48:48,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:48:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 102669 transitions. [2019-09-08 10:48:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:48:48,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:48,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:48,340 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash 238965989, now seen corresponding path program 1 times [2019-09-08 10:48:48,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:48,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:48,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:48,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:48:48,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:48,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:48:48,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:48:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:48:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:48,397 INFO L87 Difference]: Start difference. First operand 68750 states and 102669 transitions. Second operand 3 states. [2019-09-08 10:48:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:54,002 INFO L93 Difference]: Finished difference Result 132668 states and 198002 transitions. [2019-09-08 10:48:54,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:48:54,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:48:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:54,123 INFO L225 Difference]: With dead ends: 132668 [2019-09-08 10:48:54,123 INFO L226 Difference]: Without dead ends: 91446 [2019-09-08 10:48:54,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:48:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91446 states. [2019-09-08 10:49:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91446 to 90109. [2019-09-08 10:49:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90109 states. [2019-09-08 10:49:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90109 states to 90109 states and 132600 transitions. [2019-09-08 10:49:02,175 INFO L78 Accepts]: Start accepts. Automaton has 90109 states and 132600 transitions. Word has length 73 [2019-09-08 10:49:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:02,176 INFO L475 AbstractCegarLoop]: Abstraction has 90109 states and 132600 transitions. [2019-09-08 10:49:02,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:49:02,176 INFO L276 IsEmpty]: Start isEmpty. Operand 90109 states and 132600 transitions. [2019-09-08 10:49:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:49:02,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:02,182 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:02,182 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash -346722011, now seen corresponding path program 1 times [2019-09-08 10:49:02,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:02,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:02,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:02,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:02,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:02,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:02,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:49:02,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:49:02,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:49:02,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:02,258 INFO L87 Difference]: Start difference. First operand 90109 states and 132600 transitions. Second operand 3 states. [2019-09-08 10:49:09,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:09,676 INFO L93 Difference]: Finished difference Result 203209 states and 298750 transitions. [2019-09-08 10:49:09,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:49:09,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:49:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:09,864 INFO L225 Difference]: With dead ends: 203209 [2019-09-08 10:49:09,864 INFO L226 Difference]: Without dead ends: 122975 [2019-09-08 10:49:09,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122975 states. [2019-09-08 10:49:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122975 to 87305. [2019-09-08 10:49:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87305 states. [2019-09-08 10:49:17,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87305 states to 87305 states and 126690 transitions. [2019-09-08 10:49:17,167 INFO L78 Accepts]: Start accepts. Automaton has 87305 states and 126690 transitions. Word has length 73 [2019-09-08 10:49:17,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:17,167 INFO L475 AbstractCegarLoop]: Abstraction has 87305 states and 126690 transitions. [2019-09-08 10:49:17,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:49:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 87305 states and 126690 transitions. [2019-09-08 10:49:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:49:17,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:17,171 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:17,172 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:17,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1044647045, now seen corresponding path program 1 times [2019-09-08 10:49:17,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:17,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:17,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:17,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:17,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:49:17,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:17,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:49:17,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:49:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:49:17,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:49:17,282 INFO L87 Difference]: Start difference. First operand 87305 states and 126690 transitions. Second operand 7 states. [2019-09-08 10:49:57,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:57,003 INFO L93 Difference]: Finished difference Result 498295 states and 715340 transitions. [2019-09-08 10:49:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:49:57,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-09-08 10:49:57,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:57,860 INFO L225 Difference]: With dead ends: 498295 [2019-09-08 10:49:57,860 INFO L226 Difference]: Without dead ends: 455583 [2019-09-08 10:49:57,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:49:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455583 states. [2019-09-08 10:50:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455583 to 87541. [2019-09-08 10:50:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87541 states. [2019-09-08 10:50:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87541 states to 87541 states and 127010 transitions. [2019-09-08 10:50:09,749 INFO L78 Accepts]: Start accepts. Automaton has 87541 states and 127010 transitions. Word has length 73 [2019-09-08 10:50:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:09,750 INFO L475 AbstractCegarLoop]: Abstraction has 87541 states and 127010 transitions. [2019-09-08 10:50:09,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:50:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 87541 states and 127010 transitions. [2019-09-08 10:50:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:50:09,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:09,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:50:09,755 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1268901397, now seen corresponding path program 1 times [2019-09-08 10:50:09,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:09,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:09,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:09,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:09,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:09,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:50:09,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:50:09,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:50:09,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:09,810 INFO L87 Difference]: Start difference. First operand 87541 states and 127010 transitions. Second operand 3 states. [2019-09-08 10:50:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:21,204 INFO L93 Difference]: Finished difference Result 187387 states and 270919 transitions. [2019-09-08 10:50:21,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:50:21,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:50:21,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:21,371 INFO L225 Difference]: With dead ends: 187387 [2019-09-08 10:50:21,372 INFO L226 Difference]: Without dead ends: 109563 [2019-09-08 10:50:21,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109563 states. [2019-09-08 10:50:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109563 to 108257. [2019-09-08 10:50:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108257 states. [2019-09-08 10:50:31,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108257 states to 108257 states and 153474 transitions. [2019-09-08 10:50:31,438 INFO L78 Accepts]: Start accepts. Automaton has 108257 states and 153474 transitions. Word has length 74 [2019-09-08 10:50:31,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:31,439 INFO L475 AbstractCegarLoop]: Abstraction has 108257 states and 153474 transitions. [2019-09-08 10:50:31,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:50:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand 108257 states and 153474 transitions. [2019-09-08 10:50:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:50:31,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:31,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:50:31,444 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:31,445 INFO L82 PathProgramCache]: Analyzing trace with hash 630444013, now seen corresponding path program 1 times [2019-09-08 10:50:31,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:31,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:31,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:31,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:31,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:50:31,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:31,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:50:31,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:50:31,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:50:31,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:50:31,550 INFO L87 Difference]: Start difference. First operand 108257 states and 153474 transitions. Second operand 7 states. [2019-09-08 10:51:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:17,757 INFO L93 Difference]: Finished difference Result 501151 states and 700903 transitions. [2019-09-08 10:51:17,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:51:17,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:51:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:18,436 INFO L225 Difference]: With dead ends: 501151 [2019-09-08 10:51:18,436 INFO L226 Difference]: Without dead ends: 394044 [2019-09-08 10:51:18,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:51:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394044 states. [2019-09-08 10:51:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394044 to 108307. [2019-09-08 10:51:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108307 states. [2019-09-08 10:51:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108307 states to 108307 states and 153534 transitions. [2019-09-08 10:51:32,455 INFO L78 Accepts]: Start accepts. Automaton has 108307 states and 153534 transitions. Word has length 74 [2019-09-08 10:51:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:32,455 INFO L475 AbstractCegarLoop]: Abstraction has 108307 states and 153534 transitions. [2019-09-08 10:51:32,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:51:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 108307 states and 153534 transitions. [2019-09-08 10:51:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:51:32,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:32,462 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 10:51:32,462 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1809008464, now seen corresponding path program 1 times [2019-09-08 10:51:32,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:32,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:32,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:32,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:32,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:32,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:51:32,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:51:32,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:51:32,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:51:32,544 INFO L87 Difference]: Start difference. First operand 108307 states and 153534 transitions. Second operand 6 states. [2019-09-08 10:51:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:58,257 INFO L93 Difference]: Finished difference Result 261735 states and 372177 transitions. [2019-09-08 10:51:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:51:58,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-09-08 10:51:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:58,628 INFO L225 Difference]: With dead ends: 261735 [2019-09-08 10:51:58,629 INFO L226 Difference]: Without dead ends: 222853 [2019-09-08 10:51:58,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:51:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222853 states. [2019-09-08 10:52:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222853 to 125662. [2019-09-08 10:52:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125662 states. [2019-09-08 10:52:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125662 states to 125662 states and 178514 transitions. [2019-09-08 10:52:14,156 INFO L78 Accepts]: Start accepts. Automaton has 125662 states and 178514 transitions. Word has length 75 [2019-09-08 10:52:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:14,156 INFO L475 AbstractCegarLoop]: Abstraction has 125662 states and 178514 transitions. [2019-09-08 10:52:14,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:52:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 125662 states and 178514 transitions. [2019-09-08 10:52:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:52:14,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:14,163 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 10:52:14,163 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:14,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1271972534, now seen corresponding path program 1 times [2019-09-08 10:52:14,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:14,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:14,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:14,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:14,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:52:14,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:14,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:52:14,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:52:14,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:52:14,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:52:14,258 INFO L87 Difference]: Start difference. First operand 125662 states and 178514 transitions. Second operand 6 states. [2019-09-08 10:52:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:41,830 INFO L93 Difference]: Finished difference Result 290647 states and 413619 transitions. [2019-09-08 10:52:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:52:41,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 10:52:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:42,358 INFO L225 Difference]: With dead ends: 290647 [2019-09-08 10:52:42,358 INFO L226 Difference]: Without dead ends: 232925 [2019-09-08 10:52:42,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:52:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232925 states. [2019-09-08 10:53:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232925 to 142133. [2019-09-08 10:53:03,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142133 states. [2019-09-08 10:53:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142133 states to 142133 states and 202212 transitions. [2019-09-08 10:53:04,243 INFO L78 Accepts]: Start accepts. Automaton has 142133 states and 202212 transitions. Word has length 76 [2019-09-08 10:53:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:04,243 INFO L475 AbstractCegarLoop]: Abstraction has 142133 states and 202212 transitions. [2019-09-08 10:53:04,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:53:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 142133 states and 202212 transitions. [2019-09-08 10:53:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:53:04,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:04,249 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 10:53:04,249 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:04,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:04,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1040570376, now seen corresponding path program 1 times [2019-09-08 10:53:04,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:04,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:04,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:04,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:04,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:53:04,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:53:04,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:53:04,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:53:04,347 INFO L87 Difference]: Start difference. First operand 142133 states and 202212 transitions. Second operand 6 states. [2019-09-08 10:53:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:33,791 INFO L93 Difference]: Finished difference Result 313043 states and 445622 transitions. [2019-09-08 10:53:33,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:53:33,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 10:53:33,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:34,179 INFO L225 Difference]: With dead ends: 313043 [2019-09-08 10:53:34,180 INFO L226 Difference]: Without dead ends: 244170 [2019-09-08 10:53:34,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:53:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244170 states. [2019-09-08 10:53:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244170 to 157729. [2019-09-08 10:53:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157729 states. [2019-09-08 10:53:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157729 states to 157729 states and 224582 transitions. [2019-09-08 10:53:58,832 INFO L78 Accepts]: Start accepts. Automaton has 157729 states and 224582 transitions. Word has length 76 [2019-09-08 10:53:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:58,833 INFO L475 AbstractCegarLoop]: Abstraction has 157729 states and 224582 transitions. [2019-09-08 10:53:58,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:53:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 157729 states and 224582 transitions. [2019-09-08 10:53:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:53:58,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:58,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:53:58,840 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash -742087564, now seen corresponding path program 1 times [2019-09-08 10:53:58,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:58,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:58,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:58,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:58,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:53:58,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:53:58,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:53:58,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:53:58,897 INFO L87 Difference]: Start difference. First operand 157729 states and 224582 transitions. Second operand 3 states. [2019-09-08 10:54:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:21,941 INFO L93 Difference]: Finished difference Result 251690 states and 356268 transitions. [2019-09-08 10:54:21,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:54:21,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:54:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:22,236 INFO L225 Difference]: With dead ends: 251690 [2019-09-08 10:54:22,236 INFO L226 Difference]: Without dead ends: 181288 [2019-09-08 10:54:22,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:54:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181288 states. [2019-09-08 10:54:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181288 to 161442. [2019-09-08 10:54:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161442 states. [2019-09-08 10:54:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161442 states to 161442 states and 226404 transitions. [2019-09-08 10:54:47,357 INFO L78 Accepts]: Start accepts. Automaton has 161442 states and 226404 transitions. Word has length 78 [2019-09-08 10:54:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:47,357 INFO L475 AbstractCegarLoop]: Abstraction has 161442 states and 226404 transitions. [2019-09-08 10:54:47,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:54:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 161442 states and 226404 transitions. [2019-09-08 10:54:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:54:47,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:47,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:54:47,365 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:47,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1778262732, now seen corresponding path program 1 times [2019-09-08 10:54:47,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:47,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:47,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:47,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:47,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:47,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:47,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:54:47,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:54:47,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:54:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:54:47,464 INFO L87 Difference]: Start difference. First operand 161442 states and 226404 transitions. Second operand 7 states. [2019-09-08 10:56:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:33,027 INFO L93 Difference]: Finished difference Result 707354 states and 976206 transitions. [2019-09-08 10:56:33,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:56:33,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-08 10:56:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:34,209 INFO L225 Difference]: With dead ends: 707354 [2019-09-08 10:56:34,209 INFO L226 Difference]: Without dead ends: 670902 [2019-09-08 10:56:34,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:56:34,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670902 states. [2019-09-08 10:57:09,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670902 to 161778. [2019-09-08 10:57:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161778 states. [2019-09-08 10:57:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161778 states to 161778 states and 226815 transitions. [2019-09-08 10:57:09,630 INFO L78 Accepts]: Start accepts. Automaton has 161778 states and 226815 transitions. Word has length 79 [2019-09-08 10:57:09,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:57:09,630 INFO L475 AbstractCegarLoop]: Abstraction has 161778 states and 226815 transitions. [2019-09-08 10:57:09,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:57:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 161778 states and 226815 transitions. [2019-09-08 10:57:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:57:09,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:57:09,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:57:09,640 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:57:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:57:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1452335433, now seen corresponding path program 1 times [2019-09-08 10:57:09,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:57:09,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:57:09,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:09,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:57:09,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:57:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:57:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:57:09,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:57:09,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:57:09,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:57:09,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:57:09,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:57:09,851 INFO L87 Difference]: Start difference. First operand 161778 states and 226815 transitions. Second operand 10 states. [2019-09-08 10:59:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:01,605 INFO L93 Difference]: Finished difference Result 681080 states and 951827 transitions. [2019-09-08 10:59:01,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 10:59:01,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2019-09-08 10:59:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:02,691 INFO L225 Difference]: With dead ends: 681080 [2019-09-08 10:59:02,691 INFO L226 Difference]: Without dead ends: 613940 [2019-09-08 10:59:02,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=890, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 10:59:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613940 states. [2019-09-08 10:59:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613940 to 161778. [2019-09-08 10:59:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161778 states. [2019-09-08 10:59:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161778 states to 161778 states and 226801 transitions. [2019-09-08 10:59:38,900 INFO L78 Accepts]: Start accepts. Automaton has 161778 states and 226801 transitions. Word has length 80 [2019-09-08 10:59:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:38,900 INFO L475 AbstractCegarLoop]: Abstraction has 161778 states and 226801 transitions. [2019-09-08 10:59:38,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:59:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 161778 states and 226801 transitions. [2019-09-08 10:59:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 10:59:38,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:38,910 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:38,910 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:38,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:38,911 INFO L82 PathProgramCache]: Analyzing trace with hash -295195487, now seen corresponding path program 1 times [2019-09-08 10:59:38,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:38,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:38,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:38,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:38,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:39,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:39,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:59:39,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:59:39,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:59:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:59:39,097 INFO L87 Difference]: Start difference. First operand 161778 states and 226801 transitions. Second operand 10 states.