java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:13:43,284 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:13:43,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:13:43,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:13:43,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:13:43,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:13:43,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:13:43,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:13:43,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:13:43,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:13:43,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:13:43,308 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:13:43,308 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:13:43,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:13:43,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:13:43,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:13:43,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:13:43,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:13:43,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:13:43,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:13:43,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:13:43,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:13:43,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:13:43,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:13:43,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:13:43,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:13:43,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:13:43,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:13:43,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:13:43,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:13:43,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:13:43,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:13:43,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:13:43,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:13:43,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:13:43,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:13:43,330 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:13:43,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:13:43,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:13:43,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:13:43,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:13:43,336 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 11:13:43,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:13:43,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:13:43,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:13:43,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:13:43,361 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:13:43,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:13:43,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:13:43,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:13:43,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:13:43,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:13:43,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:13:43,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:13:43,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:13:43,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:13:43,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:13:43,364 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:13:43,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:13:43,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:13:43,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:13:43,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:13:43,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:13:43,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:13:43,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:13:43,366 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:13:43,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:13:43,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:13:43,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:13:43,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:13:43,367 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:13:43,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:13:43,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:13:43,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:13:43,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:13:43,427 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:13:43,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 11:13:43,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99d50680/f2fb5260b65f43f6abcffdd80ba1bade/FLAG878f9c80b [2019-09-08 11:13:43,973 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:13:43,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 11:13:43,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99d50680/f2fb5260b65f43f6abcffdd80ba1bade/FLAG878f9c80b [2019-09-08 11:13:44,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b99d50680/f2fb5260b65f43f6abcffdd80ba1bade [2019-09-08 11:13:44,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:13:44,281 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:13:44,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:13:44,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:13:44,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:13:44,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:13:44" (1/1) ... [2019-09-08 11:13:44,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@767ffd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:44, skipping insertion in model container [2019-09-08 11:13:44,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:13:44" (1/1) ... [2019-09-08 11:13:44,299 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:13:44,361 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:13:44,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:13:44,849 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:13:44,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:13:45,023 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:13:45,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45 WrapperNode [2019-09-08 11:13:45,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:13:45,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:13:45,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:13:45,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:13:45,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45" (1/1) ... [2019-09-08 11:13:45,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45" (1/1) ... [2019-09-08 11:13:45,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45" (1/1) ... [2019-09-08 11:13:45,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45" (1/1) ... [2019-09-08 11:13:45,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45" (1/1) ... [2019-09-08 11:13:45,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45" (1/1) ... [2019-09-08 11:13:45,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45" (1/1) ... [2019-09-08 11:13:45,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:13:45,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:13:45,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:13:45,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:13:45,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45" (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 11:13:45,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:13:45,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:13:45,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:13:45,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:13:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:13:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:13:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:13:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:13:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:13:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:13:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:13:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:13:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:13:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:13:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:13:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:13:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:13:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:13:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:13:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:13:46,392 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:13:46,392 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:13:46,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:13:46 BoogieIcfgContainer [2019-09-08 11:13:46,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:13:46,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:13:46,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:13:46,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:13:46,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:13:44" (1/3) ... [2019-09-08 11:13:46,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e43126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:13:46, skipping insertion in model container [2019-09-08 11:13:46,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:13:45" (2/3) ... [2019-09-08 11:13:46,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e43126 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:13:46, skipping insertion in model container [2019-09-08 11:13:46,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:13:46" (3/3) ... [2019-09-08 11:13:46,408 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-08 11:13:46,420 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:13:46,449 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:13:46,468 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:13:46,516 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:13:46,516 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:13:46,517 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:13:46,517 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:13:46,517 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:13:46,518 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:13:46,518 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:13:46,518 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:13:46,518 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:13:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2019-09-08 11:13:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:13:46,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:46,562 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, 1, 1, 1, 1] [2019-09-08 11:13:46,565 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:46,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:46,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1388414232, now seen corresponding path program 1 times [2019-09-08 11:13:46,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:46,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:46,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:46,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:46,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:47,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:13:47,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:47,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:13:47,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:13:47,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:13:47,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:13:47,130 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 3 states. [2019-09-08 11:13:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:47,292 INFO L93 Difference]: Finished difference Result 444 states and 727 transitions. [2019-09-08 11:13:47,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:13:47,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-08 11:13:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:47,316 INFO L225 Difference]: With dead ends: 444 [2019-09-08 11:13:47,317 INFO L226 Difference]: Without dead ends: 333 [2019-09-08 11:13:47,324 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 11:13:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-09-08 11:13:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2019-09-08 11:13:47,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-09-08 11:13:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 493 transitions. [2019-09-08 11:13:47,403 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 493 transitions. Word has length 85 [2019-09-08 11:13:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:47,404 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 493 transitions. [2019-09-08 11:13:47,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:13:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 493 transitions. [2019-09-08 11:13:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:13:47,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:47,409 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, 1, 1, 1, 1, 1] [2019-09-08 11:13:47,409 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:47,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash -368286742, now seen corresponding path program 1 times [2019-09-08 11:13:47,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:47,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:47,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:47,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:47,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:47,787 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 11:13:47,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:47,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:13:47,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:13:47,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:13:47,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:47,790 INFO L87 Difference]: Start difference. First operand 331 states and 493 transitions. Second operand 7 states. [2019-09-08 11:13:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:48,192 INFO L93 Difference]: Finished difference Result 1417 states and 2185 transitions. [2019-09-08 11:13:48,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:13:48,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-09-08 11:13:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:48,202 INFO L225 Difference]: With dead ends: 1417 [2019-09-08 11:13:48,202 INFO L226 Difference]: Without dead ends: 1171 [2019-09-08 11:13:48,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-09-08 11:13:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1163. [2019-09-08 11:13:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-09-08 11:13:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1786 transitions. [2019-09-08 11:13:48,302 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1786 transitions. Word has length 86 [2019-09-08 11:13:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:48,302 INFO L475 AbstractCegarLoop]: Abstraction has 1163 states and 1786 transitions. [2019-09-08 11:13:48,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:13:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1786 transitions. [2019-09-08 11:13:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:13:48,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:48,309 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, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:48,310 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash -414926669, now seen corresponding path program 1 times [2019-09-08 11:13:48,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:48,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:48,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:48,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:48,464 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 11:13:48,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:48,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:48,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:48,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:48,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:48,468 INFO L87 Difference]: Start difference. First operand 1163 states and 1786 transitions. Second operand 5 states. [2019-09-08 11:13:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:48,941 INFO L93 Difference]: Finished difference Result 3010 states and 4682 transitions. [2019-09-08 11:13:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:48,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:13:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:48,953 INFO L225 Difference]: With dead ends: 3010 [2019-09-08 11:13:48,954 INFO L226 Difference]: Without dead ends: 1963 [2019-09-08 11:13:48,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2019-09-08 11:13:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1961. [2019-09-08 11:13:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1961 states. [2019-09-08 11:13:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 3028 transitions. [2019-09-08 11:13:49,068 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 3028 transitions. Word has length 87 [2019-09-08 11:13:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:49,069 INFO L475 AbstractCegarLoop]: Abstraction has 1961 states and 3028 transitions. [2019-09-08 11:13:49,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 3028 transitions. [2019-09-08 11:13:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:13:49,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:49,073 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, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:49,073 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash 412481220, now seen corresponding path program 1 times [2019-09-08 11:13:49,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:49,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:49,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:49,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:49,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:49,168 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 11:13:49,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:49,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:49,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:49,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:49,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:49,170 INFO L87 Difference]: Start difference. First operand 1961 states and 3028 transitions. Second operand 5 states. [2019-09-08 11:13:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:49,711 INFO L93 Difference]: Finished difference Result 5354 states and 8355 transitions. [2019-09-08 11:13:49,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:49,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:13:49,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:49,735 INFO L225 Difference]: With dead ends: 5354 [2019-09-08 11:13:49,736 INFO L226 Difference]: Without dead ends: 3543 [2019-09-08 11:13:49,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2019-09-08 11:13:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3541. [2019-09-08 11:13:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3541 states. [2019-09-08 11:13:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 5493 transitions. [2019-09-08 11:13:49,951 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 5493 transitions. Word has length 87 [2019-09-08 11:13:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:49,952 INFO L475 AbstractCegarLoop]: Abstraction has 3541 states and 5493 transitions. [2019-09-08 11:13:49,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5493 transitions. [2019-09-08 11:13:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:13:49,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:49,956 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, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:49,957 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:49,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:49,957 INFO L82 PathProgramCache]: Analyzing trace with hash 549004962, now seen corresponding path program 1 times [2019-09-08 11:13:49,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:49,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:49,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:50,070 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 11:13:50,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:50,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:50,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:50,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:50,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:50,072 INFO L87 Difference]: Start difference. First operand 3541 states and 5493 transitions. Second operand 5 states. [2019-09-08 11:13:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:50,824 INFO L93 Difference]: Finished difference Result 10212 states and 15918 transitions. [2019-09-08 11:13:50,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:50,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:13:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:50,870 INFO L225 Difference]: With dead ends: 10212 [2019-09-08 11:13:50,870 INFO L226 Difference]: Without dead ends: 6757 [2019-09-08 11:13:50,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6757 states. [2019-09-08 11:13:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6757 to 6755. [2019-09-08 11:13:51,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6755 states. [2019-09-08 11:13:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6755 states to 6755 states and 10471 transitions. [2019-09-08 11:13:51,472 INFO L78 Accepts]: Start accepts. Automaton has 6755 states and 10471 transitions. Word has length 87 [2019-09-08 11:13:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:51,475 INFO L475 AbstractCegarLoop]: Abstraction has 6755 states and 10471 transitions. [2019-09-08 11:13:51,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6755 states and 10471 transitions. [2019-09-08 11:13:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:13:51,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:51,480 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:51,480 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1246527343, now seen corresponding path program 1 times [2019-09-08 11:13:51,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:51,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:51,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:51,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:51,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:51,659 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 11:13:51,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:51,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:13:51,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:13:51,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:13:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:13:51,661 INFO L87 Difference]: Start difference. First operand 6755 states and 10471 transitions. Second operand 6 states. [2019-09-08 11:13:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:52,986 INFO L93 Difference]: Finished difference Result 25923 states and 40254 transitions. [2019-09-08 11:13:52,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:52,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-09-08 11:13:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:53,062 INFO L225 Difference]: With dead ends: 25923 [2019-09-08 11:13:53,062 INFO L226 Difference]: Without dead ends: 19231 [2019-09-08 11:13:53,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:13:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19231 states. [2019-09-08 11:13:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19231 to 19227. [2019-09-08 11:13:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19227 states. [2019-09-08 11:13:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19227 states to 19227 states and 29724 transitions. [2019-09-08 11:13:54,131 INFO L78 Accepts]: Start accepts. Automaton has 19227 states and 29724 transitions. Word has length 87 [2019-09-08 11:13:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:54,132 INFO L475 AbstractCegarLoop]: Abstraction has 19227 states and 29724 transitions. [2019-09-08 11:13:54,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:13:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 19227 states and 29724 transitions. [2019-09-08 11:13:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:13:54,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:54,138 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, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:54,139 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:54,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1749809536, now seen corresponding path program 1 times [2019-09-08 11:13:54,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:54,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:54,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:54,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:54,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:54,217 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 11:13:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:54,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:54,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:54,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:54,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:54,219 INFO L87 Difference]: Start difference. First operand 19227 states and 29724 transitions. Second operand 5 states. [2019-09-08 11:13:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:56,105 INFO L93 Difference]: Finished difference Result 54119 states and 83754 transitions. [2019-09-08 11:13:56,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:13:56,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-08 11:13:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:56,199 INFO L225 Difference]: With dead ends: 54119 [2019-09-08 11:13:56,199 INFO L226 Difference]: Without dead ends: 34939 [2019-09-08 11:13:56,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:13:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34939 states. [2019-09-08 11:13:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34939 to 34937. [2019-09-08 11:13:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34937 states. [2019-09-08 11:13:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34937 states to 34937 states and 53646 transitions. [2019-09-08 11:13:57,859 INFO L78 Accepts]: Start accepts. Automaton has 34937 states and 53646 transitions. Word has length 87 [2019-09-08 11:13:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:13:57,859 INFO L475 AbstractCegarLoop]: Abstraction has 34937 states and 53646 transitions. [2019-09-08 11:13:57,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:13:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 34937 states and 53646 transitions. [2019-09-08 11:13:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 11:13:57,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:13:57,869 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:13:57,870 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:13:57,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:13:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1607364171, now seen corresponding path program 1 times [2019-09-08 11:13:57,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:13:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:13:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:57,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:13:57,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:13:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:13:57,973 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 11:13:57,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:13:57,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:13:57,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:13:57,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:13:57,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:13:57,975 INFO L87 Difference]: Start difference. First operand 34937 states and 53646 transitions. Second operand 5 states. [2019-09-08 11:14:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:01,238 INFO L93 Difference]: Finished difference Result 65491 states and 100119 transitions. [2019-09-08 11:14:01,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:14:01,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-08 11:14:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:01,411 INFO L225 Difference]: With dead ends: 65491 [2019-09-08 11:14:01,411 INFO L226 Difference]: Without dead ends: 65489 [2019-09-08 11:14:01,437 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 11:14:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65489 states. [2019-09-08 11:14:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65489 to 35369. [2019-09-08 11:14:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35369 states. [2019-09-08 11:14:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35369 states to 35369 states and 54078 transitions. [2019-09-08 11:14:03,522 INFO L78 Accepts]: Start accepts. Automaton has 35369 states and 54078 transitions. Word has length 88 [2019-09-08 11:14:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:03,522 INFO L475 AbstractCegarLoop]: Abstraction has 35369 states and 54078 transitions. [2019-09-08 11:14:03,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:14:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35369 states and 54078 transitions. [2019-09-08 11:14:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:14:03,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:03,534 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:03,534 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:03,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:03,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1987865476, now seen corresponding path program 1 times [2019-09-08 11:14:03,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:03,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:03,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:03,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:03,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:03,818 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 11:14:03,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:03,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:14:03,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:14:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:14:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:14:03,820 INFO L87 Difference]: Start difference. First operand 35369 states and 54078 transitions. Second operand 10 states. [2019-09-08 11:14:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:11,441 INFO L93 Difference]: Finished difference Result 120568 states and 182119 transitions. [2019-09-08 11:14:11,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:14:11,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-09-08 11:14:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:11,631 INFO L225 Difference]: With dead ends: 120568 [2019-09-08 11:14:11,631 INFO L226 Difference]: Without dead ends: 107942 [2019-09-08 11:14:11,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2019-09-08 11:14:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107942 states. [2019-09-08 11:14:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107942 to 35956. [2019-09-08 11:14:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35956 states. [2019-09-08 11:14:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35956 states to 35956 states and 54943 transitions. [2019-09-08 11:14:14,304 INFO L78 Accepts]: Start accepts. Automaton has 35956 states and 54943 transitions. Word has length 89 [2019-09-08 11:14:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:14,305 INFO L475 AbstractCegarLoop]: Abstraction has 35956 states and 54943 transitions. [2019-09-08 11:14:14,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:14:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 35956 states and 54943 transitions. [2019-09-08 11:14:14,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 11:14:14,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:14,317 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:14,318 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash 812355556, now seen corresponding path program 1 times [2019-09-08 11:14:14,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:14,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:14,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:14,405 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 11:14:14,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:14,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:14:14,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:14:14,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:14:14,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:14:14,407 INFO L87 Difference]: Start difference. First operand 35956 states and 54943 transitions. Second operand 4 states. [2019-09-08 11:14:18,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:18,255 INFO L93 Difference]: Finished difference Result 100728 states and 153441 transitions. [2019-09-08 11:14:18,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:14:18,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 11:14:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:18,388 INFO L225 Difference]: With dead ends: 100728 [2019-09-08 11:14:18,389 INFO L226 Difference]: Without dead ends: 66406 [2019-09-08 11:14:18,468 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 11:14:18,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66406 states. [2019-09-08 11:14:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66406 to 66404. [2019-09-08 11:14:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66404 states. [2019-09-08 11:14:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66404 states to 66404 states and 100687 transitions. [2019-09-08 11:14:22,229 INFO L78 Accepts]: Start accepts. Automaton has 66404 states and 100687 transitions. Word has length 89 [2019-09-08 11:14:22,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:22,230 INFO L475 AbstractCegarLoop]: Abstraction has 66404 states and 100687 transitions. [2019-09-08 11:14:22,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:14:22,230 INFO L276 IsEmpty]: Start isEmpty. Operand 66404 states and 100687 transitions. [2019-09-08 11:14:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:14:22,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:22,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:22,241 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash 63635533, now seen corresponding path program 1 times [2019-09-08 11:14:22,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:22,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:22,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:22,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:22,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:22,299 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 11:14:22,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:22,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:14:22,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:14:22,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:14:22,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:22,300 INFO L87 Difference]: Start difference. First operand 66404 states and 100687 transitions. Second operand 3 states. [2019-09-08 11:14:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:26,983 INFO L93 Difference]: Finished difference Result 90050 states and 136281 transitions. [2019-09-08 11:14:26,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:14:26,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:14:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:27,084 INFO L225 Difference]: With dead ends: 90050 [2019-09-08 11:14:27,085 INFO L226 Difference]: Without dead ends: 72984 [2019-09-08 11:14:27,117 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 11:14:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72984 states. [2019-09-08 11:14:30,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72984 to 65222. [2019-09-08 11:14:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65222 states. [2019-09-08 11:14:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65222 states to 65222 states and 97595 transitions. [2019-09-08 11:14:30,687 INFO L78 Accepts]: Start accepts. Automaton has 65222 states and 97595 transitions. Word has length 90 [2019-09-08 11:14:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:30,687 INFO L475 AbstractCegarLoop]: Abstraction has 65222 states and 97595 transitions. [2019-09-08 11:14:30,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:14:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 65222 states and 97595 transitions. [2019-09-08 11:14:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:14:30,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:30,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:30,700 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:30,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1632884758, now seen corresponding path program 1 times [2019-09-08 11:14:30,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:30,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:30,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:30,768 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 11:14:30,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:30,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:14:30,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:14:30,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:14:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:14:30,770 INFO L87 Difference]: Start difference. First operand 65222 states and 97595 transitions. Second operand 3 states. [2019-09-08 11:14:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:14:37,049 INFO L93 Difference]: Finished difference Result 129706 states and 194075 transitions. [2019-09-08 11:14:37,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:14:37,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:14:37,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:14:37,171 INFO L225 Difference]: With dead ends: 129706 [2019-09-08 11:14:37,171 INFO L226 Difference]: Without dead ends: 83868 [2019-09-08 11:14:37,231 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 11:14:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83868 states. [2019-09-08 11:14:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83868 to 83154. [2019-09-08 11:14:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83154 states. [2019-09-08 11:14:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83154 states to 83154 states and 122785 transitions. [2019-09-08 11:14:42,122 INFO L78 Accepts]: Start accepts. Automaton has 83154 states and 122785 transitions. Word has length 90 [2019-09-08 11:14:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:42,122 INFO L475 AbstractCegarLoop]: Abstraction has 83154 states and 122785 transitions. [2019-09-08 11:14:42,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:14:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 83154 states and 122785 transitions. [2019-09-08 11:14:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:14:42,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:42,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:42,132 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2017433619, now seen corresponding path program 1 times [2019-09-08 11:14:42,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:42,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:42,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:42,241 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 11:14:42,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:42,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:14:42,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:14:42,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:14:42,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:14:42,242 INFO L87 Difference]: Start difference. First operand 83154 states and 122785 transitions. Second operand 7 states. [2019-09-08 11:15:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:00,100 INFO L93 Difference]: Finished difference Result 280914 states and 409141 transitions. [2019-09-08 11:15:00,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:15:00,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:15:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:00,521 INFO L225 Difference]: With dead ends: 280914 [2019-09-08 11:15:00,521 INFO L226 Difference]: Without dead ends: 269332 [2019-09-08 11:15:00,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:15:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269332 states. [2019-09-08 11:15:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269332 to 97328. [2019-09-08 11:15:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97328 states. [2019-09-08 11:15:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97328 states to 97328 states and 143328 transitions. [2019-09-08 11:15:11,788 INFO L78 Accepts]: Start accepts. Automaton has 97328 states and 143328 transitions. Word has length 90 [2019-09-08 11:15:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:11,789 INFO L475 AbstractCegarLoop]: Abstraction has 97328 states and 143328 transitions. [2019-09-08 11:15:11,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:15:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 97328 states and 143328 transitions. [2019-09-08 11:15:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:15:11,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:11,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:11,800 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:11,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:11,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1079490452, now seen corresponding path program 1 times [2019-09-08 11:15:11,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:11,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:11,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:11,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:11,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:11,854 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 11:15:11,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:11,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:11,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:11,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:11,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:11,855 INFO L87 Difference]: Start difference. First operand 97328 states and 143328 transitions. Second operand 3 states. [2019-09-08 11:15:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:19,531 INFO L93 Difference]: Finished difference Result 165682 states and 243308 transitions. [2019-09-08 11:15:19,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:19,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:15:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:19,682 INFO L225 Difference]: With dead ends: 165682 [2019-09-08 11:15:19,682 INFO L226 Difference]: Without dead ends: 108488 [2019-09-08 11:15:19,743 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 11:15:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108488 states. [2019-09-08 11:15:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108488 to 107606. [2019-09-08 11:15:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107606 states. [2019-09-08 11:15:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107606 states to 107606 states and 155671 transitions. [2019-09-08 11:15:29,643 INFO L78 Accepts]: Start accepts. Automaton has 107606 states and 155671 transitions. Word has length 90 [2019-09-08 11:15:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:29,643 INFO L475 AbstractCegarLoop]: Abstraction has 107606 states and 155671 transitions. [2019-09-08 11:15:29,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 107606 states and 155671 transitions. [2019-09-08 11:15:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:15:29,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:29,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:29,655 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:29,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:29,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1593295700, now seen corresponding path program 1 times [2019-09-08 11:15:29,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:29,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:29,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:29,719 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 11:15:29,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:29,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:29,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:29,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:29,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:29,721 INFO L87 Difference]: Start difference. First operand 107606 states and 155671 transitions. Second operand 3 states. [2019-09-08 11:15:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:42,552 INFO L93 Difference]: Finished difference Result 256610 states and 370656 transitions. [2019-09-08 11:15:42,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:42,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:15:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:42,780 INFO L225 Difference]: With dead ends: 256610 [2019-09-08 11:15:42,780 INFO L226 Difference]: Without dead ends: 155996 [2019-09-08 11:15:42,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155996 states. [2019-09-08 11:15:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155996 to 154826. [2019-09-08 11:15:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154826 states. [2019-09-08 11:15:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154826 states to 154826 states and 220732 transitions. [2019-09-08 11:15:57,589 INFO L78 Accepts]: Start accepts. Automaton has 154826 states and 220732 transitions. Word has length 90 [2019-09-08 11:15:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:57,589 INFO L475 AbstractCegarLoop]: Abstraction has 154826 states and 220732 transitions. [2019-09-08 11:15:57,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 154826 states and 220732 transitions. [2019-09-08 11:15:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:15:57,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:57,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:15:57,601 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:57,602 INFO L82 PathProgramCache]: Analyzing trace with hash 327308374, now seen corresponding path program 1 times [2019-09-08 11:15:57,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:57,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:57,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:57,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:57,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:57,660 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 11:15:57,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:57,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:57,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:57,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:57,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:57,663 INFO L87 Difference]: Start difference. First operand 154826 states and 220732 transitions. Second operand 3 states. [2019-09-08 11:16:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:17,098 INFO L93 Difference]: Finished difference Result 355987 states and 506333 transitions. [2019-09-08 11:16:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:16:17,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-08 11:16:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:17,434 INFO L225 Difference]: With dead ends: 355987 [2019-09-08 11:16:17,434 INFO L226 Difference]: Without dead ends: 208671 [2019-09-08 11:16:17,554 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 11:16:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208671 states. [2019-09-08 11:16:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208671 to 208121. [2019-09-08 11:16:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208121 states. [2019-09-08 11:16:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208121 states to 208121 states and 292114 transitions. [2019-09-08 11:16:33,931 INFO L78 Accepts]: Start accepts. Automaton has 208121 states and 292114 transitions. Word has length 90 [2019-09-08 11:16:33,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:33,932 INFO L475 AbstractCegarLoop]: Abstraction has 208121 states and 292114 transitions. [2019-09-08 11:16:33,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:16:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 208121 states and 292114 transitions. [2019-09-08 11:16:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:16:33,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:33,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:16:33,949 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:33,949 INFO L82 PathProgramCache]: Analyzing trace with hash 810633430, now seen corresponding path program 1 times [2019-09-08 11:16:33,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:33,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:33,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:33,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:33,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:34,044 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 11:16:34,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:34,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:16:34,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:16:34,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:16:34,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:16:34,046 INFO L87 Difference]: Start difference. First operand 208121 states and 292114 transitions. Second operand 7 states. [2019-09-08 11:18:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:17,500 INFO L93 Difference]: Finished difference Result 1196703 states and 1665434 transitions. [2019-09-08 11:18:17,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:18:17,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:18:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:19,544 INFO L225 Difference]: With dead ends: 1196703 [2019-09-08 11:18:19,544 INFO L226 Difference]: Without dead ends: 1100995 [2019-09-08 11:18:19,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:18:21,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100995 states. [2019-09-08 11:18:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100995 to 208615. [2019-09-08 11:18:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208615 states. [2019-09-08 11:18:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208615 states to 208615 states and 292749 transitions. [2019-09-08 11:18:55,177 INFO L78 Accepts]: Start accepts. Automaton has 208615 states and 292749 transitions. Word has length 90 [2019-09-08 11:18:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:55,178 INFO L475 AbstractCegarLoop]: Abstraction has 208615 states and 292749 transitions. [2019-09-08 11:18:55,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:18:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 208615 states and 292749 transitions. [2019-09-08 11:18:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:18:55,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:55,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:18:55,191 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash 108547188, now seen corresponding path program 1 times [2019-09-08 11:18:55,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:55,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:55,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:55,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:55,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:55,289 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 11:18:55,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:55,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:18:55,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:18:55,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:18:55,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:18:55,291 INFO L87 Difference]: Start difference. First operand 208615 states and 292749 transitions. Second operand 7 states. [2019-09-08 11:21:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:06,910 INFO L93 Difference]: Finished difference Result 1291862 states and 1803107 transitions. [2019-09-08 11:21:06,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:21:06,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:21:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:08,919 INFO L225 Difference]: With dead ends: 1291862 [2019-09-08 11:21:08,919 INFO L226 Difference]: Without dead ends: 1165136 [2019-09-08 11:21:09,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:21:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165136 states. [2019-09-08 11:21:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165136 to 208903. [2019-09-08 11:21:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208903 states. [2019-09-08 11:21:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208903 states to 208903 states and 293104 transitions. [2019-09-08 11:21:58,857 INFO L78 Accepts]: Start accepts. Automaton has 208903 states and 293104 transitions. Word has length 90 [2019-09-08 11:21:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:58,857 INFO L475 AbstractCegarLoop]: Abstraction has 208903 states and 293104 transitions. [2019-09-08 11:21:58,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:21:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 208903 states and 293104 transitions. [2019-09-08 11:21:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 11:21:58,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:58,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:58,870 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:58,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:58,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1883359786, now seen corresponding path program 1 times [2019-09-08 11:21:58,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:58,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:58,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:58,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:58,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:58,968 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 11:21:58,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:58,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:21:58,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:21:58,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:21:58,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:21:58,970 INFO L87 Difference]: Start difference. First operand 208903 states and 293104 transitions. Second operand 7 states. [2019-09-08 11:23:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:42,879 INFO L93 Difference]: Finished difference Result 873363 states and 1217988 transitions. [2019-09-08 11:23:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:23:42,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2019-09-08 11:23:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:44,218 INFO L225 Difference]: With dead ends: 873363 [2019-09-08 11:23:44,218 INFO L226 Difference]: Without dead ends: 765061 [2019-09-08 11:23:44,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:23:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765061 states. [2019-09-08 11:24:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765061 to 209003. [2019-09-08 11:24:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209003 states. [2019-09-08 11:24:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209003 states to 209003 states and 293224 transitions. [2019-09-08 11:24:25,335 INFO L78 Accepts]: Start accepts. Automaton has 209003 states and 293224 transitions. Word has length 90 [2019-09-08 11:24:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:25,335 INFO L475 AbstractCegarLoop]: Abstraction has 209003 states and 293224 transitions. [2019-09-08 11:24:25,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:24:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 209003 states and 293224 transitions. [2019-09-08 11:24:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 11:24:25,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:25,349 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:25,350 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash 633216594, now seen corresponding path program 1 times [2019-09-08 11:24:25,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:25,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:25,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:25,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:25,470 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 11:24:25,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:24:25,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:24:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:24:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:24:25,472 INFO L87 Difference]: Start difference. First operand 209003 states and 293224 transitions. Second operand 7 states.