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/systemc/mem_slave_tlm.4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:15:20,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:15:20,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:15:20,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:15:20,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:15:20,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:15:20,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:15:20,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:15:20,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:15:20,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:15:20,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:15:20,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:15:20,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:15:20,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:15:20,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:15:20,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:15:20,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:15:20,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:15:20,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:15:20,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:15:20,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:15:20,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:15:20,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:15:20,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:15:20,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:15:20,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:15:20,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:15:20,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:15:20,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:15:20,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:15:20,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:15:20,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:15:20,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:15:20,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:15:20,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:15:20,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:15:20,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:15:20,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:15:20,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:15:20,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:15:20,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:15:20,591 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 03:15:20,614 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:15:20,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:15:20,616 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:15:20,616 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:15:20,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:15:20,617 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:15:20,617 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:15:20,617 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:15:20,617 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:15:20,617 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:15:20,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:15:20,620 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:15:20,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:15:20,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:15:20,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:15:20,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:15:20,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:15:20,621 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:15:20,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:15:20,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:15:20,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:15:20,622 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:15:20,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:15:20,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:15:20,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:15:20,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:15:20,623 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:15:20,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:15:20,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:15:20,624 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:15:20,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:15:20,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:15:20,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:15:20,693 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:15:20,694 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:15:20,695 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/mem_slave_tlm.4.cil.c [2019-09-10 03:15:20,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941774757/9f5562918ba742fb8254c1bdfc319d49/FLAGdbed6b251 [2019-09-10 03:15:21,227 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:15:21,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/mem_slave_tlm.4.cil.c [2019-09-10 03:15:21,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941774757/9f5562918ba742fb8254c1bdfc319d49/FLAGdbed6b251 [2019-09-10 03:15:21,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941774757/9f5562918ba742fb8254c1bdfc319d49 [2019-09-10 03:15:21,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:15:21,614 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:15:21,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:15:21,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:15:21,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:15:21,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:15:21" (1/1) ... [2019-09-10 03:15:21,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49fd16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:21, skipping insertion in model container [2019-09-10 03:15:21,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:15:21" (1/1) ... [2019-09-10 03:15:21,631 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:15:21,693 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:15:22,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:15:22,112 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:15:22,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:15:22,229 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:15:22,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22 WrapperNode [2019-09-10 03:15:22,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:15:22,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:15:22,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:15:22,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:15:22,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22" (1/1) ... [2019-09-10 03:15:22,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22" (1/1) ... [2019-09-10 03:15:22,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22" (1/1) ... [2019-09-10 03:15:22,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22" (1/1) ... [2019-09-10 03:15:22,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22" (1/1) ... [2019-09-10 03:15:22,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22" (1/1) ... [2019-09-10 03:15:22,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22" (1/1) ... [2019-09-10 03:15:22,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:15:22,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:15:22,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:15:22,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:15:22,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22" (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 03:15:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:15:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:15:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:15:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_read [2019-09-10 03:15:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure s_memory_write [2019-09-10 03:15:22,409 INFO L138 BoogieDeclarations]: Found implementation of procedure m_run [2019-09-10 03:15:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure s_run [2019-09-10 03:15:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:15:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:15:22,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:15:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:15:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:15:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:15:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_read [2019-09-10 03:15:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure s_memory_write [2019-09-10 03:15:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure m_run [2019-09-10 03:15:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure s_run [2019-09-10 03:15:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:15:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:15:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:15:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:15:22,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:15:23,758 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:15:23,758 INFO L283 CfgBuilder]: Removed 13 assume(true) statements. [2019-09-10 03:15:23,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:15:23 BoogieIcfgContainer [2019-09-10 03:15:23,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:15:23,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:15:23,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:15:23,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:15:23,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:15:21" (1/3) ... [2019-09-10 03:15:23,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cea6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:15:23, skipping insertion in model container [2019-09-10 03:15:23,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:15:22" (2/3) ... [2019-09-10 03:15:23,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cea6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:15:23, skipping insertion in model container [2019-09-10 03:15:23,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:15:23" (3/3) ... [2019-09-10 03:15:23,773 INFO L109 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.4.cil.c [2019-09-10 03:15:23,784 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:15:23,804 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:15:23,825 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:15:23,849 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:15:23,849 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:15:23,849 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:15:23,849 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:15:23,849 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:15:23,849 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:15:23,850 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:15:23,850 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:15:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-09-10 03:15:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 03:15:23,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:23,903 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] [2019-09-10 03:15:23,904 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:23,910 INFO L82 PathProgramCache]: Analyzing trace with hash -546552828, now seen corresponding path program 1 times [2019-09-10 03:15:23,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:23,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:23,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:23,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:23,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:24,272 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 03:15:24,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:24,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:24,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:24,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:24,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:24,299 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-09-10 03:15:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:24,815 INFO L93 Difference]: Finished difference Result 511 states and 829 transitions. [2019-09-10 03:15:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:24,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-10 03:15:24,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:24,849 INFO L225 Difference]: With dead ends: 511 [2019-09-10 03:15:24,850 INFO L226 Difference]: Without dead ends: 497 [2019-09-10 03:15:24,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 03:15:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-10 03:15:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 484. [2019-09-10 03:15:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-10 03:15:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 803 transitions. [2019-09-10 03:15:24,970 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 803 transitions. Word has length 39 [2019-09-10 03:15:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:24,971 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 803 transitions. [2019-09-10 03:15:24,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 803 transitions. [2019-09-10 03:15:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-10 03:15:24,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:24,976 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] [2019-09-10 03:15:24,976 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:24,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:24,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1634111521, now seen corresponding path program 1 times [2019-09-10 03:15:24,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:24,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:24,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:24,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:24,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:25,081 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 03:15:25,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:25,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:25,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:25,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:25,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:25,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:25,085 INFO L87 Difference]: Start difference. First operand 484 states and 803 transitions. Second operand 3 states. [2019-09-10 03:15:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:25,446 INFO L93 Difference]: Finished difference Result 687 states and 1109 transitions. [2019-09-10 03:15:25,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:25,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-09-10 03:15:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:25,454 INFO L225 Difference]: With dead ends: 687 [2019-09-10 03:15:25,454 INFO L226 Difference]: Without dead ends: 687 [2019-09-10 03:15:25,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 03:15:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-10 03:15:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 674. [2019-09-10 03:15:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-10 03:15:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1097 transitions. [2019-09-10 03:15:25,508 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1097 transitions. Word has length 42 [2019-09-10 03:15:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:25,509 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 1097 transitions. [2019-09-10 03:15:25,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1097 transitions. [2019-09-10 03:15:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-10 03:15:25,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:25,524 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] [2019-09-10 03:15:25,524 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:25,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1176085093, now seen corresponding path program 1 times [2019-09-10 03:15:25,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:25,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:25,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:25,655 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 03:15:25,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:25,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:25,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:25,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:25,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:25,658 INFO L87 Difference]: Start difference. First operand 674 states and 1097 transitions. Second operand 3 states. [2019-09-10 03:15:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:25,923 INFO L93 Difference]: Finished difference Result 878 states and 1390 transitions. [2019-09-10 03:15:25,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:25,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-10 03:15:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:25,930 INFO L225 Difference]: With dead ends: 878 [2019-09-10 03:15:25,931 INFO L226 Difference]: Without dead ends: 878 [2019-09-10 03:15:25,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 03:15:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-09-10 03:15:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 865. [2019-09-10 03:15:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-09-10 03:15:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1378 transitions. [2019-09-10 03:15:25,961 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1378 transitions. Word has length 44 [2019-09-10 03:15:25,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:25,961 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1378 transitions. [2019-09-10 03:15:25,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1378 transitions. [2019-09-10 03:15:25,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-10 03:15:25,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:25,964 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] [2019-09-10 03:15:25,964 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:25,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:25,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1511702548, now seen corresponding path program 1 times [2019-09-10 03:15:25,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:25,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:25,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:25,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:25,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:26,040 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 03:15:26,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:26,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:26,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:26,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:26,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:26,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:26,043 INFO L87 Difference]: Start difference. First operand 865 states and 1378 transitions. Second operand 3 states. [2019-09-10 03:15:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:26,308 INFO L93 Difference]: Finished difference Result 1015 states and 1574 transitions. [2019-09-10 03:15:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:26,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-10 03:15:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:26,316 INFO L225 Difference]: With dead ends: 1015 [2019-09-10 03:15:26,316 INFO L226 Difference]: Without dead ends: 1015 [2019-09-10 03:15:26,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 03:15:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-10 03:15:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1006. [2019-09-10 03:15:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1006 states. [2019-09-10 03:15:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1566 transitions. [2019-09-10 03:15:26,382 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1566 transitions. Word has length 49 [2019-09-10 03:15:26,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:26,383 INFO L475 AbstractCegarLoop]: Abstraction has 1006 states and 1566 transitions. [2019-09-10 03:15:26,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:26,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1566 transitions. [2019-09-10 03:15:26,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 03:15:26,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:26,385 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:15:26,385 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:26,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:26,386 INFO L82 PathProgramCache]: Analyzing trace with hash 50782505, now seen corresponding path program 1 times [2019-09-10 03:15:26,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:26,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:26,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:26,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:26,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:26,444 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 03:15:26,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:26,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:26,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:26,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:26,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:26,446 INFO L87 Difference]: Start difference. First operand 1006 states and 1566 transitions. Second operand 3 states. [2019-09-10 03:15:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:26,641 INFO L93 Difference]: Finished difference Result 1157 states and 1755 transitions. [2019-09-10 03:15:26,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:26,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-10 03:15:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:26,649 INFO L225 Difference]: With dead ends: 1157 [2019-09-10 03:15:26,650 INFO L226 Difference]: Without dead ends: 1157 [2019-09-10 03:15:26,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 03:15:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-09-10 03:15:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1148. [2019-09-10 03:15:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-09-10 03:15:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1747 transitions. [2019-09-10 03:15:26,685 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1747 transitions. Word has length 51 [2019-09-10 03:15:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:26,686 INFO L475 AbstractCegarLoop]: Abstraction has 1148 states and 1747 transitions. [2019-09-10 03:15:26,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1747 transitions. [2019-09-10 03:15:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 03:15:26,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:26,688 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] [2019-09-10 03:15:26,688 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash 449548745, now seen corresponding path program 1 times [2019-09-10 03:15:26,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:26,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:26,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:26,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:26,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:26,755 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 03:15:26,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:26,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:26,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:26,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:26,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:26,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:26,759 INFO L87 Difference]: Start difference. First operand 1148 states and 1747 transitions. Second operand 3 states. [2019-09-10 03:15:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:26,960 INFO L93 Difference]: Finished difference Result 1300 states and 1929 transitions. [2019-09-10 03:15:26,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:26,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-10 03:15:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:26,970 INFO L225 Difference]: With dead ends: 1300 [2019-09-10 03:15:26,970 INFO L226 Difference]: Without dead ends: 1300 [2019-09-10 03:15:26,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 03:15:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-09-10 03:15:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1291. [2019-09-10 03:15:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2019-09-10 03:15:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1921 transitions. [2019-09-10 03:15:27,009 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1921 transitions. Word has length 51 [2019-09-10 03:15:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:27,010 INFO L475 AbstractCegarLoop]: Abstraction has 1291 states and 1921 transitions. [2019-09-10 03:15:27,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1921 transitions. [2019-09-10 03:15:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 03:15:27,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:27,012 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] [2019-09-10 03:15:27,012 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -93621791, now seen corresponding path program 1 times [2019-09-10 03:15:27,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:27,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:27,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:27,060 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 03:15:27,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:27,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:27,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:27,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:27,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:27,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:27,062 INFO L87 Difference]: Start difference. First operand 1291 states and 1921 transitions. Second operand 3 states. [2019-09-10 03:15:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:27,213 INFO L93 Difference]: Finished difference Result 2423 states and 3600 transitions. [2019-09-10 03:15:27,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:27,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-10 03:15:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:27,227 INFO L225 Difference]: With dead ends: 2423 [2019-09-10 03:15:27,227 INFO L226 Difference]: Without dead ends: 2423 [2019-09-10 03:15:27,227 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 03:15:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-09-10 03:15:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2410. [2019-09-10 03:15:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2019-09-10 03:15:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 3588 transitions. [2019-09-10 03:15:27,301 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 3588 transitions. Word has length 52 [2019-09-10 03:15:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:27,301 INFO L475 AbstractCegarLoop]: Abstraction has 2410 states and 3588 transitions. [2019-09-10 03:15:27,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 3588 transitions. [2019-09-10 03:15:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-10 03:15:27,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:27,304 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] [2019-09-10 03:15:27,304 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:27,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:27,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1060798297, now seen corresponding path program 1 times [2019-09-10 03:15:27,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:27,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:27,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:27,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:27,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:27,522 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 03:15:27,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:27,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:15:27,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:27,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:15:27,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:15:27,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:15:27,526 INFO L87 Difference]: Start difference. First operand 2410 states and 3588 transitions. Second operand 8 states. [2019-09-10 03:15:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:27,944 INFO L93 Difference]: Finished difference Result 4602 states and 6913 transitions. [2019-09-10 03:15:27,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:15:27,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-09-10 03:15:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:27,975 INFO L225 Difference]: With dead ends: 4602 [2019-09-10 03:15:27,975 INFO L226 Difference]: Without dead ends: 4602 [2019-09-10 03:15:27,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-09-10 03:15:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2019-09-10 03:15:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 3883. [2019-09-10 03:15:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3883 states. [2019-09-10 03:15:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 5942 transitions. [2019-09-10 03:15:28,146 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 5942 transitions. Word has length 53 [2019-09-10 03:15:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:28,146 INFO L475 AbstractCegarLoop]: Abstraction has 3883 states and 5942 transitions. [2019-09-10 03:15:28,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:15:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 5942 transitions. [2019-09-10 03:15:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 03:15:28,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:28,150 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] [2019-09-10 03:15:28,150 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:28,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1166091998, now seen corresponding path program 1 times [2019-09-10 03:15:28,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:28,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:28,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:28,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:28,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:28,233 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 03:15:28,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:28,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:15:28,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:28,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:15:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:15:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:15:28,235 INFO L87 Difference]: Start difference. First operand 3883 states and 5942 transitions. Second operand 4 states. [2019-09-10 03:15:28,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:28,323 INFO L93 Difference]: Finished difference Result 4354 states and 6573 transitions. [2019-09-10 03:15:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:15:28,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-09-10 03:15:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:28,350 INFO L225 Difference]: With dead ends: 4354 [2019-09-10 03:15:28,350 INFO L226 Difference]: Without dead ends: 4354 [2019-09-10 03:15:28,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 03:15:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4354 states. [2019-09-10 03:15:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4354 to 3739. [2019-09-10 03:15:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-09-10 03:15:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5718 transitions. [2019-09-10 03:15:28,518 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5718 transitions. Word has length 54 [2019-09-10 03:15:28,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:28,519 INFO L475 AbstractCegarLoop]: Abstraction has 3739 states and 5718 transitions. [2019-09-10 03:15:28,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:15:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5718 transitions. [2019-09-10 03:15:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 03:15:28,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:28,524 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] [2019-09-10 03:15:28,524 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:28,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:28,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1268368390, now seen corresponding path program 1 times [2019-09-10 03:15:28,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:28,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:28,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:28,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:28,583 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 03:15:28,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:28,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:28,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:28,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:28,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:28,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:28,584 INFO L87 Difference]: Start difference. First operand 3739 states and 5718 transitions. Second operand 3 states. [2019-09-10 03:15:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:28,748 INFO L93 Difference]: Finished difference Result 7012 states and 11345 transitions. [2019-09-10 03:15:28,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:28,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-10 03:15:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:28,791 INFO L225 Difference]: With dead ends: 7012 [2019-09-10 03:15:28,791 INFO L226 Difference]: Without dead ends: 7012 [2019-09-10 03:15:28,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 03:15:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7012 states. [2019-09-10 03:15:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7012 to 6943. [2019-09-10 03:15:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6943 states. [2019-09-10 03:15:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6943 states to 6943 states and 11277 transitions. [2019-09-10 03:15:29,346 INFO L78 Accepts]: Start accepts. Automaton has 6943 states and 11277 transitions. Word has length 63 [2019-09-10 03:15:29,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:29,346 INFO L475 AbstractCegarLoop]: Abstraction has 6943 states and 11277 transitions. [2019-09-10 03:15:29,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 6943 states and 11277 transitions. [2019-09-10 03:15:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 03:15:29,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:29,353 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] [2019-09-10 03:15:29,353 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:29,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1023635325, now seen corresponding path program 1 times [2019-09-10 03:15:29,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:29,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:29,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:29,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:29,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:29,415 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 03:15:29,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:29,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:15:29,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:29,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:15:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:15:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:15:29,417 INFO L87 Difference]: Start difference. First operand 6943 states and 11277 transitions. Second operand 4 states. [2019-09-10 03:15:29,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:29,973 INFO L93 Difference]: Finished difference Result 10046 states and 17668 transitions. [2019-09-10 03:15:29,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:15:29,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-10 03:15:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:30,040 INFO L225 Difference]: With dead ends: 10046 [2019-09-10 03:15:30,041 INFO L226 Difference]: Without dead ends: 10046 [2019-09-10 03:15:30,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 03:15:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10046 states. [2019-09-10 03:15:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10046 to 9941. [2019-09-10 03:15:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9941 states. [2019-09-10 03:15:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9941 states to 9941 states and 17547 transitions. [2019-09-10 03:15:30,840 INFO L78 Accepts]: Start accepts. Automaton has 9941 states and 17547 transitions. Word has length 63 [2019-09-10 03:15:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:30,842 INFO L475 AbstractCegarLoop]: Abstraction has 9941 states and 17547 transitions. [2019-09-10 03:15:30,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:15:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 9941 states and 17547 transitions. [2019-09-10 03:15:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 03:15:30,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:30,868 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] [2019-09-10 03:15:30,868 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:30,869 INFO L82 PathProgramCache]: Analyzing trace with hash -214624784, now seen corresponding path program 1 times [2019-09-10 03:15:30,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:30,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:30,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:30,985 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 03:15:30,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:30,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:30,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:30,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:30,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:30,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:30,988 INFO L87 Difference]: Start difference. First operand 9941 states and 17547 transitions. Second operand 3 states. [2019-09-10 03:15:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:31,187 INFO L93 Difference]: Finished difference Result 9621 states and 17038 transitions. [2019-09-10 03:15:31,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:31,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 03:15:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:31,239 INFO L225 Difference]: With dead ends: 9621 [2019-09-10 03:15:31,239 INFO L226 Difference]: Without dead ends: 9621 [2019-09-10 03:15:31,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 03:15:31,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9621 states. [2019-09-10 03:15:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9621 to 9589. [2019-09-10 03:15:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9589 states. [2019-09-10 03:15:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9589 states to 9589 states and 16986 transitions. [2019-09-10 03:15:32,318 INFO L78 Accepts]: Start accepts. Automaton has 9589 states and 16986 transitions. Word has length 78 [2019-09-10 03:15:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:32,319 INFO L475 AbstractCegarLoop]: Abstraction has 9589 states and 16986 transitions. [2019-09-10 03:15:32,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 9589 states and 16986 transitions. [2019-09-10 03:15:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 03:15:32,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:32,350 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] [2019-09-10 03:15:32,350 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:32,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:32,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1165854494, now seen corresponding path program 1 times [2019-09-10 03:15:32,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:32,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:32,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:32,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:32,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:32,435 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 03:15:32,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:32,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:15:32,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:32,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:15:32,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:15:32,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:15:32,437 INFO L87 Difference]: Start difference. First operand 9589 states and 16986 transitions. Second operand 4 states. [2019-09-10 03:15:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:32,992 INFO L93 Difference]: Finished difference Result 9584 states and 16316 transitions. [2019-09-10 03:15:33,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:15:33,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-10 03:15:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:33,121 INFO L225 Difference]: With dead ends: 9584 [2019-09-10 03:15:33,122 INFO L226 Difference]: Without dead ends: 9584 [2019-09-10 03:15:33,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 03:15:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-09-10 03:15:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 8589. [2019-09-10 03:15:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8589 states. [2019-09-10 03:15:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8589 states to 8589 states and 14718 transitions. [2019-09-10 03:15:33,501 INFO L78 Accepts]: Start accepts. Automaton has 8589 states and 14718 transitions. Word has length 77 [2019-09-10 03:15:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:33,501 INFO L475 AbstractCegarLoop]: Abstraction has 8589 states and 14718 transitions. [2019-09-10 03:15:33,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:15:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8589 states and 14718 transitions. [2019-09-10 03:15:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 03:15:33,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:33,522 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:15:33,522 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1522816861, now seen corresponding path program 1 times [2019-09-10 03:15:33,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:33,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:33,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 03:15:33,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:33,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:33,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:33,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:33,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:33,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:33,598 INFO L87 Difference]: Start difference. First operand 8589 states and 14718 transitions. Second operand 3 states. [2019-09-10 03:15:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:33,713 INFO L93 Difference]: Finished difference Result 8437 states and 14412 transitions. [2019-09-10 03:15:33,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:33,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 03:15:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:33,752 INFO L225 Difference]: With dead ends: 8437 [2019-09-10 03:15:33,752 INFO L226 Difference]: Without dead ends: 8437 [2019-09-10 03:15:33,753 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 03:15:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8437 states. [2019-09-10 03:15:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8437 to 8437. [2019-09-10 03:15:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8437 states. [2019-09-10 03:15:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 14412 transitions. [2019-09-10 03:15:34,295 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 14412 transitions. Word has length 80 [2019-09-10 03:15:34,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:34,296 INFO L475 AbstractCegarLoop]: Abstraction has 8437 states and 14412 transitions. [2019-09-10 03:15:34,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 14412 transitions. [2019-09-10 03:15:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 03:15:34,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:34,310 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] [2019-09-10 03:15:34,310 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1599717659, now seen corresponding path program 1 times [2019-09-10 03:15:34,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:34,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:34,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:34,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:34,389 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 03:15:34,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:34,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:15:34,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:34,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:15:34,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:15:34,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:15:34,391 INFO L87 Difference]: Start difference. First operand 8437 states and 14412 transitions. Second operand 3 states. [2019-09-10 03:15:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:34,689 INFO L93 Difference]: Finished difference Result 8457 states and 14345 transitions. [2019-09-10 03:15:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:15:34,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 03:15:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:34,717 INFO L225 Difference]: With dead ends: 8457 [2019-09-10 03:15:34,717 INFO L226 Difference]: Without dead ends: 8457 [2019-09-10 03:15:34,719 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 03:15:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8457 states. [2019-09-10 03:15:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8457 to 8437. [2019-09-10 03:15:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8437 states. [2019-09-10 03:15:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8437 states to 8437 states and 14326 transitions. [2019-09-10 03:15:35,077 INFO L78 Accepts]: Start accepts. Automaton has 8437 states and 14326 transitions. Word has length 80 [2019-09-10 03:15:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:35,077 INFO L475 AbstractCegarLoop]: Abstraction has 8437 states and 14326 transitions. [2019-09-10 03:15:35,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:15:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8437 states and 14326 transitions. [2019-09-10 03:15:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 03:15:35,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:35,088 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] [2019-09-10 03:15:35,088 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash -463644165, now seen corresponding path program 1 times [2019-09-10 03:15:35,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:35,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:35,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:35,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:35,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:35,208 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 03:15:35,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:35,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:15:35,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:35,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:15:35,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:15:35,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:15:35,210 INFO L87 Difference]: Start difference. First operand 8437 states and 14326 transitions. Second operand 9 states. [2019-09-10 03:15:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:39,441 INFO L93 Difference]: Finished difference Result 16067 states and 49232 transitions. [2019-09-10 03:15:39,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 03:15:39,442 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-09-10 03:15:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:39,555 INFO L225 Difference]: With dead ends: 16067 [2019-09-10 03:15:39,556 INFO L226 Difference]: Without dead ends: 16067 [2019-09-10 03:15:39,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2019-09-10 03:15:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16067 states. [2019-09-10 03:15:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16067 to 13683. [2019-09-10 03:15:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13683 states. [2019-09-10 03:15:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13683 states to 13683 states and 40195 transitions. [2019-09-10 03:15:42,482 INFO L78 Accepts]: Start accepts. Automaton has 13683 states and 40195 transitions. Word has length 81 [2019-09-10 03:15:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:42,483 INFO L475 AbstractCegarLoop]: Abstraction has 13683 states and 40195 transitions. [2019-09-10 03:15:42,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:15:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 13683 states and 40195 transitions. [2019-09-10 03:15:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 03:15:42,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:42,512 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] [2019-09-10 03:15:42,512 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1179168064, now seen corresponding path program 1 times [2019-09-10 03:15:42,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:42,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:42,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:42,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:42,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:42,662 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 03:15:42,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:42,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:15:42,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:42,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:15:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:15:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:15:42,666 INFO L87 Difference]: Start difference. First operand 13683 states and 40195 transitions. Second operand 8 states. [2019-09-10 03:15:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:44,111 INFO L93 Difference]: Finished difference Result 21738 states and 81073 transitions. [2019-09-10 03:15:44,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:15:44,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-10 03:15:44,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:44,294 INFO L225 Difference]: With dead ends: 21738 [2019-09-10 03:15:44,294 INFO L226 Difference]: Without dead ends: 21738 [2019-09-10 03:15:44,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:15:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21738 states. [2019-09-10 03:15:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21738 to 19690. [2019-09-10 03:15:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19690 states. [2019-09-10 03:15:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19690 states to 19690 states and 75304 transitions. [2019-09-10 03:15:48,717 INFO L78 Accepts]: Start accepts. Automaton has 19690 states and 75304 transitions. Word has length 82 [2019-09-10 03:15:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:15:48,718 INFO L475 AbstractCegarLoop]: Abstraction has 19690 states and 75304 transitions. [2019-09-10 03:15:48,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:15:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 19690 states and 75304 transitions. [2019-09-10 03:15:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 03:15:48,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:15:48,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:15:48,741 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:15:48,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:15:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1159753684, now seen corresponding path program 1 times [2019-09-10 03:15:48,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:15:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:48,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:15:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:15:48,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:15:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:15:48,833 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 03:15:48,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:15:48,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:15:48,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:15:48,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:15:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:15:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:15:48,835 INFO L87 Difference]: Start difference. First operand 19690 states and 75304 transitions. Second operand 8 states. [2019-09-10 03:15:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:15:51,447 INFO L93 Difference]: Finished difference Result 38027 states and 186450 transitions. [2019-09-10 03:15:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:15:51,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-09-10 03:15:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:15:51,881 INFO L225 Difference]: With dead ends: 38027 [2019-09-10 03:15:51,881 INFO L226 Difference]: Without dead ends: 38027 [2019-09-10 03:15:51,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:15:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38027 states. [2019-09-10 03:16:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38027 to 31664. [2019-09-10 03:16:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31664 states. [2019-09-10 03:16:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31664 states to 31664 states and 147348 transitions. [2019-09-10 03:16:06,923 INFO L78 Accepts]: Start accepts. Automaton has 31664 states and 147348 transitions. Word has length 87 [2019-09-10 03:16:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:16:06,924 INFO L475 AbstractCegarLoop]: Abstraction has 31664 states and 147348 transitions. [2019-09-10 03:16:06,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:16:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 31664 states and 147348 transitions. [2019-09-10 03:16:06,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 03:16:06,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:16:06,940 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:16:06,940 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:16:06,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:06,941 INFO L82 PathProgramCache]: Analyzing trace with hash 877422817, now seen corresponding path program 1 times [2019-09-10 03:16:06,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:16:06,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:06,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:16:06,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:06,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:16:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:16:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:16:07,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:07,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:16:07,013 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 93 with the following transitions: [2019-09-10 03:16:07,015 INFO L207 CegarAbsIntRunner]: [0], [5], [10], [15], [20], [25], [26], [27], [36], [40], [51], [54], [64], [67], [73], [79], [82], [84], [87], [116], [125], [129], [133], [142], [146], [148], [150], [152], [156], [165], [171], [179], [182], [185], [262], [274], [276], [285], [289], [293], [902], [903], [906], [912], [926], [938], [950], [962], [974], [986], [998], [1010], [1019], [1021], [1138], [1166], [1169], [1172], [1193], [1202], [1208], [1216], [1227], [1239], [1243], [1248], [1263], [1275], [1287], [1299], [1311], [1313], [1316], [1452], [1454], [1455], [1456], [1464], [1466], [1467], [1468], [1470], [1474] [2019-09-10 03:16:07,062 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:16:07,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:16:07,202 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:16:07,204 INFO L272 AbstractInterpreter]: Visited 42 different actions 42 times. Never merged. Never widened. Performed 365 root evaluator evaluations with a maximum evaluation depth of 3. Performed 365 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 102 variables. [2019-09-10 03:16:07,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:07,208 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:16:07,353 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 89.18% of their original sizes. [2019-09-10 03:16:07,353 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:16:10,088 INFO L420 sIntCurrentIteration]: We unified 91 AI predicates to 91 [2019-09-10 03:16:10,089 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:16:10,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:16:10,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2019-09-10 03:16:10,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:16:10,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 03:16:10,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 03:16:10,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:16:10,091 INFO L87 Difference]: Start difference. First operand 31664 states and 147348 transitions. Second operand 17 states. [2019-09-10 03:16:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:16:15,597 INFO L93 Difference]: Finished difference Result 31677 states and 147316 transitions. [2019-09-10 03:16:15,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:16:15,597 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 92 [2019-09-10 03:16:15,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:16:15,955 INFO L225 Difference]: With dead ends: 31677 [2019-09-10 03:16:15,955 INFO L226 Difference]: Without dead ends: 31677 [2019-09-10 03:16:15,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2019-09-10 03:16:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31677 states. [2019-09-10 03:16:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31677 to 31668. [2019-09-10 03:16:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31668 states. [2019-09-10 03:16:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31668 states to 31668 states and 147285 transitions. [2019-09-10 03:16:30,331 INFO L78 Accepts]: Start accepts. Automaton has 31668 states and 147285 transitions. Word has length 92 [2019-09-10 03:16:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:16:30,331 INFO L475 AbstractCegarLoop]: Abstraction has 31668 states and 147285 transitions. [2019-09-10 03:16:30,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 03:16:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 31668 states and 147285 transitions. [2019-09-10 03:16:30,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 03:16:30,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:16:30,350 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:16:30,351 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:16:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:30,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1492418148, now seen corresponding path program 1 times [2019-09-10 03:16:30,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:16:30,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:30,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:16:30,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:30,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:16:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:16:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:16:30,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:30,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:16:30,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 108 with the following transitions: [2019-09-10 03:16:30,447 INFO L207 CegarAbsIntRunner]: [0], [5], [10], [15], [20], [25], [26], [27], [36], [40], [51], [54], [57], [64], [67], [73], [79], [82], [84], [87], [116], [125], [129], [133], [142], [146], [148], [150], [152], [156], [165], [171], [179], [182], [185], [262], [274], [276], [285], [289], [293], [902], [903], [906], [912], [926], [938], [950], [962], [974], [986], [998], [1010], [1019], [1021], [1138], [1166], [1169], [1172], [1193], [1202], [1206], [1208], [1210], [1216], [1227], [1239], [1243], [1248], [1263], [1275], [1287], [1299], [1311], [1313], [1316], [1451], [1452], [1454], [1455], [1456], [1457], [1464], [1466], [1467], [1468], [1470], [1474] [2019-09-10 03:16:30,451 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:16:30,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:16:30,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:16:30,526 INFO L272 AbstractInterpreter]: Visited 56 different actions 90 times. Merged at 8 different actions 8 times. Never widened. Performed 715 root evaluator evaluations with a maximum evaluation depth of 4. Performed 715 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 102 variables. [2019-09-10 03:16:30,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:30,527 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:16:30,634 INFO L227 lantSequenceWeakener]: Weakened 71 states. On average, predicates are now at 88.71% of their original sizes. [2019-09-10 03:16:30,635 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:16:30,989 INFO L420 sIntCurrentIteration]: We unified 106 AI predicates to 106 [2019-09-10 03:16:30,990 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:16:30,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:16:30,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [8] total 33 [2019-09-10 03:16:30,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:16:30,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 03:16:30,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 03:16:30,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:16:30,992 INFO L87 Difference]: Start difference. First operand 31668 states and 147285 transitions. Second operand 27 states. [2019-09-10 03:16:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:16:36,353 INFO L93 Difference]: Finished difference Result 27566 states and 93247 transitions. [2019-09-10 03:16:36,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:16:36,353 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2019-09-10 03:16:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:16:36,590 INFO L225 Difference]: With dead ends: 27566 [2019-09-10 03:16:36,590 INFO L226 Difference]: Without dead ends: 27566 [2019-09-10 03:16:36,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=1244, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 03:16:36,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27566 states. [2019-09-10 03:16:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27566 to 27555. [2019-09-10 03:16:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27555 states. [2019-09-10 03:16:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27555 states to 27555 states and 93235 transitions. [2019-09-10 03:16:45,681 INFO L78 Accepts]: Start accepts. Automaton has 27555 states and 93235 transitions. Word has length 107 [2019-09-10 03:16:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:16:45,681 INFO L475 AbstractCegarLoop]: Abstraction has 27555 states and 93235 transitions. [2019-09-10 03:16:45,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 03:16:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 27555 states and 93235 transitions. [2019-09-10 03:16:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 03:16:45,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:16:45,721 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:16:45,722 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:16:45,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:45,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1824537566, now seen corresponding path program 1 times [2019-09-10 03:16:45,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:16:45,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:45,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:16:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:16:45,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:16:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:16:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:16:45,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:16:45,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:16:45,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 03:16:45,819 INFO L207 CegarAbsIntRunner]: [25], [26], [27], [36], [40], [51], [54], [73], [79], [82], [84], [89], [94], [97], [116], [125], [129], [131], [133], [142], [148], [156], [165], [171], [179], [190], [202], [214], [226], [238], [250], [262], [274], [276], [285], [289], [291], [293], [295], [299], [310], [322], [326], [331], [346], [358], [370], [382], [394], [396], [402], [404], [415], [427], [431], [436], [451], [463], [475], [487], [499], [501], [505], [514], [518], [522], [531], [537], [545], [554], [560], [568], [579], [591], [595], [600], [615], [627], [639], [651], [663], [665], [674], [680], [688], [699], [711], [715], [720], [735], [747], [759], [771], [783], [785], [791], [793], [804], [816], [820], [825], [840], [852], [864], [876], [888], [890], [893], [902], [903], [906], [912], [926], [938], [950], [962], [974], [986], [998], [1010], [1019], [1021], [1138], [1166], [1454], [1455], [1462], [1464], [1466], [1467], [1468], [1470] [2019-09-10 03:16:45,831 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:16:45,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:16:45,862 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:16:45,863 INFO L272 AbstractInterpreter]: Visited 57 different actions 57 times. Never merged. Never widened. Performed 388 root evaluator evaluations with a maximum evaluation depth of 3. Performed 388 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 102 variables. [2019-09-10 03:16:45,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:16:45,863 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:16:45,977 INFO L227 lantSequenceWeakener]: Weakened 63 states. On average, predicates are now at 86.43% of their original sizes. [2019-09-10 03:16:45,977 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:16:46,287 INFO L420 sIntCurrentIteration]: We unified 139 AI predicates to 139 [2019-09-10 03:16:46,287 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:16:46,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:16:46,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [7] total 26 [2019-09-10 03:16:46,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:16:46,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 03:16:46,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 03:16:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:16:46,291 INFO L87 Difference]: Start difference. First operand 27555 states and 93235 transitions. Second operand 21 states. [2019-09-10 03:16:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:16:54,682 INFO L93 Difference]: Finished difference Result 50005 states and 219805 transitions. [2019-09-10 03:16:54,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:16:54,682 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 140 [2019-09-10 03:16:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:16:55,182 INFO L225 Difference]: With dead ends: 50005 [2019-09-10 03:16:55,183 INFO L226 Difference]: Without dead ends: 50005 [2019-09-10 03:16:55,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:16:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50005 states. [2019-09-10 03:17:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50005 to 49785. [2019-09-10 03:17:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49785 states. [2019-09-10 03:17:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49785 states to 49785 states and 219586 transitions. [2019-09-10 03:17:20,002 INFO L78 Accepts]: Start accepts. Automaton has 49785 states and 219586 transitions. Word has length 140 [2019-09-10 03:17:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:17:20,002 INFO L475 AbstractCegarLoop]: Abstraction has 49785 states and 219586 transitions. [2019-09-10 03:17:20,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 03:17:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 49785 states and 219586 transitions. [2019-09-10 03:17:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 03:17:20,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:17:20,026 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:17:20,026 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:17:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:17:20,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1975323071, now seen corresponding path program 1 times [2019-09-10 03:17:20,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:17:20,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:17:20,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:17:20,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:17:20,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:17:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:17:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:17:20,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:17:20,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:17:20,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:17:20,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:17:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:17:20,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:17:20,170 INFO L87 Difference]: Start difference. First operand 49785 states and 219586 transitions. Second operand 9 states. [2019-09-10 03:18:04,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:18:04,653 INFO L93 Difference]: Finished difference Result 113446 states and 1437154 transitions. [2019-09-10 03:18:04,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 03:18:04,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-09-10 03:18:04,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:18:17,091 INFO L225 Difference]: With dead ends: 113446 [2019-09-10 03:18:17,091 INFO L226 Difference]: Without dead ends: 113446 [2019-09-10 03:18:17,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=508, Invalid=2572, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 03:18:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113446 states. [2019-09-10 03:20:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113446 to 106028. [2019-09-10 03:20:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106028 states. [2019-09-10 03:20:42,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106028 states to 106028 states and 1212891 transitions. [2019-09-10 03:20:42,461 INFO L78 Accepts]: Start accepts. Automaton has 106028 states and 1212891 transitions. Word has length 150 [2019-09-10 03:20:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:20:42,461 INFO L475 AbstractCegarLoop]: Abstraction has 106028 states and 1212891 transitions. [2019-09-10 03:20:42,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:20:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 106028 states and 1212891 transitions. [2019-09-10 03:20:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 03:20:42,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:20:42,484 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:20:42,484 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:20:42,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:20:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1368121503, now seen corresponding path program 1 times [2019-09-10 03:20:42,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:20:42,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:42,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:20:42,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:20:42,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:20:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:20:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:20:42,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:20:42,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:20:42,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:20:42,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:20:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:20:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:20:42,555 INFO L87 Difference]: Start difference. First operand 106028 states and 1212891 transitions. Second operand 4 states.