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-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:54:18,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:54:18,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:54:18,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:54:18,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:54:18,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:54:18,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:54:18,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:54:18,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:54:18,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:54:18,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:54:18,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:54:18,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:54:18,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:54:18,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:54:18,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:54:18,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:54:18,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:54:18,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:54:18,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:54:18,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:54:18,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:54:18,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:54:18,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:54:18,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:54:18,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:54:18,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:54:18,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:54:18,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:54:18,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:54:18,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:54:18,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:54:18,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:54:18,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:54:18,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:54:18,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:54:18,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:54:18,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:54:18,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:54:18,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:54:18,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:54:18,614 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 08:54:18,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:54:18,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:54:18,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:54:18,636 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:54:18,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:54:18,637 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:54:18,637 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:54:18,638 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:54:18,638 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:54:18,638 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:54:18,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:54:18,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:54:18,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:54:18,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:54:18,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:54:18,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:54:18,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:54:18,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:54:18,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:54:18,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:54:18,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:54:18,642 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:54:18,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:54:18,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:54:18,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:54:18,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:54:18,643 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:54:18,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:54:18,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:54:18,644 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:54:18,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:54:18,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:54:18,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:54:18,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:54:18,693 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:54:18,694 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:54:18,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b05c755/927d2e17c602430d8a431c00b1a7bddc/FLAGe6ff43011 [2019-09-10 08:54:19,485 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:54:19,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:54:19,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b05c755/927d2e17c602430d8a431c00b1a7bddc/FLAGe6ff43011 [2019-09-10 08:54:19,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3b05c755/927d2e17c602430d8a431c00b1a7bddc [2019-09-10 08:54:19,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:54:19,634 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:54:19,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:54:19,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:54:19,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:54:19,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:54:19" (1/1) ... [2019-09-10 08:54:19,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58411c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:19, skipping insertion in model container [2019-09-10 08:54:19,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:54:19" (1/1) ... [2019-09-10 08:54:19,648 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:54:19,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:54:20,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:54:20,875 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:54:21,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:54:21,459 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:54:21,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21 WrapperNode [2019-09-10 08:54:21,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:54:21,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:54:21,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:54:21,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:54:21,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21" (1/1) ... [2019-09-10 08:54:21,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21" (1/1) ... [2019-09-10 08:54:21,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21" (1/1) ... [2019-09-10 08:54:21,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21" (1/1) ... [2019-09-10 08:54:21,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21" (1/1) ... [2019-09-10 08:54:21,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21" (1/1) ... [2019-09-10 08:54:21,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21" (1/1) ... [2019-09-10 08:54:21,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:54:21,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:54:21,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:54:21,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:54:21,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21" (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 08:54:21,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:54:21,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:54:21,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:54:21,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:54:21,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:54:21,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:54:21,759 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:54:21,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:54:21,760 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:54:21,760 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:54:21,760 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:54:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:54:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:54:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:54:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:54:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:54:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:54:21,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:54:21,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:54:24,235 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:54:24,236 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:54:24,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:54:24 BoogieIcfgContainer [2019-09-10 08:54:24,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:54:24,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:54:24,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:54:24,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:54:24,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:54:19" (1/3) ... [2019-09-10 08:54:24,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5717b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:54:24, skipping insertion in model container [2019-09-10 08:54:24,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:54:21" (2/3) ... [2019-09-10 08:54:24,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5717b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:54:24, skipping insertion in model container [2019-09-10 08:54:24,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:54:24" (3/3) ... [2019-09-10 08:54:24,245 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 08:54:24,256 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:54:24,278 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:54:24,295 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:54:24,320 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:54:24,320 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:54:24,320 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:54:24,320 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:54:24,321 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:54:24,321 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:54:24,321 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:54:24,321 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:54:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states. [2019-09-10 08:54:24,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:54:24,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:24,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:24,423 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:24,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:24,428 INFO L82 PathProgramCache]: Analyzing trace with hash 143397951, now seen corresponding path program 1 times [2019-09-10 08:54:24,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:24,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:24,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:24,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:24,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:25,401 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 08:54:25,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:25,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:25,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:25,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:25,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:25,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:25,432 INFO L87 Difference]: Start difference. First operand 795 states. Second operand 3 states. [2019-09-10 08:54:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:25,960 INFO L93 Difference]: Finished difference Result 1292 states and 2278 transitions. [2019-09-10 08:54:25,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:25,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:54:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:26,004 INFO L225 Difference]: With dead ends: 1292 [2019-09-10 08:54:26,004 INFO L226 Difference]: Without dead ends: 1284 [2019-09-10 08:54:26,008 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 08:54:26,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2019-09-10 08:54:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1282. [2019-09-10 08:54:26,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-09-10 08:54:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 2005 transitions. [2019-09-10 08:54:26,154 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 2005 transitions. Word has length 324 [2019-09-10 08:54:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:26,161 INFO L475 AbstractCegarLoop]: Abstraction has 1282 states and 2005 transitions. [2019-09-10 08:54:26,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 2005 transitions. [2019-09-10 08:54:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:54:26,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:26,175 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:26,175 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:26,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1854541179, now seen corresponding path program 1 times [2019-09-10 08:54:26,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:26,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:26,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:26,559 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 08:54:26,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:26,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:26,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:26,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:26,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:26,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:26,563 INFO L87 Difference]: Start difference. First operand 1282 states and 2005 transitions. Second operand 3 states. [2019-09-10 08:54:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:26,836 INFO L93 Difference]: Finished difference Result 2248 states and 3508 transitions. [2019-09-10 08:54:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:26,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:54:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:26,856 INFO L225 Difference]: With dead ends: 2248 [2019-09-10 08:54:26,857 INFO L226 Difference]: Without dead ends: 2248 [2019-09-10 08:54:26,858 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 08:54:26,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2019-09-10 08:54:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2246. [2019-09-10 08:54:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-09-10 08:54:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3507 transitions. [2019-09-10 08:54:26,948 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3507 transitions. Word has length 324 [2019-09-10 08:54:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:26,950 INFO L475 AbstractCegarLoop]: Abstraction has 2246 states and 3507 transitions. [2019-09-10 08:54:26,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3507 transitions. [2019-09-10 08:54:26,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:54:26,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:26,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:26,966 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:26,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:26,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1626065980, now seen corresponding path program 1 times [2019-09-10 08:54:26,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:26,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:26,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:27,392 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 08:54:27,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:27,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:27,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:27,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:27,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:27,396 INFO L87 Difference]: Start difference. First operand 2246 states and 3507 transitions. Second operand 3 states. [2019-09-10 08:54:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:27,615 INFO L93 Difference]: Finished difference Result 4140 states and 6448 transitions. [2019-09-10 08:54:27,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:27,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 08:54:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:27,650 INFO L225 Difference]: With dead ends: 4140 [2019-09-10 08:54:27,650 INFO L226 Difference]: Without dead ends: 4140 [2019-09-10 08:54:27,651 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 08:54:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2019-09-10 08:54:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4138. [2019-09-10 08:54:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4138 states. [2019-09-10 08:54:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4138 states to 4138 states and 6447 transitions. [2019-09-10 08:54:27,853 INFO L78 Accepts]: Start accepts. Automaton has 4138 states and 6447 transitions. Word has length 324 [2019-09-10 08:54:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:27,854 INFO L475 AbstractCegarLoop]: Abstraction has 4138 states and 6447 transitions. [2019-09-10 08:54:27,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:27,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4138 states and 6447 transitions. [2019-09-10 08:54:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 08:54:27,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:27,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:27,871 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash -654990492, now seen corresponding path program 1 times [2019-09-10 08:54:27,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:27,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:27,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:27,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:27,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:28,894 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 08:54:28,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:28,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:28,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:28,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:28,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:28,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:28,896 INFO L87 Difference]: Start difference. First operand 4138 states and 6447 transitions. Second operand 4 states. [2019-09-10 08:54:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:29,142 INFO L93 Difference]: Finished difference Result 8108 states and 12557 transitions. [2019-09-10 08:54:29,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:29,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 08:54:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:29,190 INFO L225 Difference]: With dead ends: 8108 [2019-09-10 08:54:29,191 INFO L226 Difference]: Without dead ends: 8108 [2019-09-10 08:54:29,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8108 states. [2019-09-10 08:54:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8108 to 8106. [2019-09-10 08:54:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8106 states. [2019-09-10 08:54:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8106 states to 8106 states and 12556 transitions. [2019-09-10 08:54:29,469 INFO L78 Accepts]: Start accepts. Automaton has 8106 states and 12556 transitions. Word has length 324 [2019-09-10 08:54:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:29,470 INFO L475 AbstractCegarLoop]: Abstraction has 8106 states and 12556 transitions. [2019-09-10 08:54:29,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 8106 states and 12556 transitions. [2019-09-10 08:54:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:54:29,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:29,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:29,489 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:29,490 INFO L82 PathProgramCache]: Analyzing trace with hash -840226377, now seen corresponding path program 1 times [2019-09-10 08:54:29,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:29,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:29,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:29,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:29,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:29,773 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 08:54:29,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:29,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:29,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:29,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:29,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:29,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:29,775 INFO L87 Difference]: Start difference. First operand 8106 states and 12556 transitions. Second operand 3 states. [2019-09-10 08:54:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:29,934 INFO L93 Difference]: Finished difference Result 15890 states and 24466 transitions. [2019-09-10 08:54:29,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:29,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:54:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:30,004 INFO L225 Difference]: With dead ends: 15890 [2019-09-10 08:54:30,005 INFO L226 Difference]: Without dead ends: 15890 [2019-09-10 08:54:30,005 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 08:54:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15890 states. [2019-09-10 08:54:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15890 to 15888. [2019-09-10 08:54:30,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15888 states. [2019-09-10 08:54:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15888 states to 15888 states and 24465 transitions. [2019-09-10 08:54:30,668 INFO L78 Accepts]: Start accepts. Automaton has 15888 states and 24465 transitions. Word has length 326 [2019-09-10 08:54:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:30,669 INFO L475 AbstractCegarLoop]: Abstraction has 15888 states and 24465 transitions. [2019-09-10 08:54:30,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 15888 states and 24465 transitions. [2019-09-10 08:54:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 08:54:30,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:30,718 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:30,719 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:30,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:30,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1392604476, now seen corresponding path program 1 times [2019-09-10 08:54:30,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:30,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:30,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:30,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:30,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:30,912 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 08:54:30,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:30,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:30,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:30,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:30,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:30,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:30,917 INFO L87 Difference]: Start difference. First operand 15888 states and 24465 transitions. Second operand 3 states. [2019-09-10 08:54:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:31,104 INFO L93 Difference]: Finished difference Result 31743 states and 48870 transitions. [2019-09-10 08:54:31,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:31,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 08:54:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:31,190 INFO L225 Difference]: With dead ends: 31743 [2019-09-10 08:54:31,191 INFO L226 Difference]: Without dead ends: 31743 [2019-09-10 08:54:31,191 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 08:54:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31743 states. [2019-09-10 08:54:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31743 to 15907. [2019-09-10 08:54:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15907 states. [2019-09-10 08:54:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15907 states to 15907 states and 24493 transitions. [2019-09-10 08:54:31,692 INFO L78 Accepts]: Start accepts. Automaton has 15907 states and 24493 transitions. Word has length 326 [2019-09-10 08:54:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:31,692 INFO L475 AbstractCegarLoop]: Abstraction has 15907 states and 24493 transitions. [2019-09-10 08:54:31,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 15907 states and 24493 transitions. [2019-09-10 08:54:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 08:54:32,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:32,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:32,445 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:32,446 INFO L82 PathProgramCache]: Analyzing trace with hash -483333520, now seen corresponding path program 1 times [2019-09-10 08:54:32,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:32,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:32,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:32,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:32,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:32,595 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 08:54:32,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:32,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:32,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:32,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:32,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:32,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:32,598 INFO L87 Difference]: Start difference. First operand 15907 states and 24493 transitions. Second operand 3 states. [2019-09-10 08:54:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:32,736 INFO L93 Difference]: Finished difference Result 31761 states and 48891 transitions. [2019-09-10 08:54:32,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:32,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 08:54:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:32,808 INFO L225 Difference]: With dead ends: 31761 [2019-09-10 08:54:32,808 INFO L226 Difference]: Without dead ends: 31761 [2019-09-10 08:54:32,809 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 08:54:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31761 states. [2019-09-10 08:54:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31761 to 15925. [2019-09-10 08:54:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15925 states. [2019-09-10 08:54:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15925 states to 15925 states and 24514 transitions. [2019-09-10 08:54:33,240 INFO L78 Accepts]: Start accepts. Automaton has 15925 states and 24514 transitions. Word has length 327 [2019-09-10 08:54:33,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:33,241 INFO L475 AbstractCegarLoop]: Abstraction has 15925 states and 24514 transitions. [2019-09-10 08:54:33,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 15925 states and 24514 transitions. [2019-09-10 08:54:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:54:33,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:33,290 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:33,290 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:33,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1336838194, now seen corresponding path program 1 times [2019-09-10 08:54:33,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:33,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:33,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:33,841 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 08:54:33,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:33,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:33,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:33,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:33,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:33,844 INFO L87 Difference]: Start difference. First operand 15925 states and 24514 transitions. Second operand 3 states. [2019-09-10 08:54:34,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:34,005 INFO L93 Difference]: Finished difference Result 29436 states and 44989 transitions. [2019-09-10 08:54:34,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:34,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-10 08:54:34,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:34,070 INFO L225 Difference]: With dead ends: 29436 [2019-09-10 08:54:34,070 INFO L226 Difference]: Without dead ends: 29436 [2019-09-10 08:54:34,071 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 08:54:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29436 states. [2019-09-10 08:54:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29436 to 29434. [2019-09-10 08:54:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29434 states. [2019-09-10 08:54:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29434 states to 29434 states and 44988 transitions. [2019-09-10 08:54:34,670 INFO L78 Accepts]: Start accepts. Automaton has 29434 states and 44988 transitions. Word has length 328 [2019-09-10 08:54:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:34,671 INFO L475 AbstractCegarLoop]: Abstraction has 29434 states and 44988 transitions. [2019-09-10 08:54:34,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 29434 states and 44988 transitions. [2019-09-10 08:54:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 08:54:34,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:34,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:34,750 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:34,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1152108785, now seen corresponding path program 1 times [2019-09-10 08:54:34,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:34,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:34,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:34,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:34,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:35,363 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 08:54:35,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:35,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:35,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:35,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:35,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:35,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:35,366 INFO L87 Difference]: Start difference. First operand 29434 states and 44988 transitions. Second operand 4 states. [2019-09-10 08:54:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:35,602 INFO L93 Difference]: Finished difference Result 56587 states and 86379 transitions. [2019-09-10 08:54:35,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:35,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 08:54:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:35,729 INFO L225 Difference]: With dead ends: 56587 [2019-09-10 08:54:35,730 INFO L226 Difference]: Without dead ends: 56587 [2019-09-10 08:54:35,731 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 08:54:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56587 states. [2019-09-10 08:54:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56587 to 29669. [2019-09-10 08:54:36,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29669 states. [2019-09-10 08:54:36,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29669 states to 29669 states and 45376 transitions. [2019-09-10 08:54:36,703 INFO L78 Accepts]: Start accepts. Automaton has 29669 states and 45376 transitions. Word has length 328 [2019-09-10 08:54:36,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:36,704 INFO L475 AbstractCegarLoop]: Abstraction has 29669 states and 45376 transitions. [2019-09-10 08:54:36,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 29669 states and 45376 transitions. [2019-09-10 08:54:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:54:36,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:36,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:36,749 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash -453644434, now seen corresponding path program 1 times [2019-09-10 08:54:36,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:36,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:36,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:36,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:36,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:37,021 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 08:54:37,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:37,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:37,022 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:37,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:37,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:37,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:37,026 INFO L87 Difference]: Start difference. First operand 29669 states and 45376 transitions. Second operand 3 states. [2019-09-10 08:54:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:37,433 INFO L93 Difference]: Finished difference Result 47087 states and 72487 transitions. [2019-09-10 08:54:37,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:37,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:54:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:37,556 INFO L225 Difference]: With dead ends: 47087 [2019-09-10 08:54:37,557 INFO L226 Difference]: Without dead ends: 47087 [2019-09-10 08:54:37,558 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 08:54:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47087 states. [2019-09-10 08:54:38,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47087 to 37025. [2019-09-10 08:54:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37025 states. [2019-09-10 08:54:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37025 states to 37025 states and 57490 transitions. [2019-09-10 08:54:38,269 INFO L78 Accepts]: Start accepts. Automaton has 37025 states and 57490 transitions. Word has length 330 [2019-09-10 08:54:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:38,270 INFO L475 AbstractCegarLoop]: Abstraction has 37025 states and 57490 transitions. [2019-09-10 08:54:38,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 37025 states and 57490 transitions. [2019-09-10 08:54:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-10 08:54:38,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:38,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:38,303 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:38,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1877340163, now seen corresponding path program 1 times [2019-09-10 08:54:38,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:38,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:38,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:38,474 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 08:54:38,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:38,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:38,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:38,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:38,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:38,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:38,477 INFO L87 Difference]: Start difference. First operand 37025 states and 57490 transitions. Second operand 3 states. [2019-09-10 08:54:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:38,740 INFO L93 Difference]: Finished difference Result 73283 states and 113624 transitions. [2019-09-10 08:54:38,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:38,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-10 08:54:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:38,865 INFO L225 Difference]: With dead ends: 73283 [2019-09-10 08:54:38,865 INFO L226 Difference]: Without dead ends: 73283 [2019-09-10 08:54:38,867 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 08:54:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73283 states. [2019-09-10 08:54:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73283 to 37129. [2019-09-10 08:54:40,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37129 states. [2019-09-10 08:54:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37129 states to 37129 states and 57633 transitions. [2019-09-10 08:54:40,741 INFO L78 Accepts]: Start accepts. Automaton has 37129 states and 57633 transitions. Word has length 330 [2019-09-10 08:54:40,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:40,742 INFO L475 AbstractCegarLoop]: Abstraction has 37129 states and 57633 transitions. [2019-09-10 08:54:40,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 37129 states and 57633 transitions. [2019-09-10 08:54:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-10 08:54:40,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:40,770 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:40,771 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:40,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:40,771 INFO L82 PathProgramCache]: Analyzing trace with hash -804422415, now seen corresponding path program 1 times [2019-09-10 08:54:40,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:40,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:40,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:40,928 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 08:54:40,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:40,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:40,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:40,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:40,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:40,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:40,931 INFO L87 Difference]: Start difference. First operand 37129 states and 57633 transitions. Second operand 3 states. [2019-09-10 08:54:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:41,157 INFO L93 Difference]: Finished difference Result 73408 states and 113770 transitions. [2019-09-10 08:54:41,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:41,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-09-10 08:54:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:41,260 INFO L225 Difference]: With dead ends: 73408 [2019-09-10 08:54:41,260 INFO L226 Difference]: Without dead ends: 73408 [2019-09-10 08:54:41,264 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 08:54:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73408 states. [2019-09-10 08:54:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73408 to 37254. [2019-09-10 08:54:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37254 states. [2019-09-10 08:54:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37254 states to 37254 states and 57779 transitions. [2019-09-10 08:54:42,199 INFO L78 Accepts]: Start accepts. Automaton has 37254 states and 57779 transitions. Word has length 331 [2019-09-10 08:54:42,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:42,199 INFO L475 AbstractCegarLoop]: Abstraction has 37254 states and 57779 transitions. [2019-09-10 08:54:42,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 37254 states and 57779 transitions. [2019-09-10 08:54:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:54:42,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:42,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:42,225 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:42,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash 536139505, now seen corresponding path program 1 times [2019-09-10 08:54:42,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:42,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:42,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:42,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:42,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:42,404 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 08:54:42,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:42,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:42,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:42,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:42,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:42,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:42,406 INFO L87 Difference]: Start difference. First operand 37254 states and 57779 transitions. Second operand 3 states. [2019-09-10 08:54:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:42,619 INFO L93 Difference]: Finished difference Result 58400 states and 91148 transitions. [2019-09-10 08:54:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:42,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-10 08:54:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:42,687 INFO L225 Difference]: With dead ends: 58400 [2019-09-10 08:54:42,687 INFO L226 Difference]: Without dead ends: 58400 [2019-09-10 08:54:42,687 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 08:54:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58400 states. [2019-09-10 08:54:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58400 to 50446. [2019-09-10 08:54:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50446 states. [2019-09-10 08:54:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50446 states to 50446 states and 79409 transitions. [2019-09-10 08:54:43,223 INFO L78 Accepts]: Start accepts. Automaton has 50446 states and 79409 transitions. Word has length 332 [2019-09-10 08:54:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:43,224 INFO L475 AbstractCegarLoop]: Abstraction has 50446 states and 79409 transitions. [2019-09-10 08:54:43,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:54:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 50446 states and 79409 transitions. [2019-09-10 08:54:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 08:54:43,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:43,250 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:43,251 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:43,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1245793770, now seen corresponding path program 1 times [2019-09-10 08:54:43,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:43,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:43,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:43,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:43,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:44,931 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 08:54:44,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:44,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:44,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:44,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:44,934 INFO L87 Difference]: Start difference. First operand 50446 states and 79409 transitions. Second operand 4 states. [2019-09-10 08:54:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:45,104 INFO L93 Difference]: Finished difference Result 47935 states and 75415 transitions. [2019-09-10 08:54:45,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:45,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 08:54:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:45,166 INFO L225 Difference]: With dead ends: 47935 [2019-09-10 08:54:45,166 INFO L226 Difference]: Without dead ends: 47138 [2019-09-10 08:54:45,167 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 08:54:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47138 states. [2019-09-10 08:54:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47138 to 47118. [2019-09-10 08:54:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47118 states. [2019-09-10 08:54:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47118 states to 47118 states and 74148 transitions. [2019-09-10 08:54:45,579 INFO L78 Accepts]: Start accepts. Automaton has 47118 states and 74148 transitions. Word has length 332 [2019-09-10 08:54:45,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:45,579 INFO L475 AbstractCegarLoop]: Abstraction has 47118 states and 74148 transitions. [2019-09-10 08:54:45,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:45,579 INFO L276 IsEmpty]: Start isEmpty. Operand 47118 states and 74148 transitions. [2019-09-10 08:54:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 08:54:45,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:45,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:45,602 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:45,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1110227113, now seen corresponding path program 1 times [2019-09-10 08:54:45,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:45,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:45,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:46,173 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 08:54:46,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:46,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:54:46,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:46,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:54:46,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:54:46,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:54:46,176 INFO L87 Difference]: Start difference. First operand 47118 states and 74148 transitions. Second operand 10 states. [2019-09-10 08:54:48,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:48,988 INFO L93 Difference]: Finished difference Result 156054 states and 246753 transitions. [2019-09-10 08:54:48,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:54:48,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 333 [2019-09-10 08:54:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:49,183 INFO L225 Difference]: With dead ends: 156054 [2019-09-10 08:54:49,183 INFO L226 Difference]: Without dead ends: 156054 [2019-09-10 08:54:49,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:54:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156054 states. [2019-09-10 08:54:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156054 to 90862. [2019-09-10 08:54:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90862 states. [2019-09-10 08:54:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90862 states to 90862 states and 143417 transitions. [2019-09-10 08:54:52,139 INFO L78 Accepts]: Start accepts. Automaton has 90862 states and 143417 transitions. Word has length 333 [2019-09-10 08:54:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:52,139 INFO L475 AbstractCegarLoop]: Abstraction has 90862 states and 143417 transitions. [2019-09-10 08:54:52,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:54:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 90862 states and 143417 transitions. [2019-09-10 08:54:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 08:54:52,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:52,163 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:52,163 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:52,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1551200824, now seen corresponding path program 1 times [2019-09-10 08:54:52,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:52,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:52,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:52,820 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 08:54:52,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:52,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:54:52,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:52,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:54:52,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:54:52,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:54:52,822 INFO L87 Difference]: Start difference. First operand 90862 states and 143417 transitions. Second operand 4 states. [2019-09-10 08:54:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:53,367 INFO L93 Difference]: Finished difference Result 177459 states and 278792 transitions. [2019-09-10 08:54:53,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:53,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2019-09-10 08:54:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:53,604 INFO L225 Difference]: With dead ends: 177459 [2019-09-10 08:54:53,604 INFO L226 Difference]: Without dead ends: 177459 [2019-09-10 08:54:53,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:54:53,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177459 states. [2019-09-10 08:54:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177459 to 177457. [2019-09-10 08:54:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177457 states. [2019-09-10 08:54:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177457 states to 177457 states and 278791 transitions. [2019-09-10 08:54:56,312 INFO L78 Accepts]: Start accepts. Automaton has 177457 states and 278791 transitions. Word has length 333 [2019-09-10 08:54:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:56,312 INFO L475 AbstractCegarLoop]: Abstraction has 177457 states and 278791 transitions. [2019-09-10 08:54:56,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 177457 states and 278791 transitions. [2019-09-10 08:54:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-09-10 08:54:56,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:56,363 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:54:56,364 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:56,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:56,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1328429672, now seen corresponding path program 1 times [2019-09-10 08:54:56,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:56,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:56,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:56,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:56,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:54:56,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:56,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:56,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:56,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:56,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:56,669 INFO L87 Difference]: Start difference. First operand 177457 states and 278791 transitions. Second operand 3 states. [2019-09-10 08:55:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:00,405 INFO L93 Difference]: Finished difference Result 347741 states and 544513 transitions. [2019-09-10 08:55:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:00,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-09-10 08:55:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:00,997 INFO L225 Difference]: With dead ends: 347741 [2019-09-10 08:55:00,997 INFO L226 Difference]: Without dead ends: 347741 [2019-09-10 08:55:00,998 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 08:55:01,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347741 states. [2019-09-10 08:55:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347741 to 347739. [2019-09-10 08:55:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347739 states. [2019-09-10 08:55:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347739 states to 347739 states and 544512 transitions. [2019-09-10 08:55:10,959 INFO L78 Accepts]: Start accepts. Automaton has 347739 states and 544512 transitions. Word has length 335 [2019-09-10 08:55:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:10,959 INFO L475 AbstractCegarLoop]: Abstraction has 347739 states and 544512 transitions. [2019-09-10 08:55:10,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 347739 states and 544512 transitions. [2019-09-10 08:55:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-10 08:55:11,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:11,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:11,068 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:11,068 INFO L82 PathProgramCache]: Analyzing trace with hash 519055583, now seen corresponding path program 1 times [2019-09-10 08:55:11,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:11,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:11,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:11,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:11,273 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 08:55:11,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:11,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:11,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:11,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:11,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:11,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:11,277 INFO L87 Difference]: Start difference. First operand 347739 states and 544512 transitions. Second operand 3 states. [2019-09-10 08:55:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:12,932 INFO L93 Difference]: Finished difference Result 597229 states and 938337 transitions. [2019-09-10 08:55:12,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:12,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-09-10 08:55:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:13,766 INFO L225 Difference]: With dead ends: 597229 [2019-09-10 08:55:13,766 INFO L226 Difference]: Without dead ends: 597229 [2019-09-10 08:55:13,767 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 08:55:14,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597229 states. [2019-09-10 08:55:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597229 to 548859. [2019-09-10 08:55:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548859 states. [2019-09-10 08:55:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548859 states to 548859 states and 863080 transitions. [2019-09-10 08:55:29,863 INFO L78 Accepts]: Start accepts. Automaton has 548859 states and 863080 transitions. Word has length 336 [2019-09-10 08:55:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:29,863 INFO L475 AbstractCegarLoop]: Abstraction has 548859 states and 863080 transitions. [2019-09-10 08:55:29,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 548859 states and 863080 transitions. [2019-09-10 08:55:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 08:55:29,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:29,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:55:29,967 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:29,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1402597133, now seen corresponding path program 1 times [2019-09-10 08:55:29,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:29,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:29,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:29,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:29,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:30,265 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 08:55:30,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:30,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:55:30,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:30,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:55:30,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:55:30,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:55:30,268 INFO L87 Difference]: Start difference. First operand 548859 states and 863080 transitions. Second operand 3 states. [2019-09-10 08:55:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:40,053 INFO L93 Difference]: Finished difference Result 1015186 states and 1585894 transitions. [2019-09-10 08:55:40,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:55:40,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-10 08:55:40,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:41,315 INFO L225 Difference]: With dead ends: 1015186 [2019-09-10 08:55:41,315 INFO L226 Difference]: Without dead ends: 1015186 [2019-09-10 08:55:41,316 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 08:55:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015186 states. [2019-09-10 08:56:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015186 to 1015184. [2019-09-10 08:56:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015184 states. [2019-09-10 08:56:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015184 states to 1015184 states and 1585893 transitions. [2019-09-10 08:56:27,623 INFO L78 Accepts]: Start accepts. Automaton has 1015184 states and 1585893 transitions. Word has length 337 [2019-09-10 08:56:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:56:27,624 INFO L475 AbstractCegarLoop]: Abstraction has 1015184 states and 1585893 transitions. [2019-09-10 08:56:27,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:56:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1015184 states and 1585893 transitions. [2019-09-10 08:56:27,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 08:56:27,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:56:27,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:56:27,806 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:56:27,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:56:27,807 INFO L82 PathProgramCache]: Analyzing trace with hash 775437712, now seen corresponding path program 1 times [2019-09-10 08:56:27,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:56:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:27,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:56:27,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:56:27,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:56:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:56:28,162 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 08:56:28,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:56:28,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:56:28,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:56:28,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:56:28,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:56:28,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:56:28,164 INFO L87 Difference]: Start difference. First operand 1015184 states and 1585893 transitions. Second operand 4 states. [2019-09-10 08:56:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:56:47,721 INFO L93 Difference]: Finished difference Result 1781562 states and 2776675 transitions. [2019-09-10 08:56:47,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:56:47,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-09-10 08:56:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:56:50,482 INFO L225 Difference]: With dead ends: 1781562 [2019-09-10 08:56:50,482 INFO L226 Difference]: Without dead ends: 1781562 [2019-09-10 08:56:50,483 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 08:56:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781562 states. [2019-09-10 08:57:21,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781562 to 990398. [2019-09-10 08:57:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990398 states. [2019-09-10 08:57:38,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990398 states to 990398 states and 1546185 transitions. [2019-09-10 08:57:38,173 INFO L78 Accepts]: Start accepts. Automaton has 990398 states and 1546185 transitions. Word has length 337 [2019-09-10 08:57:38,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:57:38,173 INFO L475 AbstractCegarLoop]: Abstraction has 990398 states and 1546185 transitions. [2019-09-10 08:57:38,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:57:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand 990398 states and 1546185 transitions. [2019-09-10 08:57:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-10 08:57:41,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:57:41,194 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:57:41,194 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:57:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:57:41,194 INFO L82 PathProgramCache]: Analyzing trace with hash -40691692, now seen corresponding path program 1 times [2019-09-10 08:57:41,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:57:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:41,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:57:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:57:41,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:57:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:57:41,352 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 08:57:41,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:57:41,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:57:41,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:57:41,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:57:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:57:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:57:41,355 INFO L87 Difference]: Start difference. First operand 990398 states and 1546185 transitions. Second operand 3 states. [2019-09-10 08:57:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:57:57,476 INFO L93 Difference]: Finished difference Result 1784579 states and 2783764 transitions. [2019-09-10 08:57:57,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:57:57,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2019-09-10 08:57:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:58:02,394 INFO L225 Difference]: With dead ends: 1784579 [2019-09-10 08:58:02,394 INFO L226 Difference]: Without dead ends: 1784579 [2019-09-10 08:58:02,395 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 08:58:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784579 states. [2019-09-10 08:58:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784579 to 990879. [2019-09-10 08:58:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 990879 states. [2019-09-10 08:58:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990879 states to 990879 states and 1546783 transitions. [2019-09-10 08:58:53,465 INFO L78 Accepts]: Start accepts. Automaton has 990879 states and 1546783 transitions. Word has length 340 [2019-09-10 08:58:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:58:53,465 INFO L475 AbstractCegarLoop]: Abstraction has 990879 states and 1546783 transitions. [2019-09-10 08:58:53,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:58:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 990879 states and 1546783 transitions. [2019-09-10 08:58:53,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-10 08:58:53,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:58:53,641 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:53,642 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:58:53,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:58:53,642 INFO L82 PathProgramCache]: Analyzing trace with hash -246055525, now seen corresponding path program 1 times [2019-09-10 08:58:53,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:58:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:53,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:58:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:58:53,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:58:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:58:53,834 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 08:58:53,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:58:53,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:58:53,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:58:53,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:58:53,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:58:53,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:58:53,836 INFO L87 Difference]: Start difference. First operand 990879 states and 1546783 transitions. Second operand 3 states. [2019-09-10 08:59:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:59:02,943 INFO L93 Difference]: Finished difference Result 1621105 states and 2537711 transitions. [2019-09-10 08:59:02,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:59:02,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2019-09-10 08:59:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:59:20,395 INFO L225 Difference]: With dead ends: 1621105 [2019-09-10 08:59:20,395 INFO L226 Difference]: Without dead ends: 1621105 [2019-09-10 08:59:20,396 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 08:59:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621105 states. [2019-09-10 08:59:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621105 to 1501727. [2019-09-10 08:59:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501727 states.