java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:54:04,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:54:04,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:54:04,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:54:04,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:54:04,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:54:04,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:54:04,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:54:04,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:54:04,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:54:04,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:54:04,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:54:04,431 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:54:04,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:54:04,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:54:04,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:54:04,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:54:04,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:54:04,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:54:04,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:54:04,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:54:04,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:54:04,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:54:04,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:54:04,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:54:04,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:54:04,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:54:04,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:54:04,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:54:04,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:54:04,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:54:04,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:54:04,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:54:04,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:54:04,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:54:04,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:54:04,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:54:04,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:54:04,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:54:04,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:54:04,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:54:04,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 09:54:04,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:54:04,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:54:04,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:54:04,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:54:04,474 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:54:04,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:54:04,475 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:54:04,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:54:04,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:54:04,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:54:04,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:54:04,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:54:04,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:54:04,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:54:04,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:54:04,476 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:54:04,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:54:04,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:54:04,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:54:04,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:54:04,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:54:04,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:54:04,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:54:04,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:54:04,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:54:04,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:54:04,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:54:04,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:54:04,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:54:04,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:54:04,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:54:04,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:54:04,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:54:04,552 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:54:04,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:54:04,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc124ce7/3d33887360204fa2a4d8d4fe47aef4f0/FLAG2e1c43071 [2019-09-08 09:54:05,160 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:54:05,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:54:05,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc124ce7/3d33887360204fa2a4d8d4fe47aef4f0/FLAG2e1c43071 [2019-09-08 09:54:05,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdc124ce7/3d33887360204fa2a4d8d4fe47aef4f0 [2019-09-08 09:54:05,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:54:05,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:54:05,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:54:05,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:54:05,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:54:05,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:54:05" (1/1) ... [2019-09-08 09:54:05,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c93ca5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:05, skipping insertion in model container [2019-09-08 09:54:05,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:54:05" (1/1) ... [2019-09-08 09:54:05,483 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:54:05,560 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:54:06,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:54:06,120 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:54:06,269 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:54:06,301 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:54:06,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06 WrapperNode [2019-09-08 09:54:06,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:54:06,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:54:06,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:54:06,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:54:06,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06" (1/1) ... [2019-09-08 09:54:06,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06" (1/1) ... [2019-09-08 09:54:06,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06" (1/1) ... [2019-09-08 09:54:06,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06" (1/1) ... [2019-09-08 09:54:06,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06" (1/1) ... [2019-09-08 09:54:06,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06" (1/1) ... [2019-09-08 09:54:06,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06" (1/1) ... [2019-09-08 09:54:06,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:54:06,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:54:06,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:54:06,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:54:06,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:54:06,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:54:06,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:54:06,480 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:54:06,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:54:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:54:06,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:54:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:54:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:54:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:54:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:54:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:54:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:54:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:54:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:54:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:54:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:54:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:54:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:54:06,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:54:07,974 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:54:07,975 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:54:07,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:54:07 BoogieIcfgContainer [2019-09-08 09:54:07,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:54:07,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:54:07,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:54:07,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:54:07,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:54:05" (1/3) ... [2019-09-08 09:54:07,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7643a76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:54:07, skipping insertion in model container [2019-09-08 09:54:07,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:54:06" (2/3) ... [2019-09-08 09:54:07,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7643a76b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:54:07, skipping insertion in model container [2019-09-08 09:54:07,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:54:07" (3/3) ... [2019-09-08 09:54:07,984 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:54:07,995 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:54:08,003 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:54:08,020 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:54:08,059 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:54:08,060 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:54:08,060 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:54:08,061 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:54:08,061 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:54:08,061 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:54:08,061 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:54:08,061 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:54:08,061 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:54:08,086 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-09-08 09:54:08,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 09:54:08,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:08,120 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:08,122 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:08,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2040025279, now seen corresponding path program 1 times [2019-09-08 09:54:08,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:08,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:08,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:08,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:08,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:08,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:08,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:08,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:08,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:08,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:08,764 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 3 states. [2019-09-08 09:54:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:08,926 INFO L93 Difference]: Finished difference Result 575 states and 998 transitions. [2019-09-08 09:54:08,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:08,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 09:54:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:08,947 INFO L225 Difference]: With dead ends: 575 [2019-09-08 09:54:08,948 INFO L226 Difference]: Without dead ends: 436 [2019-09-08 09:54:08,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-08 09:54:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-09-08 09:54:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-08 09:54:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 718 transitions. [2019-09-08 09:54:09,103 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 718 transitions. Word has length 115 [2019-09-08 09:54:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:09,104 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 718 transitions. [2019-09-08 09:54:09,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 718 transitions. [2019-09-08 09:54:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 09:54:09,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:09,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:09,108 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1630734110, now seen corresponding path program 1 times [2019-09-08 09:54:09,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:09,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:09,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:09,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:09,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:09,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:09,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:09,412 INFO L87 Difference]: Start difference. First operand 434 states and 718 transitions. Second operand 3 states. [2019-09-08 09:54:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:09,485 INFO L93 Difference]: Finished difference Result 664 states and 1109 transitions. [2019-09-08 09:54:09,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:09,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 09:54:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:09,494 INFO L225 Difference]: With dead ends: 664 [2019-09-08 09:54:09,494 INFO L226 Difference]: Without dead ends: 537 [2019-09-08 09:54:09,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-08 09:54:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-09-08 09:54:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-08 09:54:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 890 transitions. [2019-09-08 09:54:09,558 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 890 transitions. Word has length 118 [2019-09-08 09:54:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:09,561 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 890 transitions. [2019-09-08 09:54:09,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 890 transitions. [2019-09-08 09:54:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 09:54:09,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:09,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:09,566 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1903519920, now seen corresponding path program 1 times [2019-09-08 09:54:09,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:09,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:09,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:09,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:09,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:09,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:09,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:09,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:09,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:09,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:09,767 INFO L87 Difference]: Start difference. First operand 535 states and 890 transitions. Second operand 3 states. [2019-09-08 09:54:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:09,823 INFO L93 Difference]: Finished difference Result 1188 states and 1989 transitions. [2019-09-08 09:54:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:09,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 09:54:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:09,835 INFO L225 Difference]: With dead ends: 1188 [2019-09-08 09:54:09,835 INFO L226 Difference]: Without dead ends: 848 [2019-09-08 09:54:09,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-09-08 09:54:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2019-09-08 09:54:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-08 09:54:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1410 transitions. [2019-09-08 09:54:09,888 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1410 transitions. Word has length 118 [2019-09-08 09:54:09,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:09,889 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1410 transitions. [2019-09-08 09:54:09,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1410 transitions. [2019-09-08 09:54:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 09:54:09,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:09,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:09,892 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:09,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1633458995, now seen corresponding path program 1 times [2019-09-08 09:54:09,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:09,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:09,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:09,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:09,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:10,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:10,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:10,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:10,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:10,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:10,039 INFO L87 Difference]: Start difference. First operand 846 states and 1410 transitions. Second operand 3 states. [2019-09-08 09:54:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:10,104 INFO L93 Difference]: Finished difference Result 1466 states and 2456 transitions. [2019-09-08 09:54:10,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:10,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 09:54:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:10,113 INFO L225 Difference]: With dead ends: 1466 [2019-09-08 09:54:10,113 INFO L226 Difference]: Without dead ends: 1126 [2019-09-08 09:54:10,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:10,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-08 09:54:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124. [2019-09-08 09:54:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-09-08 09:54:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1876 transitions. [2019-09-08 09:54:10,171 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1876 transitions. Word has length 121 [2019-09-08 09:54:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:10,171 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1876 transitions. [2019-09-08 09:54:10,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1876 transitions. [2019-09-08 09:54:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 09:54:10,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:10,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:10,174 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:10,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1760173243, now seen corresponding path program 1 times [2019-09-08 09:54:10,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:10,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:10,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:10,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:10,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 09:54:10,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:10,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:10,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:10,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:10,292 INFO L87 Difference]: Start difference. First operand 1124 states and 1876 transitions. Second operand 3 states. [2019-09-08 09:54:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:10,393 INFO L93 Difference]: Finished difference Result 2865 states and 4791 transitions. [2019-09-08 09:54:10,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:10,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 09:54:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:10,408 INFO L225 Difference]: With dead ends: 2865 [2019-09-08 09:54:10,408 INFO L226 Difference]: Without dead ends: 1954 [2019-09-08 09:54:10,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-09-08 09:54:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2019-09-08 09:54:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-08 09:54:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3247 transitions. [2019-09-08 09:54:10,519 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3247 transitions. Word has length 121 [2019-09-08 09:54:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:10,519 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3247 transitions. [2019-09-08 09:54:10,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3247 transitions. [2019-09-08 09:54:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 09:54:10,521 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:10,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:10,522 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:10,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:10,576 INFO L82 PathProgramCache]: Analyzing trace with hash -499105252, now seen corresponding path program 1 times [2019-09-08 09:54:10,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:10,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:10,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:10,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:10,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:10,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:10,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:10,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:10,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:10,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:10,724 INFO L87 Difference]: Start difference. First operand 1952 states and 3247 transitions. Second operand 3 states. [2019-09-08 09:54:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:10,877 INFO L93 Difference]: Finished difference Result 3558 states and 5947 transitions. [2019-09-08 09:54:10,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:10,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 09:54:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:10,894 INFO L225 Difference]: With dead ends: 3558 [2019-09-08 09:54:10,894 INFO L226 Difference]: Without dead ends: 2647 [2019-09-08 09:54:10,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-09-08 09:54:11,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2645. [2019-09-08 09:54:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-09-08 09:54:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4402 transitions. [2019-09-08 09:54:11,051 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4402 transitions. Word has length 124 [2019-09-08 09:54:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:11,051 INFO L475 AbstractCegarLoop]: Abstraction has 2645 states and 4402 transitions. [2019-09-08 09:54:11,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4402 transitions. [2019-09-08 09:54:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 09:54:11,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:11,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:11,054 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:11,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1030513194, now seen corresponding path program 1 times [2019-09-08 09:54:11,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:11,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:11,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:11,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:11,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:11,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:11,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:11,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:11,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:11,201 INFO L87 Difference]: Start difference. First operand 2645 states and 4402 transitions. Second operand 3 states. [2019-09-08 09:54:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:11,464 INFO L93 Difference]: Finished difference Result 7230 states and 12009 transitions. [2019-09-08 09:54:11,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:11,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 09:54:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:11,491 INFO L225 Difference]: With dead ends: 7230 [2019-09-08 09:54:11,491 INFO L226 Difference]: Without dead ends: 4816 [2019-09-08 09:54:11,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-09-08 09:54:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4814. [2019-09-08 09:54:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-09-08 09:54:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 7948 transitions. [2019-09-08 09:54:11,731 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 7948 transitions. Word has length 124 [2019-09-08 09:54:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:11,731 INFO L475 AbstractCegarLoop]: Abstraction has 4814 states and 7948 transitions. [2019-09-08 09:54:11,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 7948 transitions. [2019-09-08 09:54:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 09:54:11,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:11,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:11,734 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:11,734 INFO L82 PathProgramCache]: Analyzing trace with hash -577751605, now seen corresponding path program 1 times [2019-09-08 09:54:11,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:11,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:11,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:11,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:11,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:11,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:54:11,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:54:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:54:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:54:11,989 INFO L87 Difference]: Start difference. First operand 4814 states and 7948 transitions. Second operand 6 states. [2019-09-08 09:54:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:13,990 INFO L93 Difference]: Finished difference Result 28885 states and 48038 transitions. [2019-09-08 09:54:13,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:54:13,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 09:54:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:14,138 INFO L225 Difference]: With dead ends: 28885 [2019-09-08 09:54:14,138 INFO L226 Difference]: Without dead ends: 24302 [2019-09-08 09:54:14,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:54:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24302 states. [2019-09-08 09:54:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24302 to 9308. [2019-09-08 09:54:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9308 states. [2019-09-08 09:54:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 15301 transitions. [2019-09-08 09:54:15,098 INFO L78 Accepts]: Start accepts. Automaton has 9308 states and 15301 transitions. Word has length 127 [2019-09-08 09:54:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:15,098 INFO L475 AbstractCegarLoop]: Abstraction has 9308 states and 15301 transitions. [2019-09-08 09:54:15,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:54:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 9308 states and 15301 transitions. [2019-09-08 09:54:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 09:54:15,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:15,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:15,101 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash -796598874, now seen corresponding path program 1 times [2019-09-08 09:54:15,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:15,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:15,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:15,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:15,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:15,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:15,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:15,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:15,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:15,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:15,265 INFO L87 Difference]: Start difference. First operand 9308 states and 15301 transitions. Second operand 4 states. [2019-09-08 09:54:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:16,757 INFO L93 Difference]: Finished difference Result 27309 states and 45168 transitions. [2019-09-08 09:54:16,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:16,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-08 09:54:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:16,807 INFO L225 Difference]: With dead ends: 27309 [2019-09-08 09:54:16,807 INFO L226 Difference]: Without dead ends: 18232 [2019-09-08 09:54:16,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18232 states. [2019-09-08 09:54:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18232 to 15163. [2019-09-08 09:54:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-08 09:54:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 24965 transitions. [2019-09-08 09:54:17,866 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 24965 transitions. Word has length 128 [2019-09-08 09:54:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:17,867 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 24965 transitions. [2019-09-08 09:54:17,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 24965 transitions. [2019-09-08 09:54:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 09:54:17,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:17,869 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:17,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash 584578538, now seen corresponding path program 1 times [2019-09-08 09:54:17,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:17,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:17,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:17,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:17,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:54:17,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:54:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:54:17,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:17,982 INFO L87 Difference]: Start difference. First operand 15163 states and 24965 transitions. Second operand 3 states. [2019-09-08 09:54:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:18,890 INFO L93 Difference]: Finished difference Result 28841 states and 47657 transitions. [2019-09-08 09:54:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:54:18,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 09:54:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:18,942 INFO L225 Difference]: With dead ends: 28841 [2019-09-08 09:54:18,942 INFO L226 Difference]: Without dead ends: 20841 [2019-09-08 09:54:18,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:54:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20841 states. [2019-09-08 09:54:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20841 to 20839. [2019-09-08 09:54:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20839 states. [2019-09-08 09:54:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20839 states to 20839 states and 34253 transitions. [2019-09-08 09:54:20,475 INFO L78 Accepts]: Start accepts. Automaton has 20839 states and 34253 transitions. Word has length 128 [2019-09-08 09:54:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:20,476 INFO L475 AbstractCegarLoop]: Abstraction has 20839 states and 34253 transitions. [2019-09-08 09:54:20,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:54:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 20839 states and 34253 transitions. [2019-09-08 09:54:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 09:54:20,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:20,479 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:20,480 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1013628402, now seen corresponding path program 1 times [2019-09-08 09:54:20,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:20,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:20,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:20,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:20,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:20,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:20,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:20,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:20,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:20,628 INFO L87 Difference]: Start difference. First operand 20839 states and 34253 transitions. Second operand 4 states. [2019-09-08 09:54:23,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:23,023 INFO L93 Difference]: Finished difference Result 60941 states and 100477 transitions. [2019-09-08 09:54:23,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:23,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-08 09:54:23,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:23,127 INFO L225 Difference]: With dead ends: 60941 [2019-09-08 09:54:23,127 INFO L226 Difference]: Without dead ends: 40351 [2019-09-08 09:54:23,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-08 09:54:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 33920. [2019-09-08 09:54:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33920 states. [2019-09-08 09:54:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33920 states to 33920 states and 55603 transitions. [2019-09-08 09:54:24,689 INFO L78 Accepts]: Start accepts. Automaton has 33920 states and 55603 transitions. Word has length 129 [2019-09-08 09:54:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:24,689 INFO L475 AbstractCegarLoop]: Abstraction has 33920 states and 55603 transitions. [2019-09-08 09:54:24,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 33920 states and 55603 transitions. [2019-09-08 09:54:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 09:54:24,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:24,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:24,692 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:24,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:24,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1300657133, now seen corresponding path program 1 times [2019-09-08 09:54:24,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:24,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:24,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:24,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:24,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:24,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:54:24,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:54:24,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:54:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:54:24,800 INFO L87 Difference]: Start difference. First operand 33920 states and 55603 transitions. Second operand 4 states. [2019-09-08 09:54:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:28,394 INFO L93 Difference]: Finished difference Result 98585 states and 162103 transitions. [2019-09-08 09:54:28,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:54:28,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-08 09:54:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:28,557 INFO L225 Difference]: With dead ends: 98585 [2019-09-08 09:54:28,557 INFO L226 Difference]: Without dead ends: 64914 [2019-09-08 09:54:28,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:54:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64914 states. [2019-09-08 09:54:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64914 to 54909. [2019-09-08 09:54:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54909 states. [2019-09-08 09:54:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54909 states to 54909 states and 89761 transitions. [2019-09-08 09:54:30,880 INFO L78 Accepts]: Start accepts. Automaton has 54909 states and 89761 transitions. Word has length 130 [2019-09-08 09:54:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:30,880 INFO L475 AbstractCegarLoop]: Abstraction has 54909 states and 89761 transitions. [2019-09-08 09:54:30,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:54:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 54909 states and 89761 transitions. [2019-09-08 09:54:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 09:54:30,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:30,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:30,883 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1613171225, now seen corresponding path program 1 times [2019-09-08 09:54:30,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:30,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:30,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:31,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:31,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 09:54:31,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 09:54:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 09:54:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:54:31,049 INFO L87 Difference]: Start difference. First operand 54909 states and 89761 transitions. Second operand 7 states. [2019-09-08 09:54:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:54:42,171 INFO L93 Difference]: Finished difference Result 266912 states and 437681 transitions. [2019-09-08 09:54:42,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 09:54:42,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-08 09:54:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:54:42,642 INFO L225 Difference]: With dead ends: 266912 [2019-09-08 09:54:42,646 INFO L226 Difference]: Without dead ends: 212252 [2019-09-08 09:54:42,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 09:54:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212252 states. [2019-09-08 09:54:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212252 to 148492. [2019-09-08 09:54:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-08 09:54:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 241054 transitions. [2019-09-08 09:54:53,138 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 241054 transitions. Word has length 131 [2019-09-08 09:54:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:54:53,138 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 241054 transitions. [2019-09-08 09:54:53,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 09:54:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 241054 transitions. [2019-09-08 09:54:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 09:54:53,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:54:53,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:54:53,140 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:54:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:54:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1715276375, now seen corresponding path program 1 times [2019-09-08 09:54:53,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:54:53,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:54:53,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:53,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:54:53,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:54:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:54:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:54:53,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:54:53,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:54:53,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:54:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:54:53,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:54:53,453 INFO L87 Difference]: Start difference. First operand 148492 states and 241054 transitions. Second operand 6 states. [2019-09-08 09:55:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:06,115 INFO L93 Difference]: Finished difference Result 353665 states and 575236 transitions. [2019-09-08 09:55:06,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:55:06,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-08 09:55:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:06,455 INFO L225 Difference]: With dead ends: 353665 [2019-09-08 09:55:06,455 INFO L226 Difference]: Without dead ends: 205422 [2019-09-08 09:55:06,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:55:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205422 states. [2019-09-08 09:55:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205422 to 148492. [2019-09-08 09:55:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-08 09:55:18,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 240429 transitions. [2019-09-08 09:55:18,075 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 240429 transitions. Word has length 133 [2019-09-08 09:55:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:55:18,076 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 240429 transitions. [2019-09-08 09:55:18,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:55:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 240429 transitions. [2019-09-08 09:55:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 09:55:18,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:55:18,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:55:18,078 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:55:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:55:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash -326924610, now seen corresponding path program 1 times [2019-09-08 09:55:18,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:55:18,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:55:18,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:18,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:55:18,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:55:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:55:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:55:18,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:55:18,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:55:18,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:55:18,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:55:18,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:55:18,338 INFO L87 Difference]: Start difference. First operand 148492 states and 240429 transitions. Second operand 6 states. [2019-09-08 09:55:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:55:37,176 INFO L93 Difference]: Finished difference Result 436044 states and 707875 transitions. [2019-09-08 09:55:37,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:55:37,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-08 09:55:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:55:37,676 INFO L225 Difference]: With dead ends: 436044 [2019-09-08 09:55:37,677 INFO L226 Difference]: Without dead ends: 287801 [2019-09-08 09:55:37,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:55:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287801 states. [2019-09-08 09:56:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287801 to 287797. [2019-09-08 09:56:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287797 states. [2019-09-08 09:56:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287797 states to 287797 states and 465955 transitions. [2019-09-08 09:56:00,744 INFO L78 Accepts]: Start accepts. Automaton has 287797 states and 465955 transitions. Word has length 136 [2019-09-08 09:56:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:56:00,744 INFO L475 AbstractCegarLoop]: Abstraction has 287797 states and 465955 transitions. [2019-09-08 09:56:00,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:56:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 287797 states and 465955 transitions. [2019-09-08 09:56:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 09:56:00,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:56:00,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:56:00,746 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:56:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:56:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1546637434, now seen corresponding path program 1 times [2019-09-08 09:56:00,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:56:00,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:56:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:00,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:56:00,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:56:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:56:00,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:56:00,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:56:00,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:56:00,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:56:00,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:56:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:56:00,904 INFO L87 Difference]: Start difference. First operand 287797 states and 465955 transitions. Second operand 5 states. [2019-09-08 09:56:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:56:32,081 INFO L93 Difference]: Finished difference Result 473705 states and 763150 transitions. [2019-09-08 09:56:32,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:56:32,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-08 09:56:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:56:32,911 INFO L225 Difference]: With dead ends: 473705 [2019-09-08 09:56:32,912 INFO L226 Difference]: Without dead ends: 473703 [2019-09-08 09:56:33,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:56:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473703 states. [2019-09-08 09:57:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473703 to 292397. [2019-09-08 09:57:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292397 states. [2019-09-08 09:57:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292397 states to 292397 states and 470510 transitions. [2019-09-08 09:57:07,670 INFO L78 Accepts]: Start accepts. Automaton has 292397 states and 470510 transitions. Word has length 137 [2019-09-08 09:57:07,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:57:07,671 INFO L475 AbstractCegarLoop]: Abstraction has 292397 states and 470510 transitions. [2019-09-08 09:57:07,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:57:07,671 INFO L276 IsEmpty]: Start isEmpty. Operand 292397 states and 470510 transitions. [2019-09-08 09:57:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:57:07,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:57:07,682 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:57:07,682 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:57:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:57:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2041446640, now seen corresponding path program 1 times [2019-09-08 09:57:07,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:57:07,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:57:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:07,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:57:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:57:07,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:57:07,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:57:07,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:57:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:57:08,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 09:57:08,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:57:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:57:08,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:57:08,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 09:57:08,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:57:08,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:57:08,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:57:08,376 INFO L87 Difference]: Start difference. First operand 292397 states and 470510 transitions. Second operand 9 states. [2019-09-08 09:58:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:58:19,053 INFO L93 Difference]: Finished difference Result 978988 states and 1593906 transitions. [2019-09-08 09:58:19,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 09:58:19,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 09:58:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:58:21,070 INFO L225 Difference]: With dead ends: 978988 [2019-09-08 09:58:21,070 INFO L226 Difference]: Without dead ends: 873902 [2019-09-08 09:58:21,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-09-08 09:58:22,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873902 states. [2019-09-08 09:59:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873902 to 510458. [2019-09-08 09:59:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510458 states. [2019-09-08 09:59:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510458 states to 510458 states and 824571 transitions. [2019-09-08 09:59:23,954 INFO L78 Accepts]: Start accepts. Automaton has 510458 states and 824571 transitions. Word has length 167 [2019-09-08 09:59:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:59:23,954 INFO L475 AbstractCegarLoop]: Abstraction has 510458 states and 824571 transitions. [2019-09-08 09:59:23,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:59:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 510458 states and 824571 transitions. [2019-09-08 09:59:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:59:23,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:59:23,972 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:59:23,972 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:59:23,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:59:23,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1226993252, now seen corresponding path program 1 times [2019-09-08 09:59:23,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:59:23,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:59:23,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:23,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:59:23,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:59:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:59:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 09:59:24,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:59:24,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:59:24,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:59:24,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:59:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:59:24,362 INFO L87 Difference]: Start difference. First operand 510458 states and 824571 transitions. Second operand 4 states. [2019-09-08 10:00:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:00:39,531 INFO L93 Difference]: Finished difference Result 1034137 states and 1678698 transitions. [2019-09-08 10:00:39,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:00:39,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-08 10:00:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:00:41,956 INFO L225 Difference]: With dead ends: 1034137 [2019-09-08 10:00:41,956 INFO L226 Difference]: Without dead ends: 814205 [2019-09-08 10:00:42,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:00:42,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814205 states. [2019-09-08 10:02:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814205 to 720736. [2019-09-08 10:02:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720736 states. [2019-09-08 10:02:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720736 states to 720736 states and 1167117 transitions. [2019-09-08 10:02:06,089 INFO L78 Accepts]: Start accepts. Automaton has 720736 states and 1167117 transitions. Word has length 167 [2019-09-08 10:02:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:06,090 INFO L475 AbstractCegarLoop]: Abstraction has 720736 states and 1167117 transitions. [2019-09-08 10:02:06,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:02:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 720736 states and 1167117 transitions. [2019-09-08 10:02:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 10:02:06,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:06,097 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:06,097 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:06,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash -452129158, now seen corresponding path program 1 times [2019-09-08 10:02:06,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:06,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:06,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 10:02:06,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:06,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:02:06,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:02:06,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:02:06,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:02:06,276 INFO L87 Difference]: Start difference. First operand 720736 states and 1167117 transitions. Second operand 6 states. [2019-09-08 10:03:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:53,358 INFO L93 Difference]: Finished difference Result 1507793 states and 2452860 transitions. [2019-09-08 10:03:53,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:03:53,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 10:03:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:55,449 INFO L225 Difference]: With dead ends: 1507793 [2019-09-08 10:03:55,450 INFO L226 Difference]: Without dead ends: 1036095 [2019-09-08 10:03:55,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:03:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036095 states.