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/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:13:07,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:13:07,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:13:07,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:13:07,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:13:07,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:13:07,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:13:07,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:13:07,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:13:07,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:13:07,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:13:07,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:13:07,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:13:07,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:13:07,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:13:07,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:13:07,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:13:07,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:13:07,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:13:07,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:13:07,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:13:07,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:13:07,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:13:07,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:13:07,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:13:07,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:13:07,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:13:07,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:13:07,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:13:07,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:13:07,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:13:07,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:13:07,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:13:07,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:13:07,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:13:07,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:13:07,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:13:07,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:13:07,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:13:07,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:13:07,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:13:07,481 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 08:13:07,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:13:07,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:13:07,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:13:07,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:13:07,511 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:13:07,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:13:07,511 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:13:07,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:13:07,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:13:07,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:13:07,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:13:07,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:13:07,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:13:07,514 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:13:07,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:13:07,514 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:13:07,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:13:07,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:13:07,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:13:07,515 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:13:07,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:13:07,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:13:07,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:13:07,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:13:07,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:13:07,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:13:07,517 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:13:07,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:13:07,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:13:07,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:13:07,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:13:07,597 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:13:07,599 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:13:07,600 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:13:07,601 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2019-09-08 08:13:07,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91006932d/f72b47de025e4ec2ae4c2236f01f3281/FLAGeac7cabb5 [2019-09-08 08:13:08,190 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:13:08,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2019-09-08 08:13:08,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91006932d/f72b47de025e4ec2ae4c2236f01f3281/FLAGeac7cabb5 [2019-09-08 08:13:08,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91006932d/f72b47de025e4ec2ae4c2236f01f3281 [2019-09-08 08:13:08,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:13:08,480 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:13:08,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:13:08,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:13:08,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:13:08,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:13:08" (1/1) ... [2019-09-08 08:13:08,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245df3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:08, skipping insertion in model container [2019-09-08 08:13:08,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:13:08" (1/1) ... [2019-09-08 08:13:08,496 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:13:08,549 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:13:08,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:13:08,877 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:13:09,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:13:09,049 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:13:09,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09 WrapperNode [2019-09-08 08:13:09,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:13:09,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:13:09,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:13:09,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:13:09,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09" (1/1) ... [2019-09-08 08:13:09,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09" (1/1) ... [2019-09-08 08:13:09,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09" (1/1) ... [2019-09-08 08:13:09,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09" (1/1) ... [2019-09-08 08:13:09,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09" (1/1) ... [2019-09-08 08:13:09,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09" (1/1) ... [2019-09-08 08:13:09,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09" (1/1) ... [2019-09-08 08:13:09,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:13:09,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:13:09,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:13:09,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:13:09,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09" (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 08:13:09,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:13:09,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:13:09,180 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:13:09,180 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:13:09,180 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:13:09,181 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:13:09,181 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:13:09,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:13:09,183 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:13:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:13:09,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:13:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:13:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:13:09,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:13:09,185 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:13:09,186 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:13:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:13:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:13:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:13:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:13:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:13:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:13:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:13:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:13:10,023 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:13:10,023 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:13:10,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:13:10 BoogieIcfgContainer [2019-09-08 08:13:10,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:13:10,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:13:10,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:13:10,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:13:10,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:13:08" (1/3) ... [2019-09-08 08:13:10,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f62fbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:13:10, skipping insertion in model container [2019-09-08 08:13:10,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:09" (2/3) ... [2019-09-08 08:13:10,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f62fbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:13:10, skipping insertion in model container [2019-09-08 08:13:10,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:13:10" (3/3) ... [2019-09-08 08:13:10,034 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2019-09-08 08:13:10,047 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:13:10,058 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:13:10,077 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:13:10,137 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:13:10,137 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:13:10,138 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:13:10,138 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:13:10,138 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:13:10,138 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:13:10,139 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:13:10,139 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:13:10,139 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:13:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-09-08 08:13:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 08:13:10,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:10,187 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] [2019-09-08 08:13:10,189 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:10,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1106693626, now seen corresponding path program 1 times [2019-09-08 08:13:10,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:10,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:10,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:10,609 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 08:13:10,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:10,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:10,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:10,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:10,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:10,638 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 5 states. [2019-09-08 08:13:10,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:10,790 INFO L93 Difference]: Finished difference Result 274 states and 435 transitions. [2019-09-08 08:13:10,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:13:10,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 08:13:10,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:10,808 INFO L225 Difference]: With dead ends: 274 [2019-09-08 08:13:10,809 INFO L226 Difference]: Without dead ends: 163 [2019-09-08 08:13:10,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:13:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-08 08:13:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-09-08 08:13:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-08 08:13:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. [2019-09-08 08:13:10,874 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 235 transitions. Word has length 59 [2019-09-08 08:13:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:10,875 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 235 transitions. [2019-09-08 08:13:10,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 235 transitions. [2019-09-08 08:13:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 08:13:10,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:10,880 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:10,881 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:10,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1798610632, now seen corresponding path program 1 times [2019-09-08 08:13:10,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:10,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:10,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:10,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:10,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:11,108 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 08:13:11,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:11,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:11,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:11,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:11,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:11,112 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand 5 states. [2019-09-08 08:13:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:11,738 INFO L93 Difference]: Finished difference Result 348 states and 522 transitions. [2019-09-08 08:13:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:13:11,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-08 08:13:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:11,752 INFO L225 Difference]: With dead ends: 348 [2019-09-08 08:13:11,752 INFO L226 Difference]: Without dead ends: 251 [2019-09-08 08:13:11,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:13:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-08 08:13:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 242. [2019-09-08 08:13:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-08 08:13:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 352 transitions. [2019-09-08 08:13:11,811 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 352 transitions. Word has length 88 [2019-09-08 08:13:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:11,812 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 352 transitions. [2019-09-08 08:13:11,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 352 transitions. [2019-09-08 08:13:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:13:11,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:11,826 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:13:11,826 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:11,828 INFO L82 PathProgramCache]: Analyzing trace with hash -704489299, now seen corresponding path program 1 times [2019-09-08 08:13:11,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:11,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:11,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:11,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:11,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:12,028 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 08:13:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:12,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:12,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:12,036 INFO L87 Difference]: Start difference. First operand 242 states and 352 transitions. Second operand 5 states. [2019-09-08 08:13:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:12,646 INFO L93 Difference]: Finished difference Result 588 states and 874 transitions. [2019-09-08 08:13:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:13:12,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-08 08:13:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:12,651 INFO L225 Difference]: With dead ends: 588 [2019-09-08 08:13:12,651 INFO L226 Difference]: Without dead ends: 412 [2019-09-08 08:13:12,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:13:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-08 08:13:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 404. [2019-09-08 08:13:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-09-08 08:13:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 595 transitions. [2019-09-08 08:13:12,716 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 595 transitions. Word has length 90 [2019-09-08 08:13:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:12,717 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 595 transitions. [2019-09-08 08:13:12,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 595 transitions. [2019-09-08 08:13:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 08:13:12,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:12,719 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] [2019-09-08 08:13:12,720 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:12,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash 812819256, now seen corresponding path program 1 times [2019-09-08 08:13:12,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:12,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:12,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:12,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:12,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:12,849 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 08:13:12,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:12,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:12,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:12,852 INFO L87 Difference]: Start difference. First operand 404 states and 595 transitions. Second operand 5 states. [2019-09-08 08:13:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:13,385 INFO L93 Difference]: Finished difference Result 1068 states and 1589 transitions. [2019-09-08 08:13:13,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:13:13,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 08:13:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:13,392 INFO L225 Difference]: With dead ends: 1068 [2019-09-08 08:13:13,392 INFO L226 Difference]: Without dead ends: 730 [2019-09-08 08:13:13,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:13:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-09-08 08:13:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 716. [2019-09-08 08:13:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-09-08 08:13:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1057 transitions. [2019-09-08 08:13:13,459 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1057 transitions. Word has length 92 [2019-09-08 08:13:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:13,461 INFO L475 AbstractCegarLoop]: Abstraction has 716 states and 1057 transitions. [2019-09-08 08:13:13,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1057 transitions. [2019-09-08 08:13:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 08:13:13,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:13,468 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] [2019-09-08 08:13:13,468 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash 735799213, now seen corresponding path program 1 times [2019-09-08 08:13:13,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:13,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:13,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:13,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:13,642 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 08:13:13,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:13,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:13:13,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:13:13,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:13:13,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:13:13,646 INFO L87 Difference]: Start difference. First operand 716 states and 1057 transitions. Second operand 9 states. [2019-09-08 08:13:16,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:16,706 INFO L93 Difference]: Finished difference Result 4929 states and 7498 transitions. [2019-09-08 08:13:16,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 08:13:16,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-08 08:13:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:16,736 INFO L225 Difference]: With dead ends: 4929 [2019-09-08 08:13:16,736 INFO L226 Difference]: Without dead ends: 4279 [2019-09-08 08:13:16,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 08:13:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2019-09-08 08:13:16,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4223. [2019-09-08 08:13:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4223 states. [2019-09-08 08:13:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4223 states to 4223 states and 6387 transitions. [2019-09-08 08:13:16,969 INFO L78 Accepts]: Start accepts. Automaton has 4223 states and 6387 transitions. Word has length 94 [2019-09-08 08:13:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:16,970 INFO L475 AbstractCegarLoop]: Abstraction has 4223 states and 6387 transitions. [2019-09-08 08:13:16,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:13:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 4223 states and 6387 transitions. [2019-09-08 08:13:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:13:16,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:16,974 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] [2019-09-08 08:13:16,975 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1111632109, now seen corresponding path program 1 times [2019-09-08 08:13:16,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:16,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:16,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:16,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:17,125 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 08:13:17,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:17,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:17,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:17,128 INFO L87 Difference]: Start difference. First operand 4223 states and 6387 transitions. Second operand 6 states. [2019-09-08 08:13:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:18,411 INFO L93 Difference]: Finished difference Result 12619 states and 19187 transitions. [2019-09-08 08:13:18,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:13:18,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 08:13:18,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:18,464 INFO L225 Difference]: With dead ends: 12619 [2019-09-08 08:13:18,465 INFO L226 Difference]: Without dead ends: 8462 [2019-09-08 08:13:18,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:13:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8462 states. [2019-09-08 08:13:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8462 to 6548. [2019-09-08 08:13:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2019-09-08 08:13:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 9917 transitions. [2019-09-08 08:13:18,820 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 9917 transitions. Word has length 95 [2019-09-08 08:13:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:18,821 INFO L475 AbstractCegarLoop]: Abstraction has 6548 states and 9917 transitions. [2019-09-08 08:13:18,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 9917 transitions. [2019-09-08 08:13:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:18,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:18,826 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] [2019-09-08 08:13:18,826 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:18,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:18,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1166847690, now seen corresponding path program 1 times [2019-09-08 08:13:18,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:18,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:18,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:19,005 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 08:13:19,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:19,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:13:19,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:13:19,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:13:19,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:13:19,008 INFO L87 Difference]: Start difference. First operand 6548 states and 9917 transitions. Second operand 9 states. [2019-09-08 08:13:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:22,399 INFO L93 Difference]: Finished difference Result 14183 states and 21554 transitions. [2019-09-08 08:13:22,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 08:13:22,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 08:13:22,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:22,483 INFO L225 Difference]: With dead ends: 14183 [2019-09-08 08:13:22,483 INFO L226 Difference]: Without dead ends: 11181 [2019-09-08 08:13:22,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 08:13:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11181 states. [2019-09-08 08:13:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11181 to 9573. [2019-09-08 08:13:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9573 states. [2019-09-08 08:13:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9573 states to 9573 states and 14543 transitions. [2019-09-08 08:13:22,935 INFO L78 Accepts]: Start accepts. Automaton has 9573 states and 14543 transitions. Word has length 96 [2019-09-08 08:13:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:22,935 INFO L475 AbstractCegarLoop]: Abstraction has 9573 states and 14543 transitions. [2019-09-08 08:13:22,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:13:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9573 states and 14543 transitions. [2019-09-08 08:13:22,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:22,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:22,940 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] [2019-09-08 08:13:22,941 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:22,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash -434937692, now seen corresponding path program 1 times [2019-09-08 08:13:22,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:22,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:22,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:23,097 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 08:13:23,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:23,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:13:23,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:13:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:13:23,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:13:23,100 INFO L87 Difference]: Start difference. First operand 9573 states and 14543 transitions. Second operand 9 states. [2019-09-08 08:13:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:26,310 INFO L93 Difference]: Finished difference Result 20192 states and 30766 transitions. [2019-09-08 08:13:26,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 08:13:26,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 08:13:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:26,399 INFO L225 Difference]: With dead ends: 20192 [2019-09-08 08:13:26,399 INFO L226 Difference]: Without dead ends: 15422 [2019-09-08 08:13:26,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 08:13:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15422 states. [2019-09-08 08:13:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15422 to 13800. [2019-09-08 08:13:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13800 states. [2019-09-08 08:13:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13800 states to 13800 states and 21026 transitions. [2019-09-08 08:13:27,061 INFO L78 Accepts]: Start accepts. Automaton has 13800 states and 21026 transitions. Word has length 96 [2019-09-08 08:13:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:27,062 INFO L475 AbstractCegarLoop]: Abstraction has 13800 states and 21026 transitions. [2019-09-08 08:13:27,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:13:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 13800 states and 21026 transitions. [2019-09-08 08:13:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:27,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:27,066 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] [2019-09-08 08:13:27,067 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:27,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1695854116, now seen corresponding path program 1 times [2019-09-08 08:13:27,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:27,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:27,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:27,180 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 08:13:27,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:27,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:27,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:27,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:27,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:27,182 INFO L87 Difference]: Start difference. First operand 13800 states and 21026 transitions. Second operand 6 states. [2019-09-08 08:13:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:29,281 INFO L93 Difference]: Finished difference Result 41030 states and 62743 transitions. [2019-09-08 08:13:29,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:13:29,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 08:13:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:29,398 INFO L225 Difference]: With dead ends: 41030 [2019-09-08 08:13:29,398 INFO L226 Difference]: Without dead ends: 27296 [2019-09-08 08:13:29,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:13:29,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27296 states. [2019-09-08 08:13:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27296 to 26998. [2019-09-08 08:13:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26998 states. [2019-09-08 08:13:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26998 states to 26998 states and 40977 transitions. [2019-09-08 08:13:30,484 INFO L78 Accepts]: Start accepts. Automaton has 26998 states and 40977 transitions. Word has length 96 [2019-09-08 08:13:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:30,485 INFO L475 AbstractCegarLoop]: Abstraction has 26998 states and 40977 transitions. [2019-09-08 08:13:30,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:30,485 INFO L276 IsEmpty]: Start isEmpty. Operand 26998 states and 40977 transitions. [2019-09-08 08:13:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:13:30,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:30,491 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] [2019-09-08 08:13:30,491 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:30,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash 540902564, now seen corresponding path program 1 times [2019-09-08 08:13:30,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:30,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:30,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:30,614 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 08:13:30,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:30,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:13:30,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:13:30,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:13:30,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:13:30,616 INFO L87 Difference]: Start difference. First operand 26998 states and 40977 transitions. Second operand 9 states. [2019-09-08 08:13:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:33,582 INFO L93 Difference]: Finished difference Result 38506 states and 58596 transitions. [2019-09-08 08:13:33,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 08:13:33,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 08:13:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:33,684 INFO L225 Difference]: With dead ends: 38506 [2019-09-08 08:13:33,685 INFO L226 Difference]: Without dead ends: 29026 [2019-09-08 08:13:33,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 08:13:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29026 states. [2019-09-08 08:13:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29026 to 23907. [2019-09-08 08:13:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23907 states. [2019-09-08 08:13:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23907 states to 23907 states and 36247 transitions. [2019-09-08 08:13:34,637 INFO L78 Accepts]: Start accepts. Automaton has 23907 states and 36247 transitions. Word has length 96 [2019-09-08 08:13:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:34,637 INFO L475 AbstractCegarLoop]: Abstraction has 23907 states and 36247 transitions. [2019-09-08 08:13:34,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:13:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 23907 states and 36247 transitions. [2019-09-08 08:13:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:13:34,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:34,644 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] [2019-09-08 08:13:34,644 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1518071062, now seen corresponding path program 1 times [2019-09-08 08:13:34,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:34,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:34,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:34,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:34,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:34,771 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 08:13:34,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:34,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:13:34,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:13:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:13:34,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:13:34,773 INFO L87 Difference]: Start difference. First operand 23907 states and 36247 transitions. Second operand 6 states. [2019-09-08 08:13:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:36,730 INFO L93 Difference]: Finished difference Result 72462 states and 110312 transitions. [2019-09-08 08:13:36,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:13:36,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 08:13:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:36,904 INFO L225 Difference]: With dead ends: 72462 [2019-09-08 08:13:36,905 INFO L226 Difference]: Without dead ends: 48621 [2019-09-08 08:13:36,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:13:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48621 states. [2019-09-08 08:13:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48621 to 48032. [2019-09-08 08:13:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48032 states. [2019-09-08 08:13:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48032 states to 48032 states and 72881 transitions. [2019-09-08 08:13:39,588 INFO L78 Accepts]: Start accepts. Automaton has 48032 states and 72881 transitions. Word has length 97 [2019-09-08 08:13:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:39,588 INFO L475 AbstractCegarLoop]: Abstraction has 48032 states and 72881 transitions. [2019-09-08 08:13:39,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:13:39,589 INFO L276 IsEmpty]: Start isEmpty. Operand 48032 states and 72881 transitions. [2019-09-08 08:13:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:13:39,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:39,596 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] [2019-09-08 08:13:39,596 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:39,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:39,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1436506364, now seen corresponding path program 1 times [2019-09-08 08:13:39,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:39,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:39,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:39,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:39,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:39,760 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 08:13:39,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:39,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 08:13:39,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 08:13:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 08:13:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:13:39,762 INFO L87 Difference]: Start difference. First operand 48032 states and 72881 transitions. Second operand 10 states. [2019-09-08 08:13:40,306 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-09-08 08:13:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:46,264 INFO L93 Difference]: Finished difference Result 109458 states and 169952 transitions. [2019-09-08 08:13:46,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 08:13:46,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-08 08:13:46,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:46,625 INFO L225 Difference]: With dead ends: 109458 [2019-09-08 08:13:46,626 INFO L226 Difference]: Without dead ends: 91828 [2019-09-08 08:13:46,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 08:13:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91828 states. [2019-09-08 08:13:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91828 to 72265. [2019-09-08 08:13:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72265 states. [2019-09-08 08:13:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72265 states to 72265 states and 109886 transitions. [2019-09-08 08:13:51,040 INFO L78 Accepts]: Start accepts. Automaton has 72265 states and 109886 transitions. Word has length 97 [2019-09-08 08:13:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:51,040 INFO L475 AbstractCegarLoop]: Abstraction has 72265 states and 109886 transitions. [2019-09-08 08:13:51,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 08:13:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 72265 states and 109886 transitions. [2019-09-08 08:13:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:13:51,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:51,047 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] [2019-09-08 08:13:51,047 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:51,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:51,047 INFO L82 PathProgramCache]: Analyzing trace with hash 592500862, now seen corresponding path program 1 times [2019-09-08 08:13:51,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:51,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:51,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:51,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:51,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:13:51,119 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 08:13:51,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:13:51,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:13:51,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:13:51,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:13:51,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:13:51,121 INFO L87 Difference]: Start difference. First operand 72265 states and 109886 transitions. Second operand 5 states. [2019-09-08 08:13:53,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:13:53,946 INFO L93 Difference]: Finished difference Result 170104 states and 261412 transitions. [2019-09-08 08:13:53,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:13:53,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 08:13:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:13:54,327 INFO L225 Difference]: With dead ends: 170104 [2019-09-08 08:13:54,327 INFO L226 Difference]: Without dead ends: 123863 [2019-09-08 08:13:54,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:13:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123863 states. [2019-09-08 08:13:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123863 to 122568. [2019-09-08 08:13:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122568 states. [2019-09-08 08:13:59,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122568 states to 122568 states and 187593 transitions. [2019-09-08 08:13:59,910 INFO L78 Accepts]: Start accepts. Automaton has 122568 states and 187593 transitions. Word has length 97 [2019-09-08 08:13:59,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:13:59,910 INFO L475 AbstractCegarLoop]: Abstraction has 122568 states and 187593 transitions. [2019-09-08 08:13:59,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:13:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 122568 states and 187593 transitions. [2019-09-08 08:13:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 08:13:59,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:13:59,918 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] [2019-09-08 08:13:59,918 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:13:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:13:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash 777456621, now seen corresponding path program 1 times [2019-09-08 08:13:59,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:13:59,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:13:59,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:59,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:13:59,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:13:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:00,058 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 08:14:00,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:00,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:14:00,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:14:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:14:00,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:14:00,060 INFO L87 Difference]: Start difference. First operand 122568 states and 187593 transitions. Second operand 6 states. [2019-09-08 08:14:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:06,497 INFO L93 Difference]: Finished difference Result 220288 states and 337964 transitions. [2019-09-08 08:14:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:14:06,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-08 08:14:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:06,866 INFO L225 Difference]: With dead ends: 220288 [2019-09-08 08:14:06,866 INFO L226 Difference]: Without dead ends: 126142 [2019-09-08 08:14:06,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:14:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126142 states. [2019-09-08 08:14:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126142 to 122440. [2019-09-08 08:14:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122440 states. [2019-09-08 08:14:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122440 states to 122440 states and 187053 transitions. [2019-09-08 08:14:10,790 INFO L78 Accepts]: Start accepts. Automaton has 122440 states and 187053 transitions. Word has length 98 [2019-09-08 08:14:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:10,791 INFO L475 AbstractCegarLoop]: Abstraction has 122440 states and 187053 transitions. [2019-09-08 08:14:10,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:14:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 122440 states and 187053 transitions. [2019-09-08 08:14:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 08:14:10,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:10,795 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] [2019-09-08 08:14:10,795 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:10,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1247943643, now seen corresponding path program 1 times [2019-09-08 08:14:10,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:10,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:10,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:11,434 WARN L188 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 3 [2019-09-08 08:14:11,463 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 08:14:11,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:11,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:14:11,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:14:11,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:14:11,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:14:11,464 INFO L87 Difference]: Start difference. First operand 122440 states and 187053 transitions. Second operand 6 states. [2019-09-08 08:14:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:15,535 INFO L93 Difference]: Finished difference Result 225637 states and 348662 transitions. [2019-09-08 08:14:15,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 08:14:15,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-08 08:14:15,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:15,924 INFO L225 Difference]: With dead ends: 225637 [2019-09-08 08:14:15,925 INFO L226 Difference]: Without dead ends: 134531 [2019-09-08 08:14:16,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 08:14:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134531 states. [2019-09-08 08:14:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134531 to 129794. [2019-09-08 08:14:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129794 states. [2019-09-08 08:14:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129794 states to 129794 states and 198085 transitions. [2019-09-08 08:14:23,514 INFO L78 Accepts]: Start accepts. Automaton has 129794 states and 198085 transitions. Word has length 98 [2019-09-08 08:14:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:23,515 INFO L475 AbstractCegarLoop]: Abstraction has 129794 states and 198085 transitions. [2019-09-08 08:14:23,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:14:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 129794 states and 198085 transitions. [2019-09-08 08:14:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:14:23,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:23,518 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] [2019-09-08 08:14:23,518 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash 488202899, now seen corresponding path program 1 times [2019-09-08 08:14:23,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:23,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:23,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:23,649 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 08:14:23,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:23,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 08:14:23,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 08:14:23,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 08:14:23,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:14:23,653 INFO L87 Difference]: Start difference. First operand 129794 states and 198085 transitions. Second operand 10 states. [2019-09-08 08:14:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:31,612 INFO L93 Difference]: Finished difference Result 267249 states and 409866 transitions. [2019-09-08 08:14:31,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 08:14:31,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-09-08 08:14:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:32,146 INFO L225 Difference]: With dead ends: 267249 [2019-09-08 08:14:32,146 INFO L226 Difference]: Without dead ends: 205542 [2019-09-08 08:14:32,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=952, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 08:14:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205542 states. [2019-09-08 08:14:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205542 to 185858. [2019-09-08 08:14:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185858 states. [2019-09-08 08:14:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185858 states to 185858 states and 284977 transitions. [2019-09-08 08:14:42,945 INFO L78 Accepts]: Start accepts. Automaton has 185858 states and 284977 transitions. Word has length 99 [2019-09-08 08:14:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:42,946 INFO L475 AbstractCegarLoop]: Abstraction has 185858 states and 284977 transitions. [2019-09-08 08:14:42,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 08:14:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 185858 states and 284977 transitions. [2019-09-08 08:14:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:14:42,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:42,950 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] [2019-09-08 08:14:42,950 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1200740843, now seen corresponding path program 1 times [2019-09-08 08:14:42,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:42,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:42,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:42,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:42,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:43,024 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 08:14:43,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:43,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:14:43,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:14:43,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:14:43,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:14:43,026 INFO L87 Difference]: Start difference. First operand 185858 states and 284977 transitions. Second operand 5 states. [2019-09-08 08:14:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:55,673 INFO L93 Difference]: Finished difference Result 489187 states and 758816 transitions. [2019-09-08 08:14:55,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:14:55,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 08:14:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:56,597 INFO L225 Difference]: With dead ends: 489187 [2019-09-08 08:14:56,598 INFO L226 Difference]: Without dead ends: 338729 [2019-09-08 08:14:56,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:14:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338729 states. [2019-09-08 08:15:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338729 to 334289. [2019-09-08 08:15:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334289 states. [2019-09-08 08:15:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334289 states to 334289 states and 516900 transitions. [2019-09-08 08:15:14,448 INFO L78 Accepts]: Start accepts. Automaton has 334289 states and 516900 transitions. Word has length 99 [2019-09-08 08:15:14,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:15:14,448 INFO L475 AbstractCegarLoop]: Abstraction has 334289 states and 516900 transitions. [2019-09-08 08:15:14,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:15:14,448 INFO L276 IsEmpty]: Start isEmpty. Operand 334289 states and 516900 transitions. [2019-09-08 08:15:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 08:15:14,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:15:14,451 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] [2019-09-08 08:15:14,451 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:15:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:15:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1797172734, now seen corresponding path program 1 times [2019-09-08 08:15:14,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:15:14,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:15:14,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:14,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:15:14,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:15:14,576 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 08:15:14,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:15:14,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:15:14,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:15:14,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:15:14,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:15:14,578 INFO L87 Difference]: Start difference. First operand 334289 states and 516900 transitions. Second operand 5 states. [2019-09-08 08:15:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:15:40,790 INFO L93 Difference]: Finished difference Result 994048 states and 1562511 transitions. [2019-09-08 08:15:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:15:40,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 08:15:40,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:15:42,699 INFO L225 Difference]: With dead ends: 994048 [2019-09-08 08:15:42,699 INFO L226 Difference]: Without dead ends: 659773 [2019-09-08 08:15:43,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:15:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659773 states. [2019-09-08 08:16:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659773 to 659771. [2019-09-08 08:16:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659771 states. [2019-09-08 08:16:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659771 states to 659771 states and 1007767 transitions. [2019-09-08 08:16:27,036 INFO L78 Accepts]: Start accepts. Automaton has 659771 states and 1007767 transitions. Word has length 99 [2019-09-08 08:16:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:16:27,037 INFO L475 AbstractCegarLoop]: Abstraction has 659771 states and 1007767 transitions. [2019-09-08 08:16:27,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:16:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 659771 states and 1007767 transitions. [2019-09-08 08:16:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 08:16:27,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:16:27,042 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] [2019-09-08 08:16:27,042 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:16:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:16:27,042 INFO L82 PathProgramCache]: Analyzing trace with hash -171155334, now seen corresponding path program 1 times [2019-09-08 08:16:27,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:16:27,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:16:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:27,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:16:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:16:27,140 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 08:16:27,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:16:27,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:16:27,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:16:27,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:16:27,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:16:27,141 INFO L87 Difference]: Start difference. First operand 659771 states and 1007767 transitions. Second operand 5 states. [2019-09-08 08:17:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:17:19,033 INFO L93 Difference]: Finished difference Result 1620992 states and 2493697 transitions. [2019-09-08 08:17:19,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:17:19,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 08:17:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:17:21,774 INFO L225 Difference]: With dead ends: 1620992 [2019-09-08 08:17:21,774 INFO L226 Difference]: Without dead ends: 961766 [2019-09-08 08:17:23,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:17:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961766 states. [2019-09-08 08:18:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961766 to 934468. [2019-09-08 08:18:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934468 states. [2019-09-08 08:18:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934468 states to 934468 states and 1426517 transitions. [2019-09-08 08:18:40,810 INFO L78 Accepts]: Start accepts. Automaton has 934468 states and 1426517 transitions. Word has length 100 [2019-09-08 08:18:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:18:40,810 INFO L475 AbstractCegarLoop]: Abstraction has 934468 states and 1426517 transitions. [2019-09-08 08:18:40,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:18:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 934468 states and 1426517 transitions. [2019-09-08 08:18:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 08:18:40,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:18:40,814 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] [2019-09-08 08:18:40,814 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:18:40,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:18:40,814 INFO L82 PathProgramCache]: Analyzing trace with hash -279493569, now seen corresponding path program 1 times [2019-09-08 08:18:40,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:18:40,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:18:40,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:40,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:18:40,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:18:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:18:40,926 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 08:18:40,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:18:40,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:18:40,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:18:40,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:18:40,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:18:40,928 INFO L87 Difference]: Start difference. First operand 934468 states and 1426517 transitions. Second operand 5 states. [2019-09-08 08:20:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:20:19,443 INFO L93 Difference]: Finished difference Result 2763866 states and 4317253 transitions. [2019-09-08 08:20:19,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:20:19,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-08 08:20:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:46,135 INFO L225 Difference]: With dead ends: 2763866 [2019-09-08 08:20:46,135 INFO L226 Difference]: Without dead ends: 1829430 [2019-09-08 08:20:49,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:20:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829430 states.