java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:56:17,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:56:17,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:56:17,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:56:17,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:56:17,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:56:17,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:56:17,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:56:17,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:56:17,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:56:17,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:56:17,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:56:17,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:56:17,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:56:17,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:56:17,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:56:17,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:56:17,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:56:17,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:56:17,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:56:17,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:56:17,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:56:17,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:56:17,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:56:17,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:56:17,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:56:17,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:56:17,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:56:17,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:56:17,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:56:17,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:56:17,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:56:17,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:56:17,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:56:17,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:56:17,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:56:17,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:56:17,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:56:17,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:56:17,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:56:17,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:56:17,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:56:17,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:56:17,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:56:17,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:56:17,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:56:17,377 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:56:17,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:56:17,378 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:56:17,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:56:17,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:56:17,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:56:17,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:56:17,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:56:17,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:56:17,379 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:56:17,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:56:17,379 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:56:17,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:56:17,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:56:17,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:56:17,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:56:17,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:56:17,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:56:17,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:56:17,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:56:17,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:56:17,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:56:17,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:56:17,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:56:17,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:56:17,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:56:17,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:56:17,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:56:17,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:56:17,428 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:56:17,429 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:56:17,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/317924536/63c09c45eb324dc2a435de785a746e4a/FLAG578e78307 [2019-09-08 12:56:18,028 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:56:18,030 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:56:18,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/317924536/63c09c45eb324dc2a435de785a746e4a/FLAG578e78307 [2019-09-08 12:56:18,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/317924536/63c09c45eb324dc2a435de785a746e4a [2019-09-08 12:56:18,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:56:18,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:56:18,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:56:18,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:56:18,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:56:18,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:56:18" (1/1) ... [2019-09-08 12:56:18,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18, skipping insertion in model container [2019-09-08 12:56:18,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:56:18" (1/1) ... [2019-09-08 12:56:18,359 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:56:18,424 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:56:18,838 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:56:18,859 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:56:18,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:56:18,992 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:56:18,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18 WrapperNode [2019-09-08 12:56:18,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:56:18,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:56:18,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:56:18,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:56:19,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18" (1/1) ... [2019-09-08 12:56:19,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18" (1/1) ... [2019-09-08 12:56:19,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18" (1/1) ... [2019-09-08 12:56:19,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18" (1/1) ... [2019-09-08 12:56:19,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18" (1/1) ... [2019-09-08 12:56:19,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18" (1/1) ... [2019-09-08 12:56:19,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18" (1/1) ... [2019-09-08 12:56:19,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:56:19,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:56:19,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:56:19,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:56:19,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:56:19,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:56:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:56:19,130 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:56:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:56:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:56:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:56:19,130 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:56:19,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:56:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:56:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:56:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:56:19,135 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:56:19,136 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:56:19,136 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:56:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:56:19,137 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:56:19,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:56:19,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:56:19,879 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:56:19,880 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:56:19,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:56:19 BoogieIcfgContainer [2019-09-08 12:56:19,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:56:19,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:56:19,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:56:19,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:56:19,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:56:18" (1/3) ... [2019-09-08 12:56:19,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a72f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:56:19, skipping insertion in model container [2019-09-08 12:56:19,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:56:18" (2/3) ... [2019-09-08 12:56:19,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a72f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:56:19, skipping insertion in model container [2019-09-08 12:56:19,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:56:19" (3/3) ... [2019-09-08 12:56:19,889 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 12:56:19,900 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:56:19,908 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:56:19,925 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:56:19,973 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:56:19,974 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:56:19,974 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:56:19,974 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:56:19,974 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:56:19,975 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:56:19,975 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:56:19,975 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:56:19,975 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:56:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-08 12:56:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 12:56:20,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:20,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:20,033 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:20,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:20,040 INFO L82 PathProgramCache]: Analyzing trace with hash -902016562, now seen corresponding path program 1 times [2019-09-08 12:56:20,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:20,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:20,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:20,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:20,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:20,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:20,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:56:20,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:56:20,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:56:20,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:20,569 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-08 12:56:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:20,714 INFO L93 Difference]: Finished difference Result 330 states and 554 transitions. [2019-09-08 12:56:20,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:56:20,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 12:56:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:20,732 INFO L225 Difference]: With dead ends: 330 [2019-09-08 12:56:20,733 INFO L226 Difference]: Without dead ends: 229 [2019-09-08 12:56:20,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-08 12:56:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-09-08 12:56:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-08 12:56:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 353 transitions. [2019-09-08 12:56:20,809 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 353 transitions. Word has length 66 [2019-09-08 12:56:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:20,810 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 353 transitions. [2019-09-08 12:56:20,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:56:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 353 transitions. [2019-09-08 12:56:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:56:20,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:20,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:20,818 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash 730168783, now seen corresponding path program 1 times [2019-09-08 12:56:20,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:20,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:20,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:20,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:20,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:21,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:21,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:56:21,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:56:21,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:56:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:21,013 INFO L87 Difference]: Start difference. First operand 227 states and 353 transitions. Second operand 3 states. [2019-09-08 12:56:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:21,081 INFO L93 Difference]: Finished difference Result 543 states and 873 transitions. [2019-09-08 12:56:21,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:56:21,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 12:56:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:21,091 INFO L225 Difference]: With dead ends: 543 [2019-09-08 12:56:21,091 INFO L226 Difference]: Without dead ends: 377 [2019-09-08 12:56:21,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-09-08 12:56:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2019-09-08 12:56:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-08 12:56:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 596 transitions. [2019-09-08 12:56:21,161 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 596 transitions. Word has length 68 [2019-09-08 12:56:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:21,161 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 596 transitions. [2019-09-08 12:56:21,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:56:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 596 transitions. [2019-09-08 12:56:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:56:21,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:21,165 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:21,166 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1550224880, now seen corresponding path program 1 times [2019-09-08 12:56:21,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:21,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:21,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:21,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:21,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:21,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:21,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:56:21,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:56:21,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:56:21,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:21,316 INFO L87 Difference]: Start difference. First operand 375 states and 596 transitions. Second operand 3 states. [2019-09-08 12:56:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:21,367 INFO L93 Difference]: Finished difference Result 971 states and 1574 transitions. [2019-09-08 12:56:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:56:21,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 12:56:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:21,372 INFO L225 Difference]: With dead ends: 971 [2019-09-08 12:56:21,372 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 12:56:21,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 12:56:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-09-08 12:56:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-09-08 12:56:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1052 transitions. [2019-09-08 12:56:21,413 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1052 transitions. Word has length 70 [2019-09-08 12:56:21,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:21,414 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1052 transitions. [2019-09-08 12:56:21,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:56:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1052 transitions. [2019-09-08 12:56:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 12:56:21,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:21,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:21,426 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2032710127, now seen corresponding path program 1 times [2019-09-08 12:56:21,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:21,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:21,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:21,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:21,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:21,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:56:21,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:56:21,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:56:21,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:56:21,691 INFO L87 Difference]: Start difference. First operand 655 states and 1052 transitions. Second operand 5 states. [2019-09-08 12:56:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:21,965 INFO L93 Difference]: Finished difference Result 2493 states and 4089 transitions. [2019-09-08 12:56:21,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:56:21,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 12:56:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:21,976 INFO L225 Difference]: With dead ends: 2493 [2019-09-08 12:56:21,976 INFO L226 Difference]: Without dead ends: 1899 [2019-09-08 12:56:21,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:56:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-09-08 12:56:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1419. [2019-09-08 12:56:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-09-08 12:56:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2316 transitions. [2019-09-08 12:56:22,065 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2316 transitions. Word has length 72 [2019-09-08 12:56:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:22,066 INFO L475 AbstractCegarLoop]: Abstraction has 1419 states and 2316 transitions. [2019-09-08 12:56:22,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:56:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2316 transitions. [2019-09-08 12:56:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 12:56:22,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:22,069 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:22,069 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1348885045, now seen corresponding path program 1 times [2019-09-08 12:56:22,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:22,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:22,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:22,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:22,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:56:22,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:56:22,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:56:22,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:56:22,167 INFO L87 Difference]: Start difference. First operand 1419 states and 2316 transitions. Second operand 4 states. [2019-09-08 12:56:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:22,324 INFO L93 Difference]: Finished difference Result 3342 states and 5493 transitions. [2019-09-08 12:56:22,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:56:22,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-08 12:56:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:22,336 INFO L225 Difference]: With dead ends: 3342 [2019-09-08 12:56:22,336 INFO L226 Difference]: Without dead ends: 1984 [2019-09-08 12:56:22,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:56:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2019-09-08 12:56:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1973. [2019-09-08 12:56:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-09-08 12:56:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 3226 transitions. [2019-09-08 12:56:22,449 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 3226 transitions. Word has length 73 [2019-09-08 12:56:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:22,449 INFO L475 AbstractCegarLoop]: Abstraction has 1973 states and 3226 transitions. [2019-09-08 12:56:22,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:56:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 3226 transitions. [2019-09-08 12:56:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:56:22,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:22,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:22,453 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:22,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash -408158820, now seen corresponding path program 1 times [2019-09-08 12:56:22,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:22,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:22,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:22,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:22,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:22,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:22,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:56:22,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:56:22,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:56:22,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:22,557 INFO L87 Difference]: Start difference. First operand 1973 states and 3226 transitions. Second operand 3 states. [2019-09-08 12:56:22,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:22,718 INFO L93 Difference]: Finished difference Result 4452 states and 7353 transitions. [2019-09-08 12:56:22,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:56:22,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 12:56:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:22,737 INFO L225 Difference]: With dead ends: 4452 [2019-09-08 12:56:22,737 INFO L226 Difference]: Without dead ends: 3019 [2019-09-08 12:56:22,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2019-09-08 12:56:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2019-09-08 12:56:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3017 states. [2019-09-08 12:56:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 4945 transitions. [2019-09-08 12:56:22,900 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 4945 transitions. Word has length 74 [2019-09-08 12:56:22,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:22,904 INFO L475 AbstractCegarLoop]: Abstraction has 3017 states and 4945 transitions. [2019-09-08 12:56:22,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:56:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 4945 transitions. [2019-09-08 12:56:22,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:56:22,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:22,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:22,907 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:22,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:22,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1561348457, now seen corresponding path program 1 times [2019-09-08 12:56:22,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:22,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:22,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:22,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:22,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:23,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:23,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:56:23,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:56:23,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:56:23,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:23,009 INFO L87 Difference]: Start difference. First operand 3017 states and 4945 transitions. Second operand 3 states. [2019-09-08 12:56:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:23,226 INFO L93 Difference]: Finished difference Result 5949 states and 9788 transitions. [2019-09-08 12:56:23,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:56:23,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 12:56:23,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:23,250 INFO L225 Difference]: With dead ends: 5949 [2019-09-08 12:56:23,250 INFO L226 Difference]: Without dead ends: 4227 [2019-09-08 12:56:23,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states. [2019-09-08 12:56:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 4225. [2019-09-08 12:56:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4225 states. [2019-09-08 12:56:23,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 6909 transitions. [2019-09-08 12:56:23,469 INFO L78 Accepts]: Start accepts. Automaton has 4225 states and 6909 transitions. Word has length 74 [2019-09-08 12:56:23,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:23,469 INFO L475 AbstractCegarLoop]: Abstraction has 4225 states and 6909 transitions. [2019-09-08 12:56:23,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:56:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4225 states and 6909 transitions. [2019-09-08 12:56:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:56:23,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:23,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:23,472 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:23,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1191289000, now seen corresponding path program 1 times [2019-09-08 12:56:23,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:23,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:23,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:23,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:23,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:23,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:23,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:56:23,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:56:23,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:56:23,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:56:23,590 INFO L87 Difference]: Start difference. First operand 4225 states and 6909 transitions. Second operand 7 states. [2019-09-08 12:56:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:24,485 INFO L93 Difference]: Finished difference Result 15458 states and 25180 transitions. [2019-09-08 12:56:24,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:56:24,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 12:56:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:24,592 INFO L225 Difference]: With dead ends: 15458 [2019-09-08 12:56:24,592 INFO L226 Difference]: Without dead ends: 11312 [2019-09-08 12:56:24,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:56:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11312 states. [2019-09-08 12:56:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11312 to 11249. [2019-09-08 12:56:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11249 states. [2019-09-08 12:56:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11249 states to 11249 states and 18159 transitions. [2019-09-08 12:56:25,378 INFO L78 Accepts]: Start accepts. Automaton has 11249 states and 18159 transitions. Word has length 74 [2019-09-08 12:56:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:25,378 INFO L475 AbstractCegarLoop]: Abstraction has 11249 states and 18159 transitions. [2019-09-08 12:56:25,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:56:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 11249 states and 18159 transitions. [2019-09-08 12:56:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:56:25,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:25,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:25,380 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:25,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1031073657, now seen corresponding path program 1 times [2019-09-08 12:56:25,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:25,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:25,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:25,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:25,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:25,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:56:25,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:56:25,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:56:25,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:25,449 INFO L87 Difference]: Start difference. First operand 11249 states and 18159 transitions. Second operand 3 states. [2019-09-08 12:56:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:26,129 INFO L93 Difference]: Finished difference Result 21475 states and 34729 transitions. [2019-09-08 12:56:26,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:56:26,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 12:56:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:26,168 INFO L225 Difference]: With dead ends: 21475 [2019-09-08 12:56:26,168 INFO L226 Difference]: Without dead ends: 14840 [2019-09-08 12:56:26,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14840 states. [2019-09-08 12:56:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14840 to 14838. [2019-09-08 12:56:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14838 states. [2019-09-08 12:56:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14838 states to 14838 states and 23808 transitions. [2019-09-08 12:56:27,033 INFO L78 Accepts]: Start accepts. Automaton has 14838 states and 23808 transitions. Word has length 74 [2019-09-08 12:56:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:27,033 INFO L475 AbstractCegarLoop]: Abstraction has 14838 states and 23808 transitions. [2019-09-08 12:56:27,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:56:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 14838 states and 23808 transitions. [2019-09-08 12:56:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 12:56:27,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:27,035 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:27,035 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1672252252, now seen corresponding path program 1 times [2019-09-08 12:56:27,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:27,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:27,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:27,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:27,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:56:27,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:56:27,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:56:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:56:27,124 INFO L87 Difference]: Start difference. First operand 14838 states and 23808 transitions. Second operand 4 states. [2019-09-08 12:56:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:28,958 INFO L93 Difference]: Finished difference Result 48335 states and 77697 transitions. [2019-09-08 12:56:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:56:28,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-09-08 12:56:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:29,067 INFO L225 Difference]: With dead ends: 48335 [2019-09-08 12:56:29,067 INFO L226 Difference]: Without dead ends: 33592 [2019-09-08 12:56:29,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:56:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33592 states. [2019-09-08 12:56:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33592 to 23281. [2019-09-08 12:56:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23281 states. [2019-09-08 12:56:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23281 states to 23281 states and 37225 transitions. [2019-09-08 12:56:30,456 INFO L78 Accepts]: Start accepts. Automaton has 23281 states and 37225 transitions. Word has length 75 [2019-09-08 12:56:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:30,460 INFO L475 AbstractCegarLoop]: Abstraction has 23281 states and 37225 transitions. [2019-09-08 12:56:30,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:56:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 23281 states and 37225 transitions. [2019-09-08 12:56:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:56:30,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:30,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, 1, 1] [2019-09-08 12:56:30,462 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:30,463 INFO L82 PathProgramCache]: Analyzing trace with hash -772989972, now seen corresponding path program 1 times [2019-09-08 12:56:30,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:30,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:30,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:30,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:30,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:56:30,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:56:30,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:56:30,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:56:30,669 INFO L87 Difference]: Start difference. First operand 23281 states and 37225 transitions. Second operand 5 states. [2019-09-08 12:56:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:32,130 INFO L93 Difference]: Finished difference Result 59190 states and 94672 transitions. [2019-09-08 12:56:32,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:56:32,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-08 12:56:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:32,236 INFO L225 Difference]: With dead ends: 59190 [2019-09-08 12:56:32,237 INFO L226 Difference]: Without dead ends: 36004 [2019-09-08 12:56:32,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:56:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36004 states. [2019-09-08 12:56:34,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36004 to 34012. [2019-09-08 12:56:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34012 states. [2019-09-08 12:56:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34012 states to 34012 states and 54194 transitions. [2019-09-08 12:56:34,788 INFO L78 Accepts]: Start accepts. Automaton has 34012 states and 54194 transitions. Word has length 77 [2019-09-08 12:56:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:34,788 INFO L475 AbstractCegarLoop]: Abstraction has 34012 states and 54194 transitions. [2019-09-08 12:56:34,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:56:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 34012 states and 54194 transitions. [2019-09-08 12:56:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:56:34,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:34,789 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:34,789 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:34,790 INFO L82 PathProgramCache]: Analyzing trace with hash -579116247, now seen corresponding path program 1 times [2019-09-08 12:56:34,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:34,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:34,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:34,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:34,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:34,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:34,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:56:34,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:56:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:56:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:56:34,968 INFO L87 Difference]: Start difference. First operand 34012 states and 54194 transitions. Second operand 5 states. [2019-09-08 12:56:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:37,716 INFO L93 Difference]: Finished difference Result 109125 states and 174191 transitions. [2019-09-08 12:56:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:56:37,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 12:56:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:37,915 INFO L225 Difference]: With dead ends: 109125 [2019-09-08 12:56:37,915 INFO L226 Difference]: Without dead ends: 75208 [2019-09-08 12:56:37,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:56:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75208 states. [2019-09-08 12:56:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75208 to 46912. [2019-09-08 12:56:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46912 states. [2019-09-08 12:56:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46912 states to 46912 states and 74479 transitions. [2019-09-08 12:56:41,331 INFO L78 Accepts]: Start accepts. Automaton has 46912 states and 74479 transitions. Word has length 80 [2019-09-08 12:56:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:41,332 INFO L475 AbstractCegarLoop]: Abstraction has 46912 states and 74479 transitions. [2019-09-08 12:56:41,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:56:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 46912 states and 74479 transitions. [2019-09-08 12:56:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:56:41,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:41,333 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:41,333 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash -774643767, now seen corresponding path program 1 times [2019-09-08 12:56:41,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:41,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:41,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:41,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:41,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:56:41,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:56:41,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:56:41,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:56:41,444 INFO L87 Difference]: Start difference. First operand 46912 states and 74479 transitions. Second operand 5 states. [2019-09-08 12:56:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:45,525 INFO L93 Difference]: Finished difference Result 80811 states and 127572 transitions. [2019-09-08 12:56:45,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:56:45,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-08 12:56:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:45,662 INFO L225 Difference]: With dead ends: 80811 [2019-09-08 12:56:45,663 INFO L226 Difference]: Without dead ends: 80809 [2019-09-08 12:56:45,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:56:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80809 states. [2019-09-08 12:56:47,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80809 to 48000. [2019-09-08 12:56:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48000 states. [2019-09-08 12:56:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48000 states to 48000 states and 75558 transitions. [2019-09-08 12:56:48,042 INFO L78 Accepts]: Start accepts. Automaton has 48000 states and 75558 transitions. Word has length 81 [2019-09-08 12:56:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:48,043 INFO L475 AbstractCegarLoop]: Abstraction has 48000 states and 75558 transitions. [2019-09-08 12:56:48,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:56:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 48000 states and 75558 transitions. [2019-09-08 12:56:48,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:56:48,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:48,046 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:48,046 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:48,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1517678893, now seen corresponding path program 1 times [2019-09-08 12:56:48,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:48,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:48,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:48,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:48,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:56:48,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:48,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:56:48,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:56:48,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:56:48,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:48,132 INFO L87 Difference]: Start difference. First operand 48000 states and 75558 transitions. Second operand 3 states. [2019-09-08 12:56:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:51,309 INFO L93 Difference]: Finished difference Result 88600 states and 140064 transitions. [2019-09-08 12:56:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:56:51,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 12:56:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:51,488 INFO L225 Difference]: With dead ends: 88600 [2019-09-08 12:56:51,488 INFO L226 Difference]: Without dead ends: 83358 [2019-09-08 12:56:51,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83358 states. [2019-09-08 12:56:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83358 to 83281. [2019-09-08 12:56:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83281 states. [2019-09-08 12:56:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83281 states to 83281 states and 131340 transitions. [2019-09-08 12:56:56,411 INFO L78 Accepts]: Start accepts. Automaton has 83281 states and 131340 transitions. Word has length 105 [2019-09-08 12:56:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:56,412 INFO L475 AbstractCegarLoop]: Abstraction has 83281 states and 131340 transitions. [2019-09-08 12:56:56,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:56:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 83281 states and 131340 transitions. [2019-09-08 12:56:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:56:56,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:56,414 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:56,415 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:56,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash 451828384, now seen corresponding path program 1 times [2019-09-08 12:56:56,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:56,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:56,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:56,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:56,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:56:56,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:56,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:56:56,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:56:56,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:56:56,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:56:56,528 INFO L87 Difference]: Start difference. First operand 83281 states and 131340 transitions. Second operand 5 states. [2019-09-08 12:57:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:02,959 INFO L93 Difference]: Finished difference Result 146923 states and 232251 transitions. [2019-09-08 12:57:02,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:57:02,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-08 12:57:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:03,143 INFO L225 Difference]: With dead ends: 146923 [2019-09-08 12:57:03,143 INFO L226 Difference]: Without dead ends: 97867 [2019-09-08 12:57:03,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:57:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97867 states. [2019-09-08 12:57:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97867 to 97169. [2019-09-08 12:57:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97169 states. [2019-09-08 12:57:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97169 states to 97169 states and 153176 transitions. [2019-09-08 12:57:07,363 INFO L78 Accepts]: Start accepts. Automaton has 97169 states and 153176 transitions. Word has length 105 [2019-09-08 12:57:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:07,364 INFO L475 AbstractCegarLoop]: Abstraction has 97169 states and 153176 transitions. [2019-09-08 12:57:07,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:57:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 97169 states and 153176 transitions. [2019-09-08 12:57:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:57:07,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:07,368 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:07,368 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:07,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2140593730, now seen corresponding path program 1 times [2019-09-08 12:57:07,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:07,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:07,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:07,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:07,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:07,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:57:07,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 12:57:07,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:57:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:07,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:57:07,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:57:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 12:57:07,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:57:07,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 12:57:07,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:57:07,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:57:07,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:57:07,742 INFO L87 Difference]: Start difference. First operand 97169 states and 153176 transitions. Second operand 8 states. [2019-09-08 12:57:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:16,852 INFO L93 Difference]: Finished difference Result 164621 states and 260531 transitions. [2019-09-08 12:57:16,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:57:16,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-09-08 12:57:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:17,498 INFO L225 Difference]: With dead ends: 164621 [2019-09-08 12:57:17,498 INFO L226 Difference]: Without dead ends: 120369 [2019-09-08 12:57:17,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:57:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120369 states. [2019-09-08 12:57:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120369 to 112941. [2019-09-08 12:57:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112941 states. [2019-09-08 12:57:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112941 states to 112941 states and 178313 transitions. [2019-09-08 12:57:24,670 INFO L78 Accepts]: Start accepts. Automaton has 112941 states and 178313 transitions. Word has length 105 [2019-09-08 12:57:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:24,670 INFO L475 AbstractCegarLoop]: Abstraction has 112941 states and 178313 transitions. [2019-09-08 12:57:24,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:57:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 112941 states and 178313 transitions. [2019-09-08 12:57:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:57:24,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:24,677 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:24,678 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1443629572, now seen corresponding path program 1 times [2019-09-08 12:57:24,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:24,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:24,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:24,759 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:24,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:24,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:57:24,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:57:24,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:57:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:24,761 INFO L87 Difference]: Start difference. First operand 112941 states and 178313 transitions. Second operand 3 states. [2019-09-08 12:57:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:36,565 INFO L93 Difference]: Finished difference Result 331806 states and 523348 transitions. [2019-09-08 12:57:36,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:57:36,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 12:57:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:36,957 INFO L225 Difference]: With dead ends: 331806 [2019-09-08 12:57:36,957 INFO L226 Difference]: Without dead ends: 218960 [2019-09-08 12:57:37,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218960 states. [2019-09-08 12:57:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218960 to 218958. [2019-09-08 12:57:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218958 states. [2019-09-08 12:57:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218958 states to 218958 states and 343006 transitions. [2019-09-08 12:57:52,234 INFO L78 Accepts]: Start accepts. Automaton has 218958 states and 343006 transitions. Word has length 106 [2019-09-08 12:57:52,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:52,235 INFO L475 AbstractCegarLoop]: Abstraction has 218958 states and 343006 transitions. [2019-09-08 12:57:52,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:57:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 218958 states and 343006 transitions. [2019-09-08 12:57:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:57:52,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:52,240 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:52,241 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash 74847844, now seen corresponding path program 1 times [2019-09-08 12:57:52,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:52,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:52,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:52,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:57:52,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:52,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:57:52,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:57:52,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:57:52,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:57:52,340 INFO L87 Difference]: Start difference. First operand 218958 states and 343006 transitions. Second operand 4 states. [2019-09-08 12:58:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:05,377 INFO L93 Difference]: Finished difference Result 312296 states and 491007 transitions. [2019-09-08 12:58:05,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:58:05,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-08 12:58:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:05,720 INFO L225 Difference]: With dead ends: 312296 [2019-09-08 12:58:05,721 INFO L226 Difference]: Without dead ends: 219612 [2019-09-08 12:58:05,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:58:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219612 states. [2019-09-08 12:58:14,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219612 to 155222. [2019-09-08 12:58:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155222 states. [2019-09-08 12:58:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155222 states to 155222 states and 241942 transitions. [2019-09-08 12:58:14,842 INFO L78 Accepts]: Start accepts. Automaton has 155222 states and 241942 transitions. Word has length 106 [2019-09-08 12:58:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:14,843 INFO L475 AbstractCegarLoop]: Abstraction has 155222 states and 241942 transitions. [2019-09-08 12:58:14,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:58:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 155222 states and 241942 transitions. [2019-09-08 12:58:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:58:14,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:14,847 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:14,848 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash 54840582, now seen corresponding path program 1 times [2019-09-08 12:58:14,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:14,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:14,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:14,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:14,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:14,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:14,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:14,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:14,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:14,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:14,920 INFO L87 Difference]: Start difference. First operand 155222 states and 241942 transitions. Second operand 3 states. [2019-09-08 12:58:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:33,968 INFO L93 Difference]: Finished difference Result 455770 states and 709510 transitions. [2019-09-08 12:58:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:33,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 12:58:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:34,542 INFO L225 Difference]: With dead ends: 455770 [2019-09-08 12:58:34,542 INFO L226 Difference]: Without dead ends: 300693 [2019-09-08 12:58:34,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300693 states. [2019-09-08 12:58:56,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300693 to 300691. [2019-09-08 12:58:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300691 states. [2019-09-08 12:58:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300691 states to 300691 states and 464767 transitions. [2019-09-08 12:58:57,507 INFO L78 Accepts]: Start accepts. Automaton has 300691 states and 464767 transitions. Word has length 106 [2019-09-08 12:58:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:57,507 INFO L475 AbstractCegarLoop]: Abstraction has 300691 states and 464767 transitions. [2019-09-08 12:58:57,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 300691 states and 464767 transitions. [2019-09-08 12:58:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:58:57,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:57,515 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:57,516 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1932488230, now seen corresponding path program 1 times [2019-09-08 12:58:57,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:57,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:57,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:57,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 12:58:57,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:57,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:57,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:57,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:57,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:57,587 INFO L87 Difference]: Start difference. First operand 300691 states and 464767 transitions. Second operand 3 states. [2019-09-08 12:59:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:25,009 INFO L93 Difference]: Finished difference Result 733557 states and 1138531 transitions. [2019-09-08 12:59:25,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:59:25,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 12:59:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:25,787 INFO L225 Difference]: With dead ends: 733557 [2019-09-08 12:59:25,788 INFO L226 Difference]: Without dead ends: 433145 [2019-09-08 12:59:26,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433145 states. [2019-09-08 12:59:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433145 to 419963. [2019-09-08 12:59:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419963 states. [2019-09-08 12:59:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419963 states to 419963 states and 645353 transitions. [2019-09-08 12:59:57,426 INFO L78 Accepts]: Start accepts. Automaton has 419963 states and 645353 transitions. Word has length 107 [2019-09-08 12:59:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:57,427 INFO L475 AbstractCegarLoop]: Abstraction has 419963 states and 645353 transitions. [2019-09-08 12:59:57,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 419963 states and 645353 transitions. [2019-09-08 12:59:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:59:57,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:57,432 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:57,432 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:57,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:57,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1829841130, now seen corresponding path program 1 times [2019-09-08 12:59:57,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:57,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:57,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:57,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:57,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:59:57,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:57,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:59:57,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:59:57,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:59:57,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:59:57,492 INFO L87 Difference]: Start difference. First operand 419963 states and 645353 transitions. Second operand 3 states. [2019-09-08 13:00:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:41,934 INFO L93 Difference]: Finished difference Result 1026877 states and 1584981 transitions. [2019-09-08 13:00:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:00:41,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 13:00:41,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:43,152 INFO L225 Difference]: With dead ends: 1026877 [2019-09-08 13:00:43,152 INFO L226 Difference]: Without dead ends: 607217 [2019-09-08 13:00:43,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:00:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607217 states. [2019-09-08 13:01:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607217 to 587935. [2019-09-08 13:01:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587935 states. [2019-09-08 13:01:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587935 states to 587935 states and 898061 transitions. [2019-09-08 13:01:30,501 INFO L78 Accepts]: Start accepts. Automaton has 587935 states and 898061 transitions. Word has length 107 [2019-09-08 13:01:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:30,501 INFO L475 AbstractCegarLoop]: Abstraction has 587935 states and 898061 transitions. [2019-09-08 13:01:30,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:01:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 587935 states and 898061 transitions. [2019-09-08 13:01:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 13:01:30,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:30,505 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:30,505 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:30,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:30,506 INFO L82 PathProgramCache]: Analyzing trace with hash 276965014, now seen corresponding path program 1 times [2019-09-08 13:01:30,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:30,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:30,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:30,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:30,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 13:01:30,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:30,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:01:30,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:01:30,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:01:30,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:01:30,575 INFO L87 Difference]: Start difference. First operand 587935 states and 898061 transitions. Second operand 3 states. [2019-09-08 13:02:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:42,216 INFO L93 Difference]: Finished difference Result 1364807 states and 2091535 transitions. [2019-09-08 13:02:42,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:02:42,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-09-08 13:02:42,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:44,104 INFO L225 Difference]: With dead ends: 1364807 [2019-09-08 13:02:44,104 INFO L226 Difference]: Without dead ends: 1016989 [2019-09-08 13:02:44,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:02:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016989 states. [2019-09-08 13:04:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016989 to 1015311. [2019-09-08 13:04:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015311 states. [2019-09-08 13:04:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015311 states to 1015311 states and 1552033 transitions. [2019-09-08 13:04:17,887 INFO L78 Accepts]: Start accepts. Automaton has 1015311 states and 1552033 transitions. Word has length 107 [2019-09-08 13:04:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:04:17,887 INFO L475 AbstractCegarLoop]: Abstraction has 1015311 states and 1552033 transitions. [2019-09-08 13:04:17,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:04:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1015311 states and 1552033 transitions. [2019-09-08 13:04:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 13:04:17,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:04:17,893 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:04:17,893 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:04:17,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:04:17,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1391381162, now seen corresponding path program 1 times [2019-09-08 13:04:17,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:04:17,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:04:17,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:17,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:04:17,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:04:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:04:18,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 13:04:18,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:04:18,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:04:18,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:04:18,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:04:18,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:04:18,068 INFO L87 Difference]: Start difference. First operand 1015311 states and 1552033 transitions. Second operand 4 states. [2019-09-08 13:06:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:06:38,309 INFO L93 Difference]: Finished difference Result 2625411 states and 4032566 transitions. [2019-09-08 13:06:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:06:38,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-08 13:06:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:06:42,942 INFO L225 Difference]: With dead ends: 2625411 [2019-09-08 13:06:42,942 INFO L226 Difference]: Without dead ends: 1823971 [2019-09-08 13:06:43,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:06:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823971 states.