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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:55:09,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:55:09,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:55:09,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:55:09,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:55:09,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:55:09,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:55:09,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:55:09,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:55:09,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:55:09,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:55:09,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:55:09,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:55:09,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:55:09,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:55:09,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:55:09,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:55:09,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:55:09,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:55:09,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:55:09,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:55:09,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:55:09,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:55:09,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:55:09,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:55:09,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:55:09,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:55:09,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:55:09,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:55:09,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:55:09,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:55:09,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:55:09,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:55:09,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:55:09,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:55:09,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:55:09,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:55:09,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:55:09,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:55:09,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:55:09,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:55:09,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 04:55:09,631 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:55:09,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:55:09,633 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:55:09,633 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:55:09,634 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:55:09,634 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:55:09,634 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:55:09,634 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:55:09,635 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:55:09,635 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:55:09,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:55:09,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:55:09,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:55:09,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:55:09,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:55:09,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:55:09,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:55:09,639 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:55:09,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:55:09,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:55:09,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:55:09,640 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:55:09,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:55:09,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:55:09,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:55:09,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:55:09,641 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:55:09,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:55:09,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:55:09,642 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:55:09,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:55:09,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:55:09,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:55:09,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:55:09,711 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:55:09,712 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.UNBOUNDED.pals.c [2019-09-10 04:55:09,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e7f0842/5436065db1d44fc59918c7a9d1d37676/FLAG3ce694940 [2019-09-10 04:55:10,236 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:55:10,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:55:10,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e7f0842/5436065db1d44fc59918c7a9d1d37676/FLAG3ce694940 [2019-09-10 04:55:10,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e7f0842/5436065db1d44fc59918c7a9d1d37676 [2019-09-10 04:55:10,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:55:10,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:55:10,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:55:10,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:55:10,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:55:10,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:55:10" (1/1) ... [2019-09-10 04:55:10,614 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d37676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:10, skipping insertion in model container [2019-09-10 04:55:10,614 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:55:10" (1/1) ... [2019-09-10 04:55:10,622 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:55:10,671 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:55:11,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:55:11,075 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:55:11,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:55:11,174 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:55:11,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11 WrapperNode [2019-09-10 04:55:11,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:55:11,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:55:11,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:55:11,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:55:11,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11" (1/1) ... [2019-09-10 04:55:11,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11" (1/1) ... [2019-09-10 04:55:11,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11" (1/1) ... [2019-09-10 04:55:11,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11" (1/1) ... [2019-09-10 04:55:11,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11" (1/1) ... [2019-09-10 04:55:11,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11" (1/1) ... [2019-09-10 04:55:11,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11" (1/1) ... [2019-09-10 04:55:11,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:55:11,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:55:11,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:55:11,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:55:11,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11" (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-10 04:55:11,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:55:11,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:55:11,305 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:55:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:55:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:55:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:55:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:55:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:55:11,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:55:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:55:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:55:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:55:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:55:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:55:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:55:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:55:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:55:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:55:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:55:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:55:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:55:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:55:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:55:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:55:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:55:12,147 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:55:12,148 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:55:12,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:55:12 BoogieIcfgContainer [2019-09-10 04:55:12,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:55:12,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:55:12,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:55:12,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:55:12,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:55:10" (1/3) ... [2019-09-10 04:55:12,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a37b9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:55:12, skipping insertion in model container [2019-09-10 04:55:12,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:55:11" (2/3) ... [2019-09-10 04:55:12,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a37b9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:55:12, skipping insertion in model container [2019-09-10 04:55:12,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:55:12" (3/3) ... [2019-09-10 04:55:12,160 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:55:12,171 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:55:12,181 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:55:12,197 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:55:12,222 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:55:12,223 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:55:12,223 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:55:12,223 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:55:12,223 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:55:12,223 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:55:12,223 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:55:12,223 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:55:12,244 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-09-10 04:55:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 04:55:12,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:12,259 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-10 04:55:12,261 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:12,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:12,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1222599780, now seen corresponding path program 1 times [2019-09-10 04:55:12,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:12,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:12,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:12,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:12,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:12,765 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-10 04:55:12,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:12,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:55:12,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:12,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:55:12,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:55:12,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:55:12,793 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 5 states. [2019-09-10 04:55:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:12,924 INFO L93 Difference]: Finished difference Result 172 states and 276 transitions. [2019-09-10 04:55:12,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:55:12,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 04:55:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:12,940 INFO L225 Difference]: With dead ends: 172 [2019-09-10 04:55:12,941 INFO L226 Difference]: Without dead ends: 168 [2019-09-10 04:55:12,942 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-10 04:55:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-09-10 04:55:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-09-10 04:55:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-10 04:55:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 243 transitions. [2019-09-10 04:55:12,995 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 243 transitions. Word has length 59 [2019-09-10 04:55:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:12,996 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 243 transitions. [2019-09-10 04:55:12,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:55:12,996 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 243 transitions. [2019-09-10 04:55:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 04:55:13,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:13,001 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-10 04:55:13,001 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1294429502, now seen corresponding path program 1 times [2019-09-10 04:55:13,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:13,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:13,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:13,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:13,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:13,253 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-10 04:55:13,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:13,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:55:13,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:13,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:55:13,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:55:13,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:55:13,256 INFO L87 Difference]: Start difference. First operand 168 states and 243 transitions. Second operand 9 states. [2019-09-10 04:55:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:16,261 INFO L93 Difference]: Finished difference Result 972 states and 1487 transitions. [2019-09-10 04:55:16,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 04:55:16,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 04:55:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:16,275 INFO L225 Difference]: With dead ends: 972 [2019-09-10 04:55:16,276 INFO L226 Difference]: Without dead ends: 972 [2019-09-10 04:55:16,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-10 04:55:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-09-10 04:55:16,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 664. [2019-09-10 04:55:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-09-10 04:55:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1017 transitions. [2019-09-10 04:55:16,366 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1017 transitions. Word has length 88 [2019-09-10 04:55:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:16,367 INFO L475 AbstractCegarLoop]: Abstraction has 664 states and 1017 transitions. [2019-09-10 04:55:16,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:55:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1017 transitions. [2019-09-10 04:55:16,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 04:55:16,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:16,373 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:55:16,373 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:16,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1877557831, now seen corresponding path program 1 times [2019-09-10 04:55:16,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:16,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:16,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:16,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:16,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:16,556 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-10 04:55:16,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:16,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:55:16,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:16,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:55:16,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:55:16,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:55:16,558 INFO L87 Difference]: Start difference. First operand 664 states and 1017 transitions. Second operand 6 states. [2019-09-10 04:55:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:17,793 INFO L93 Difference]: Finished difference Result 1284 states and 1976 transitions. [2019-09-10 04:55:17,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:55:17,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-10 04:55:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:17,802 INFO L225 Difference]: With dead ends: 1284 [2019-09-10 04:55:17,802 INFO L226 Difference]: Without dead ends: 1284 [2019-09-10 04:55:17,803 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-10 04:55:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-10 04:55:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 974. [2019-09-10 04:55:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-09-10 04:55:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1495 transitions. [2019-09-10 04:55:17,849 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1495 transitions. Word has length 89 [2019-09-10 04:55:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:17,850 INFO L475 AbstractCegarLoop]: Abstraction has 974 states and 1495 transitions. [2019-09-10 04:55:17,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:55:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1495 transitions. [2019-09-10 04:55:17,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 04:55:17,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:17,862 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-10 04:55:17,863 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:17,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1476602283, now seen corresponding path program 1 times [2019-09-10 04:55:17,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:17,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:17,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:17,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:17,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:55:18,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:18,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:55:18,009 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:18,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:55:18,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:55:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:55:18,011 INFO L87 Difference]: Start difference. First operand 974 states and 1495 transitions. Second operand 6 states. [2019-09-10 04:55:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:19,386 INFO L93 Difference]: Finished difference Result 4525 states and 6980 transitions. [2019-09-10 04:55:19,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:55:19,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-10 04:55:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:19,430 INFO L225 Difference]: With dead ends: 4525 [2019-09-10 04:55:19,431 INFO L226 Difference]: Without dead ends: 4525 [2019-09-10 04:55:19,431 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-10 04:55:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2019-09-10 04:55:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 4499. [2019-09-10 04:55:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-09-10 04:55:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 6940 transitions. [2019-09-10 04:55:19,644 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 6940 transitions. Word has length 90 [2019-09-10 04:55:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:19,645 INFO L475 AbstractCegarLoop]: Abstraction has 4499 states and 6940 transitions. [2019-09-10 04:55:19,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:55:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 6940 transitions. [2019-09-10 04:55:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 04:55:19,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:19,648 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:55:19,649 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1983567120, now seen corresponding path program 1 times [2019-09-10 04:55:19,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:19,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:19,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:19,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:19,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:55:19,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:19,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:55:19,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:19,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:55:19,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:55:19,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:55:19,771 INFO L87 Difference]: Start difference. First operand 4499 states and 6940 transitions. Second operand 6 states. [2019-09-10 04:55:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:21,112 INFO L93 Difference]: Finished difference Result 18594 states and 28664 transitions. [2019-09-10 04:55:21,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:55:21,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-10 04:55:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:21,233 INFO L225 Difference]: With dead ends: 18594 [2019-09-10 04:55:21,233 INFO L226 Difference]: Without dead ends: 18594 [2019-09-10 04:55:21,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:55:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18594 states. [2019-09-10 04:55:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18594 to 18508. [2019-09-10 04:55:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-09-10 04:55:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 28504 transitions. [2019-09-10 04:55:21,863 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 28504 transitions. Word has length 91 [2019-09-10 04:55:21,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:21,864 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 28504 transitions. [2019-09-10 04:55:21,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:55:21,865 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 28504 transitions. [2019-09-10 04:55:21,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:55:21,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:21,867 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] [2019-09-10 04:55:21,868 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:21,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1312570520, now seen corresponding path program 1 times [2019-09-10 04:55:21,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:21,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:21,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:21,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:21,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:22,025 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-10 04:55:22,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:22,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:55:22,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:22,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:55:22,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:55:22,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:55:22,028 INFO L87 Difference]: Start difference. First operand 18508 states and 28504 transitions. Second operand 6 states. [2019-09-10 04:55:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:23,212 INFO L93 Difference]: Finished difference Result 50641 states and 76171 transitions. [2019-09-10 04:55:23,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:55:23,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-10 04:55:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:23,460 INFO L225 Difference]: With dead ends: 50641 [2019-09-10 04:55:23,461 INFO L226 Difference]: Without dead ends: 50641 [2019-09-10 04:55:23,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:55:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50641 states. [2019-09-10 04:55:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50641 to 50163. [2019-09-10 04:55:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50163 states. [2019-09-10 04:55:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50163 states to 50163 states and 75695 transitions. [2019-09-10 04:55:25,515 INFO L78 Accepts]: Start accepts. Automaton has 50163 states and 75695 transitions. Word has length 93 [2019-09-10 04:55:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:25,518 INFO L475 AbstractCegarLoop]: Abstraction has 50163 states and 75695 transitions. [2019-09-10 04:55:25,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:55:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 50163 states and 75695 transitions. [2019-09-10 04:55:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:55:25,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:25,528 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-10 04:55:25,528 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash -27207661, now seen corresponding path program 1 times [2019-09-10 04:55:25,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:25,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:25,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:25,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:25,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:25,686 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-10 04:55:25,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:25,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:55:25,687 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:25,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:55:25,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:55:25,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:55:25,689 INFO L87 Difference]: Start difference. First operand 50163 states and 75695 transitions. Second operand 5 states. [2019-09-10 04:55:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:26,129 INFO L93 Difference]: Finished difference Result 99180 states and 147779 transitions. [2019-09-10 04:55:26,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:55:26,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 04:55:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:27,850 INFO L225 Difference]: With dead ends: 99180 [2019-09-10 04:55:27,851 INFO L226 Difference]: Without dead ends: 99180 [2019-09-10 04:55:27,851 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-10 04:55:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99180 states. [2019-09-10 04:55:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99180 to 99178. [2019-09-10 04:55:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99178 states. [2019-09-10 04:55:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99178 states to 99178 states and 147778 transitions. [2019-09-10 04:55:29,806 INFO L78 Accepts]: Start accepts. Automaton has 99178 states and 147778 transitions. Word has length 95 [2019-09-10 04:55:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:29,807 INFO L475 AbstractCegarLoop]: Abstraction has 99178 states and 147778 transitions. [2019-09-10 04:55:29,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:55:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 99178 states and 147778 transitions. [2019-09-10 04:55:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:55:29,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:29,810 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-10 04:55:29,810 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:29,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1417757155, now seen corresponding path program 1 times [2019-09-10 04:55:29,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:29,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:29,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:29,921 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-10 04:55:29,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:29,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:55:29,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:29,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:55:29,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:55:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:55:29,923 INFO L87 Difference]: Start difference. First operand 99178 states and 147778 transitions. Second operand 5 states. [2019-09-10 04:55:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:33,021 INFO L93 Difference]: Finished difference Result 132433 states and 197858 transitions. [2019-09-10 04:55:33,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:55:33,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-10 04:55:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:33,407 INFO L225 Difference]: With dead ends: 132433 [2019-09-10 04:55:33,407 INFO L226 Difference]: Without dead ends: 132433 [2019-09-10 04:55:33,408 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-10 04:55:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132433 states. [2019-09-10 04:55:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132433 to 129218. [2019-09-10 04:55:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129218 states. [2019-09-10 04:55:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129218 states to 129218 states and 192754 transitions. [2019-09-10 04:55:35,382 INFO L78 Accepts]: Start accepts. Automaton has 129218 states and 192754 transitions. Word has length 96 [2019-09-10 04:55:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:35,382 INFO L475 AbstractCegarLoop]: Abstraction has 129218 states and 192754 transitions. [2019-09-10 04:55:35,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:55:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 129218 states and 192754 transitions. [2019-09-10 04:55:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:55:35,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:35,385 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-10 04:55:35,386 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:35,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1696645317, now seen corresponding path program 1 times [2019-09-10 04:55:35,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:35,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:35,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:35,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:35,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:35,428 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-10 04:55:35,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:35,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:55:35,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:35,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:55:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:55:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:55:35,430 INFO L87 Difference]: Start difference. First operand 129218 states and 192754 transitions. Second operand 3 states. [2019-09-10 04:55:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:36,609 INFO L93 Difference]: Finished difference Result 129320 states and 192878 transitions. [2019-09-10 04:55:36,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:55:36,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 04:55:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:37,016 INFO L225 Difference]: With dead ends: 129320 [2019-09-10 04:55:37,016 INFO L226 Difference]: Without dead ends: 129320 [2019-09-10 04:55:37,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:55:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129320 states. [2019-09-10 04:55:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129320 to 129220. [2019-09-10 04:55:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129220 states. [2019-09-10 04:55:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129220 states to 129220 states and 192756 transitions. [2019-09-10 04:55:41,242 INFO L78 Accepts]: Start accepts. Automaton has 129220 states and 192756 transitions. Word has length 96 [2019-09-10 04:55:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:41,242 INFO L475 AbstractCegarLoop]: Abstraction has 129220 states and 192756 transitions. [2019-09-10 04:55:41,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:55:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 129220 states and 192756 transitions. [2019-09-10 04:55:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 04:55:41,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:41,246 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-10 04:55:41,246 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:41,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1504546431, now seen corresponding path program 1 times [2019-09-10 04:55:41,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:41,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:41,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:55:41,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:41,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:55:41,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:41,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:55:41,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:55:41,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:55:41,349 INFO L87 Difference]: Start difference. First operand 129220 states and 192756 transitions. Second operand 4 states. [2019-09-10 04:55:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:41,736 INFO L93 Difference]: Finished difference Result 129276 states and 192832 transitions. [2019-09-10 04:55:41,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:55:41,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 04:55:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:42,599 INFO L225 Difference]: With dead ends: 129276 [2019-09-10 04:55:42,599 INFO L226 Difference]: Without dead ends: 129217 [2019-09-10 04:55:42,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:55:42,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129217 states. [2019-09-10 04:55:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129217 to 129217. [2019-09-10 04:55:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129217 states. [2019-09-10 04:55:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129217 states to 129217 states and 192750 transitions. [2019-09-10 04:55:44,452 INFO L78 Accepts]: Start accepts. Automaton has 129217 states and 192750 transitions. Word has length 97 [2019-09-10 04:55:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:44,452 INFO L475 AbstractCegarLoop]: Abstraction has 129217 states and 192750 transitions. [2019-09-10 04:55:44,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:55:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 129217 states and 192750 transitions. [2019-09-10 04:55:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 04:55:44,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:44,456 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-10 04:55:44,456 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:44,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1912897000, now seen corresponding path program 1 times [2019-09-10 04:55:44,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:44,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:44,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:44,564 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-10 04:55:44,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:44,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:55:44,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:44,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:55:44,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:55:44,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:55:44,566 INFO L87 Difference]: Start difference. First operand 129217 states and 192750 transitions. Second operand 5 states. [2019-09-10 04:55:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:45,855 INFO L93 Difference]: Finished difference Result 193062 states and 284482 transitions. [2019-09-10 04:55:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:55:45,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 04:55:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:46,284 INFO L225 Difference]: With dead ends: 193062 [2019-09-10 04:55:46,284 INFO L226 Difference]: Without dead ends: 193062 [2019-09-10 04:55:46,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:55:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193062 states. [2019-09-10 04:55:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193062 to 193060. [2019-09-10 04:55:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193060 states. [2019-09-10 04:55:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193060 states to 193060 states and 284481 transitions. [2019-09-10 04:55:52,164 INFO L78 Accepts]: Start accepts. Automaton has 193060 states and 284481 transitions. Word has length 97 [2019-09-10 04:55:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:55:52,164 INFO L475 AbstractCegarLoop]: Abstraction has 193060 states and 284481 transitions. [2019-09-10 04:55:52,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:55:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 193060 states and 284481 transitions. [2019-09-10 04:55:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:55:52,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:55:52,169 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-10 04:55:52,169 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:55:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:55:52,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1016547523, now seen corresponding path program 1 times [2019-09-10 04:55:52,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:55:52,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:52,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:55:52,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:55:52,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:55:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:55:52,274 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-10 04:55:52,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:55:52,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:55:52,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:55:52,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:55:52,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:55:52,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:55:52,276 INFO L87 Difference]: Start difference. First operand 193060 states and 284481 transitions. Second operand 5 states. [2019-09-10 04:55:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:53,434 INFO L93 Difference]: Finished difference Result 378150 states and 548494 transitions. [2019-09-10 04:55:53,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:55:53,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 04:55:53,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:59,062 INFO L225 Difference]: With dead ends: 378150 [2019-09-10 04:55:59,063 INFO L226 Difference]: Without dead ends: 378150 [2019-09-10 04:55:59,063 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-10 04:55:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378150 states. [2019-09-10 04:56:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378150 to 378148. [2019-09-10 04:56:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378148 states. [2019-09-10 04:56:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378148 states to 378148 states and 548493 transitions. [2019-09-10 04:56:04,149 INFO L78 Accepts]: Start accepts. Automaton has 378148 states and 548493 transitions. Word has length 98 [2019-09-10 04:56:04,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:56:04,149 INFO L475 AbstractCegarLoop]: Abstraction has 378148 states and 548493 transitions. [2019-09-10 04:56:04,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:56:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 378148 states and 548493 transitions. [2019-09-10 04:56:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 04:56:04,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:56:04,156 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-10 04:56:04,156 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:56:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:56:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash 411512272, now seen corresponding path program 1 times [2019-09-10 04:56:04,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:56:04,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:56:04,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:56:04,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:56:04,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:56:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:56:04,334 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-10 04:56:04,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:56:04,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:56:04,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:56:04,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:56:04,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:56:04,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:56:04,336 INFO L87 Difference]: Start difference. First operand 378148 states and 548493 transitions. Second operand 11 states. [2019-09-10 04:56:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:56:14,073 INFO L93 Difference]: Finished difference Result 772667 states and 1138501 transitions. [2019-09-10 04:56:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 04:56:14,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2019-09-10 04:56:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:56:16,215 INFO L225 Difference]: With dead ends: 772667 [2019-09-10 04:56:16,215 INFO L226 Difference]: Without dead ends: 772667 [2019-09-10 04:56:16,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 04:56:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772667 states. [2019-09-10 04:56:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772667 to 652749. [2019-09-10 04:56:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652749 states. [2019-09-10 04:56:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652749 states to 652749 states and 951015 transitions. [2019-09-10 04:56:33,838 INFO L78 Accepts]: Start accepts. Automaton has 652749 states and 951015 transitions. Word has length 99 [2019-09-10 04:56:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:56:33,839 INFO L475 AbstractCegarLoop]: Abstraction has 652749 states and 951015 transitions. [2019-09-10 04:56:33,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:56:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 652749 states and 951015 transitions. [2019-09-10 04:56:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 04:56:33,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:56:33,847 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-10 04:56:33,848 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:56:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:56:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash -617847026, now seen corresponding path program 1 times [2019-09-10 04:56:33,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:56:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:56:33,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:56:33,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:56:33,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:56:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:56:33,948 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-10 04:56:33,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:56:33,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:56:33,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:56:33,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:56:33,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:56:33,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:56:33,950 INFO L87 Difference]: Start difference. First operand 652749 states and 951015 transitions. Second operand 5 states. [2019-09-10 04:56:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:56:46,290 INFO L93 Difference]: Finished difference Result 1090601 states and 1562331 transitions. [2019-09-10 04:56:46,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:56:46,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 04:56:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:56:58,717 INFO L225 Difference]: With dead ends: 1090601 [2019-09-10 04:56:58,717 INFO L226 Difference]: Without dead ends: 1090601 [2019-09-10 04:56:58,717 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-10 04:56:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090601 states. [2019-09-10 04:57:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090601 to 1089639. [2019-09-10 04:57:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089639 states. [2019-09-10 04:57:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089639 states to 1089639 states and 1561370 transitions. [2019-09-10 04:57:45,131 INFO L78 Accepts]: Start accepts. Automaton has 1089639 states and 1561370 transitions. Word has length 99 [2019-09-10 04:57:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:57:45,131 INFO L475 AbstractCegarLoop]: Abstraction has 1089639 states and 1561370 transitions. [2019-09-10 04:57:45,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:57:45,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1089639 states and 1561370 transitions. [2019-09-10 04:57:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 04:57:45,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:57:45,142 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-10 04:57:45,142 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:57:45,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:57:45,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1640107265, now seen corresponding path program 1 times [2019-09-10 04:57:45,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:57:45,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:57:45,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:57:45,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:57:45,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:57:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:57:45,284 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-10 04:57:45,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:57:45,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:57:45,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:57:45,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:57:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:57:45,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:57:45,286 INFO L87 Difference]: Start difference. First operand 1089639 states and 1561370 transitions. Second operand 11 states. [2019-09-10 04:58:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:58:07,720 INFO L93 Difference]: Finished difference Result 1309499 states and 1898829 transitions. [2019-09-10 04:58:07,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 04:58:07,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-09-10 04:58:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:58:12,525 INFO L225 Difference]: With dead ends: 1309499 [2019-09-10 04:58:12,525 INFO L226 Difference]: Without dead ends: 1309463 [2019-09-10 04:58:12,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 04:58:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309463 states. [2019-09-10 04:58:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309463 to 1096935. [2019-09-10 04:58:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096935 states.