java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:07:20,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:07:20,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:07:20,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:07:20,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:07:20,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:07:20,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:07:20,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:07:20,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:07:20,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:07:20,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:07:20,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:07:20,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:07:20,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:07:20,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:07:20,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:07:20,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:07:20,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:07:20,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:07:20,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:07:20,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:07:21,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:07:21,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:07:21,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:07:21,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:07:21,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:07:21,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:07:21,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:07:21,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:07:21,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:07:21,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:07:21,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:07:21,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:07:21,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:07:21,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:07:21,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:07:21,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:07:21,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:07:21,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:07:21,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:07:21,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:07:21,016 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 06:07:21,033 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:07:21,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:07:21,034 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:07:21,034 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:07:21,037 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:07:21,037 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:07:21,037 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:07:21,038 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:07:21,038 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:07:21,038 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:07:21,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:07:21,041 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:07:21,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:07:21,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:07:21,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:07:21,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:07:21,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:07:21,042 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:07:21,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:07:21,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:07:21,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:07:21,043 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:07:21,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:07:21,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:07:21,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:07:21,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:07:21,045 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:07:21,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:07:21,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:07:21,045 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:07:21,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:07:21,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:07:21,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:07:21,108 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:07:21,108 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:07:21,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:07:21,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e66cc156/8f2d248c04b14e84a891aa9468cea5ba/FLAGae3872442 [2019-09-10 06:07:21,701 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:07:21,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:07:21,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e66cc156/8f2d248c04b14e84a891aa9468cea5ba/FLAGae3872442 [2019-09-10 06:07:22,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e66cc156/8f2d248c04b14e84a891aa9468cea5ba [2019-09-10 06:07:22,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:07:22,011 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:07:22,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:07:22,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:07:22,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:07:22,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:07:22" (1/1) ... [2019-09-10 06:07:22,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3c99dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22, skipping insertion in model container [2019-09-10 06:07:22,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:07:22" (1/1) ... [2019-09-10 06:07:22,027 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:07:22,072 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:07:22,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:07:22,491 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:07:22,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:07:22,608 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:07:22,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22 WrapperNode [2019-09-10 06:07:22,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:07:22,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:07:22,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:07:22,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:07:22,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22" (1/1) ... [2019-09-10 06:07:22,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22" (1/1) ... [2019-09-10 06:07:22,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22" (1/1) ... [2019-09-10 06:07:22,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22" (1/1) ... [2019-09-10 06:07:22,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22" (1/1) ... [2019-09-10 06:07:22,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22" (1/1) ... [2019-09-10 06:07:22,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22" (1/1) ... [2019-09-10 06:07:22,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:07:22,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:07:22,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:07:22,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:07:22,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07: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 06:07:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:07:22,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:07:22,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:07:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:07:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:07:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:07:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:07:22,733 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:07:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:07:22,734 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:07:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:07:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:07:22,735 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:07:22,736 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:07:22,736 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:07:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:07:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:07:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:07:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:07:23,547 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:07:23,547 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:07:23,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:07:23 BoogieIcfgContainer [2019-09-10 06:07:23,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:07:23,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:07:23,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:07:23,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:07:23,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:07:22" (1/3) ... [2019-09-10 06:07:23,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4226870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:07:23, skipping insertion in model container [2019-09-10 06:07:23,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:07:22" (2/3) ... [2019-09-10 06:07:23,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4226870a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:07:23, skipping insertion in model container [2019-09-10 06:07:23,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:07:23" (3/3) ... [2019-09-10 06:07:23,557 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:07:23,568 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:07:23,577 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:07:23,595 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:07:23,622 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:07:23,622 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:07:23,622 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:07:23,622 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:07:23,623 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:07:23,623 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:07:23,623 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:07:23,623 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:07:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-09-10 06:07:23,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 06:07:23,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:23,656 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] [2019-09-10 06:07:23,659 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:23,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:23,663 INFO L82 PathProgramCache]: Analyzing trace with hash -940649787, now seen corresponding path program 1 times [2019-09-10 06:07:23,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:23,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:23,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:23,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:23,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:24,121 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 06:07:24,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:24,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:24,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:24,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:24,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:24,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:24,181 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 3 states. [2019-09-10 06:07:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:24,336 INFO L93 Difference]: Finished difference Result 223 states and 367 transitions. [2019-09-10 06:07:24,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:24,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 06:07:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:24,363 INFO L225 Difference]: With dead ends: 223 [2019-09-10 06:07:24,363 INFO L226 Difference]: Without dead ends: 215 [2019-09-10 06:07:24,367 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 06:07:24,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-10 06:07:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-09-10 06:07:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-10 06:07:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 331 transitions. [2019-09-10 06:07:24,462 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 331 transitions. Word has length 60 [2019-09-10 06:07:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:24,463 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 331 transitions. [2019-09-10 06:07:24,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 331 transitions. [2019-09-10 06:07:24,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 06:07:24,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:24,471 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] [2019-09-10 06:07:24,472 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:24,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:24,472 INFO L82 PathProgramCache]: Analyzing trace with hash -662873070, now seen corresponding path program 1 times [2019-09-10 06:07:24,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:24,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:24,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:24,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:24,631 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 06:07:24,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:24,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:24,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:24,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:24,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:24,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:24,636 INFO L87 Difference]: Start difference. First operand 212 states and 331 transitions. Second operand 3 states. [2019-09-10 06:07:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:24,695 INFO L93 Difference]: Finished difference Result 352 states and 556 transitions. [2019-09-10 06:07:24,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:24,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-10 06:07:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:24,701 INFO L225 Difference]: With dead ends: 352 [2019-09-10 06:07:24,701 INFO L226 Difference]: Without dead ends: 352 [2019-09-10 06:07:24,702 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 06:07:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-10 06:07:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-09-10 06:07:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-10 06:07:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 553 transitions. [2019-09-10 06:07:24,723 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 553 transitions. Word has length 62 [2019-09-10 06:07:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:24,724 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 553 transitions. [2019-09-10 06:07:24,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 553 transitions. [2019-09-10 06:07:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-10 06:07:24,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:24,727 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] [2019-09-10 06:07:24,727 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 443916901, now seen corresponding path program 1 times [2019-09-10 06:07:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:24,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:24,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:24,851 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 06:07:24,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:24,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:24,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:24,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:24,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:24,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:24,853 INFO L87 Difference]: Start difference. First operand 348 states and 553 transitions. Second operand 3 states. [2019-09-10 06:07:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:24,893 INFO L93 Difference]: Finished difference Result 610 states and 970 transitions. [2019-09-10 06:07:24,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:24,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-10 06:07:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:24,900 INFO L225 Difference]: With dead ends: 610 [2019-09-10 06:07:24,900 INFO L226 Difference]: Without dead ends: 610 [2019-09-10 06:07:24,900 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 06:07:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-09-10 06:07:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 604. [2019-09-10 06:07:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-10 06:07:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 965 transitions. [2019-09-10 06:07:24,944 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 965 transitions. Word has length 64 [2019-09-10 06:07:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:24,946 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 965 transitions. [2019-09-10 06:07:24,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 965 transitions. [2019-09-10 06:07:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 06:07:24,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:24,952 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] [2019-09-10 06:07:24,952 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:24,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1638426254, now seen corresponding path program 1 times [2019-09-10 06:07:24,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:24,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:24,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:24,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:24,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:25,191 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 06:07:25,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:25,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:07:25,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:25,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:07:25,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:07:25,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:07:25,194 INFO L87 Difference]: Start difference. First operand 604 states and 965 transitions. Second operand 5 states. [2019-09-10 06:07:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:25,407 INFO L93 Difference]: Finished difference Result 1752 states and 2851 transitions. [2019-09-10 06:07:25,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:07:25,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-10 06:07:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:25,422 INFO L225 Difference]: With dead ends: 1752 [2019-09-10 06:07:25,423 INFO L226 Difference]: Without dead ends: 1752 [2019-09-10 06:07:25,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:07:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-09-10 06:07:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1308. [2019-09-10 06:07:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-09-10 06:07:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2128 transitions. [2019-09-10 06:07:25,504 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2128 transitions. Word has length 66 [2019-09-10 06:07:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:25,507 INFO L475 AbstractCegarLoop]: Abstraction has 1308 states and 2128 transitions. [2019-09-10 06:07:25,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:07:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2128 transitions. [2019-09-10 06:07:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 06:07:25,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:25,510 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] [2019-09-10 06:07:25,511 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 686783218, now seen corresponding path program 1 times [2019-09-10 06:07:25,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:25,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:25,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:25,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:25,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:25,639 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 06:07:25,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:25,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:07:25,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:25,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:07:25,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:07:25,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:07:25,642 INFO L87 Difference]: Start difference. First operand 1308 states and 2128 transitions. Second operand 4 states. [2019-09-10 06:07:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:25,734 INFO L93 Difference]: Finished difference Result 1831 states and 2985 transitions. [2019-09-10 06:07:25,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:07:25,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-10 06:07:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:25,746 INFO L225 Difference]: With dead ends: 1831 [2019-09-10 06:07:25,746 INFO L226 Difference]: Without dead ends: 1831 [2019-09-10 06:07:25,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:07:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-09-10 06:07:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1820. [2019-09-10 06:07:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-09-10 06:07:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2969 transitions. [2019-09-10 06:07:25,799 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2969 transitions. Word has length 67 [2019-09-10 06:07:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:25,800 INFO L475 AbstractCegarLoop]: Abstraction has 1820 states and 2969 transitions. [2019-09-10 06:07:25,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:07:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2969 transitions. [2019-09-10 06:07:25,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 06:07:25,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:25,803 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] [2019-09-10 06:07:25,803 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -241609159, now seen corresponding path program 1 times [2019-09-10 06:07:25,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:25,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:25,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:25,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:25,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:25,904 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 06:07:25,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:25,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:07:25,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:25,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:07:25,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:07:25,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:07:25,907 INFO L87 Difference]: Start difference. First operand 1820 states and 2969 transitions. Second operand 7 states. [2019-09-10 06:07:26,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:26,196 INFO L93 Difference]: Finished difference Result 4956 states and 8021 transitions. [2019-09-10 06:07:26,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:07:26,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-10 06:07:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:26,225 INFO L225 Difference]: With dead ends: 4956 [2019-09-10 06:07:26,225 INFO L226 Difference]: Without dead ends: 4956 [2019-09-10 06:07:26,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:07:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2019-09-10 06:07:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4821. [2019-09-10 06:07:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4821 states. [2019-09-10 06:07:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4821 states to 4821 states and 7832 transitions. [2019-09-10 06:07:26,413 INFO L78 Accepts]: Start accepts. Automaton has 4821 states and 7832 transitions. Word has length 68 [2019-09-10 06:07:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:26,415 INFO L475 AbstractCegarLoop]: Abstraction has 4821 states and 7832 transitions. [2019-09-10 06:07:26,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:07:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4821 states and 7832 transitions. [2019-09-10 06:07:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:07:26,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:26,426 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] [2019-09-10 06:07:26,427 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:26,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:26,433 INFO L82 PathProgramCache]: Analyzing trace with hash 464144953, now seen corresponding path program 1 times [2019-09-10 06:07:26,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:26,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:26,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:26,502 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 06:07:26,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:26,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:26,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:26,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:26,505 INFO L87 Difference]: Start difference. First operand 4821 states and 7832 transitions. Second operand 3 states. [2019-09-10 06:07:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:26,572 INFO L93 Difference]: Finished difference Result 7000 states and 11319 transitions. [2019-09-10 06:07:26,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:26,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:07:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:26,617 INFO L225 Difference]: With dead ends: 7000 [2019-09-10 06:07:26,618 INFO L226 Difference]: Without dead ends: 7000 [2019-09-10 06:07:26,619 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 06:07:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7000 states. [2019-09-10 06:07:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7000 to 6998. [2019-09-10 06:07:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6998 states. [2019-09-10 06:07:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 11318 transitions. [2019-09-10 06:07:26,839 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 11318 transitions. Word has length 69 [2019-09-10 06:07:26,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:26,839 INFO L475 AbstractCegarLoop]: Abstraction has 6998 states and 11318 transitions. [2019-09-10 06:07:26,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 11318 transitions. [2019-09-10 06:07:26,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:07:26,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:26,841 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] [2019-09-10 06:07:26,842 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:26,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2123298740, now seen corresponding path program 1 times [2019-09-10 06:07:26,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:26,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:26,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:26,907 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 06:07:26,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:26,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:26,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:26,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:26,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:26,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:26,910 INFO L87 Difference]: Start difference. First operand 6998 states and 11318 transitions. Second operand 3 states. [2019-09-10 06:07:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:27,029 INFO L93 Difference]: Finished difference Result 9390 states and 15147 transitions. [2019-09-10 06:07:27,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:27,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:07:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:27,084 INFO L225 Difference]: With dead ends: 9390 [2019-09-10 06:07:27,085 INFO L226 Difference]: Without dead ends: 9390 [2019-09-10 06:07:27,085 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 06:07:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9390 states. [2019-09-10 06:07:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9390 to 9388. [2019-09-10 06:07:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9388 states. [2019-09-10 06:07:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9388 states to 9388 states and 15146 transitions. [2019-09-10 06:07:27,302 INFO L78 Accepts]: Start accepts. Automaton has 9388 states and 15146 transitions. Word has length 69 [2019-09-10 06:07:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:27,303 INFO L475 AbstractCegarLoop]: Abstraction has 9388 states and 15146 transitions. [2019-09-10 06:07:27,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 9388 states and 15146 transitions. [2019-09-10 06:07:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:07:27,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:07:27,305 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:27,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:27,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1047556249, now seen corresponding path program 1 times [2019-09-10 06:07:27,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:27,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:27,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:27,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:27,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:27,375 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 06:07:27,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:27,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:07:27,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:27,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:07:27,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:07:27,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:07:27,377 INFO L87 Difference]: Start difference. First operand 9388 states and 15146 transitions. Second operand 4 states. [2019-09-10 06:07:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:27,580 INFO L93 Difference]: Finished difference Result 20162 states and 32626 transitions. [2019-09-10 06:07:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:07:27,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-10 06:07:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:27,634 INFO L225 Difference]: With dead ends: 20162 [2019-09-10 06:07:27,634 INFO L226 Difference]: Without dead ends: 20162 [2019-09-10 06:07:27,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:07:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20162 states. [2019-09-10 06:07:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20162 to 14722. [2019-09-10 06:07:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14722 states. [2019-09-10 06:07:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14722 states to 14722 states and 23738 transitions. [2019-09-10 06:07:28,074 INFO L78 Accepts]: Start accepts. Automaton has 14722 states and 23738 transitions. Word has length 69 [2019-09-10 06:07:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:28,074 INFO L475 AbstractCegarLoop]: Abstraction has 14722 states and 23738 transitions. [2019-09-10 06:07:28,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:07:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 14722 states and 23738 transitions. [2019-09-10 06:07:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 06:07:28,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:28,076 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] [2019-09-10 06:07:28,076 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:28,077 INFO L82 PathProgramCache]: Analyzing trace with hash 233645337, now seen corresponding path program 1 times [2019-09-10 06:07:28,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:28,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:28,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:28,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:28,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:28,139 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 06:07:28,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:28,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:28,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:28,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:28,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:28,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:28,142 INFO L87 Difference]: Start difference. First operand 14722 states and 23738 transitions. Second operand 3 states. [2019-09-10 06:07:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:28,237 INFO L93 Difference]: Finished difference Result 21110 states and 34020 transitions. [2019-09-10 06:07:28,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:28,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-09-10 06:07:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:28,308 INFO L225 Difference]: With dead ends: 21110 [2019-09-10 06:07:28,308 INFO L226 Difference]: Without dead ends: 21110 [2019-09-10 06:07:28,309 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 06:07:28,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21110 states. [2019-09-10 06:07:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21110 to 21108. [2019-09-10 06:07:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21108 states. [2019-09-10 06:07:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21108 states to 21108 states and 34019 transitions. [2019-09-10 06:07:28,946 INFO L78 Accepts]: Start accepts. Automaton has 21108 states and 34019 transitions. Word has length 69 [2019-09-10 06:07:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:28,947 INFO L475 AbstractCegarLoop]: Abstraction has 21108 states and 34019 transitions. [2019-09-10 06:07:28,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 21108 states and 34019 transitions. [2019-09-10 06:07:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 06:07:28,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:28,948 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] [2019-09-10 06:07:28,948 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 189572521, now seen corresponding path program 1 times [2019-09-10 06:07:28,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:28,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:28,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:29,122 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 06:07:29,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:29,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:07:29,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:29,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:07:29,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:07:29,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:07:29,124 INFO L87 Difference]: Start difference. First operand 21108 states and 34019 transitions. Second operand 5 states. [2019-09-10 06:07:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:29,386 INFO L93 Difference]: Finished difference Result 32666 states and 52575 transitions. [2019-09-10 06:07:29,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:07:29,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 06:07:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:29,496 INFO L225 Difference]: With dead ends: 32666 [2019-09-10 06:07:29,496 INFO L226 Difference]: Without dead ends: 32666 [2019-09-10 06:07:29,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:07:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32666 states. [2019-09-10 06:07:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32666 to 30858. [2019-09-10 06:07:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30858 states. [2019-09-10 06:07:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30858 states to 30858 states and 49584 transitions. [2019-09-10 06:07:30,906 INFO L78 Accepts]: Start accepts. Automaton has 30858 states and 49584 transitions. Word has length 71 [2019-09-10 06:07:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:30,907 INFO L475 AbstractCegarLoop]: Abstraction has 30858 states and 49584 transitions. [2019-09-10 06:07:30,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:07:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 30858 states and 49584 transitions. [2019-09-10 06:07:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 06:07:30,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:30,908 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] [2019-09-10 06:07:30,908 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:30,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:30,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1918442634, now seen corresponding path program 1 times [2019-09-10 06:07:30,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:30,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:30,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:31,082 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 06:07:31,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:31,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:07:31,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:31,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:07:31,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:07:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:07:31,085 INFO L87 Difference]: Start difference. First operand 30858 states and 49584 transitions. Second operand 5 states. [2019-09-10 06:07:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:31,656 INFO L93 Difference]: Finished difference Result 55359 states and 88440 transitions. [2019-09-10 06:07:31,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:07:31,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-10 06:07:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:31,814 INFO L225 Difference]: With dead ends: 55359 [2019-09-10 06:07:31,815 INFO L226 Difference]: Without dead ends: 55359 [2019-09-10 06:07:31,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:07:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55359 states. [2019-09-10 06:07:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55359 to 55357. [2019-09-10 06:07:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55357 states. [2019-09-10 06:07:32,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55357 states to 55357 states and 88439 transitions. [2019-09-10 06:07:32,962 INFO L78 Accepts]: Start accepts. Automaton has 55357 states and 88439 transitions. Word has length 74 [2019-09-10 06:07:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:32,962 INFO L475 AbstractCegarLoop]: Abstraction has 55357 states and 88439 transitions. [2019-09-10 06:07:32,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:07:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 55357 states and 88439 transitions. [2019-09-10 06:07:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 06:07:32,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:32,965 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] [2019-09-10 06:07:32,965 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:32,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash -659729786, now seen corresponding path program 1 times [2019-09-10 06:07:32,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:32,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:32,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:33,090 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 06:07:33,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:33,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:07:33,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:33,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:07:33,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:07:33,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:07:33,092 INFO L87 Difference]: Start difference. First operand 55357 states and 88439 transitions. Second operand 5 states. [2019-09-10 06:07:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:33,392 INFO L93 Difference]: Finished difference Result 95254 states and 150636 transitions. [2019-09-10 06:07:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:07:33,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 06:07:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:33,671 INFO L225 Difference]: With dead ends: 95254 [2019-09-10 06:07:33,672 INFO L226 Difference]: Without dead ends: 95254 [2019-09-10 06:07:33,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:07:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95254 states. [2019-09-10 06:07:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95254 to 56769. [2019-09-10 06:07:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56769 states. [2019-09-10 06:07:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56769 states to 56769 states and 89836 transitions. [2019-09-10 06:07:36,020 INFO L78 Accepts]: Start accepts. Automaton has 56769 states and 89836 transitions. Word has length 75 [2019-09-10 06:07:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:36,021 INFO L475 AbstractCegarLoop]: Abstraction has 56769 states and 89836 transitions. [2019-09-10 06:07:36,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:07:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 56769 states and 89836 transitions. [2019-09-10 06:07:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:07:36,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:36,024 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-10 06:07:36,024 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -242897637, now seen corresponding path program 1 times [2019-09-10 06:07:36,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:36,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:36,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:07:36,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:36,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:36,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:36,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:36,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:36,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:36,128 INFO L87 Difference]: Start difference. First operand 56769 states and 89836 transitions. Second operand 3 states. [2019-09-10 06:07:36,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:36,514 INFO L93 Difference]: Finished difference Result 46798 states and 74221 transitions. [2019-09-10 06:07:36,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:36,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:07:36,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:36,596 INFO L225 Difference]: With dead ends: 46798 [2019-09-10 06:07:36,596 INFO L226 Difference]: Without dead ends: 46798 [2019-09-10 06:07:36,598 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 06:07:36,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46798 states. [2019-09-10 06:07:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46798 to 46796. [2019-09-10 06:07:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46796 states. [2019-09-10 06:07:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46796 states to 46796 states and 74220 transitions. [2019-09-10 06:07:37,193 INFO L78 Accepts]: Start accepts. Automaton has 46796 states and 74220 transitions. Word has length 97 [2019-09-10 06:07:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:37,193 INFO L475 AbstractCegarLoop]: Abstraction has 46796 states and 74220 transitions. [2019-09-10 06:07:37,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 46796 states and 74220 transitions. [2019-09-10 06:07:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 06:07:37,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:37,196 INFO L399 BasicCegarLoop]: trace histogram [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, 1] [2019-09-10 06:07:37,196 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:37,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:37,197 INFO L82 PathProgramCache]: Analyzing trace with hash -473397253, now seen corresponding path program 1 times [2019-09-10 06:07:37,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:37,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:37,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:37,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:37,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:07:37,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:37,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:37,268 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:37,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:37,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:37,269 INFO L87 Difference]: Start difference. First operand 46796 states and 74220 transitions. Second operand 3 states. [2019-09-10 06:07:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:38,483 INFO L93 Difference]: Finished difference Result 93480 states and 148020 transitions. [2019-09-10 06:07:38,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:38,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-10 06:07:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:38,619 INFO L225 Difference]: With dead ends: 93480 [2019-09-10 06:07:38,619 INFO L226 Difference]: Without dead ends: 93480 [2019-09-10 06:07:38,619 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 06:07:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93480 states. [2019-09-10 06:07:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93480 to 93354. [2019-09-10 06:07:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93354 states. [2019-09-10 06:07:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93354 states to 93354 states and 147895 transitions. [2019-09-10 06:07:39,941 INFO L78 Accepts]: Start accepts. Automaton has 93354 states and 147895 transitions. Word has length 97 [2019-09-10 06:07:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:39,942 INFO L475 AbstractCegarLoop]: Abstraction has 93354 states and 147895 transitions. [2019-09-10 06:07:39,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 93354 states and 147895 transitions. [2019-09-10 06:07:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:07:39,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:39,945 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-09-10 06:07:39,945 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash 390120194, now seen corresponding path program 1 times [2019-09-10 06:07:39,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:39,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:39,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:39,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:39,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:07:40,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:40,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:40,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:40,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:40,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:40,027 INFO L87 Difference]: Start difference. First operand 93354 states and 147895 transitions. Second operand 3 states. [2019-09-10 06:07:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:40,488 INFO L93 Difference]: Finished difference Result 181173 states and 284895 transitions. [2019-09-10 06:07:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:40,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:07:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:40,772 INFO L225 Difference]: With dead ends: 181173 [2019-09-10 06:07:40,772 INFO L226 Difference]: Without dead ends: 181173 [2019-09-10 06:07:40,773 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 06:07:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181173 states. [2019-09-10 06:07:44,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181173 to 181171. [2019-09-10 06:07:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181171 states. [2019-09-10 06:07:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181171 states to 181171 states and 284894 transitions. [2019-09-10 06:07:45,271 INFO L78 Accepts]: Start accepts. Automaton has 181171 states and 284894 transitions. Word has length 98 [2019-09-10 06:07:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:45,272 INFO L475 AbstractCegarLoop]: Abstraction has 181171 states and 284894 transitions. [2019-09-10 06:07:45,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 181171 states and 284894 transitions. [2019-09-10 06:07:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 06:07:45,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:45,276 INFO L399 BasicCegarLoop]: trace histogram [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 06:07:45,276 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:45,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1614999632, now seen corresponding path program 1 times [2019-09-10 06:07:45,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:45,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:45,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:45,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:45,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:45,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:07:45,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:45,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:45,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:45,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:45,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:45,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:45,356 INFO L87 Difference]: Start difference. First operand 181171 states and 284894 transitions. Second operand 3 states. [2019-09-10 06:07:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:45,567 INFO L93 Difference]: Finished difference Result 80017 states and 125241 transitions. [2019-09-10 06:07:45,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:45,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 06:07:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:45,661 INFO L225 Difference]: With dead ends: 80017 [2019-09-10 06:07:45,662 INFO L226 Difference]: Without dead ends: 80017 [2019-09-10 06:07:45,662 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 06:07:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80017 states. [2019-09-10 06:07:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80017 to 80015. [2019-09-10 06:07:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80015 states. [2019-09-10 06:07:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80015 states to 80015 states and 125240 transitions. [2019-09-10 06:07:49,404 INFO L78 Accepts]: Start accepts. Automaton has 80015 states and 125240 transitions. Word has length 98 [2019-09-10 06:07:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:49,404 INFO L475 AbstractCegarLoop]: Abstraction has 80015 states and 125240 transitions. [2019-09-10 06:07:49,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 80015 states and 125240 transitions. [2019-09-10 06:07:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 06:07:49,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:49,407 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:07:49,407 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:49,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:49,408 INFO L82 PathProgramCache]: Analyzing trace with hash -680214214, now seen corresponding path program 1 times [2019-09-10 06:07:49,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:49,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:49,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:49,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:49,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:07:49,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:49,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:07:49,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:49,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:07:49,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:07:49,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:07:49,518 INFO L87 Difference]: Start difference. First operand 80015 states and 125240 transitions. Second operand 5 states. [2019-09-10 06:07:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:50,023 INFO L93 Difference]: Finished difference Result 101695 states and 158849 transitions. [2019-09-10 06:07:50,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:07:50,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 06:07:50,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:50,224 INFO L225 Difference]: With dead ends: 101695 [2019-09-10 06:07:50,225 INFO L226 Difference]: Without dead ends: 101695 [2019-09-10 06:07:50,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:07:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101695 states. [2019-09-10 06:07:51,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101695 to 100953. [2019-09-10 06:07:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100953 states. [2019-09-10 06:07:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100953 states to 100953 states and 157862 transitions. [2019-09-10 06:07:51,912 INFO L78 Accepts]: Start accepts. Automaton has 100953 states and 157862 transitions. Word has length 99 [2019-09-10 06:07:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:51,913 INFO L475 AbstractCegarLoop]: Abstraction has 100953 states and 157862 transitions. [2019-09-10 06:07:51,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:07:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 100953 states and 157862 transitions. [2019-09-10 06:07:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:07:51,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:51,915 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] [2019-09-10 06:07:51,915 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:51,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash -317647174, now seen corresponding path program 1 times [2019-09-10 06:07:51,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:51,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:51,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:51,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:51,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:07:52,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:07:52,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:07:52,019 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 06:07:52,021 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [140], [143], [145], [149], [154], [176], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [278], [296], [299], [324], [332], [340], [346], [350], [354], [356], [358], [361], [386], [394], [402], [412], [416], [418], [420], [423], [448], [456], [464], [575], [576], [580], [581], [582] [2019-09-10 06:07:52,066 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:07:52,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:07:52,216 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:07:52,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:07:52,618 INFO L272 AbstractInterpreter]: Visited 92 different actions 322 times. Merged at 46 different actions 211 times. Widened at 17 different actions 29 times. Performed 976 root evaluator evaluations with a maximum evaluation depth of 5. Performed 976 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 14 fixpoints after 8 different actions. Largest state had 159 variables. [2019-09-10 06:07:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:52,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:07:52,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:07:52,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:07:52,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:52,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:07:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:52,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 06:07:52,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:07:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:07:52,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:07:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:07:52,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:07:52,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2019-09-10 06:07:52,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:52,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:07:52,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:07:52,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:07:52,946 INFO L87 Difference]: Start difference. First operand 100953 states and 157862 transitions. Second operand 4 states. [2019-09-10 06:07:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:53,413 INFO L93 Difference]: Finished difference Result 100955 states and 156887 transitions. [2019-09-10 06:07:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:07:53,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-10 06:07:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:53,919 INFO L225 Difference]: With dead ends: 100955 [2019-09-10 06:07:53,919 INFO L226 Difference]: Without dead ends: 100955 [2019-09-10 06:07:53,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:07:54,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100955 states. [2019-09-10 06:07:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100955 to 54955. [2019-09-10 06:07:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54955 states. [2019-09-10 06:07:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54955 states to 54955 states and 85516 transitions. [2019-09-10 06:07:55,688 INFO L78 Accepts]: Start accepts. Automaton has 54955 states and 85516 transitions. Word has length 100 [2019-09-10 06:07:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:55,688 INFO L475 AbstractCegarLoop]: Abstraction has 54955 states and 85516 transitions. [2019-09-10 06:07:55,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:07:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54955 states and 85516 transitions. [2019-09-10 06:07:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 06:07:55,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:55,691 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:07:55,692 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:55,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:55,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1540255698, now seen corresponding path program 1 times [2019-09-10 06:07:55,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:55,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:55,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:55,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:55,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:55,759 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 06:07:55,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:07:55,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:07:55,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:55,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:07:55,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:07:55,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:07:55,761 INFO L87 Difference]: Start difference. First operand 54955 states and 85516 transitions. Second operand 3 states. [2019-09-10 06:07:56,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:56,352 INFO L93 Difference]: Finished difference Result 106936 states and 165103 transitions. [2019-09-10 06:07:56,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:07:56,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 06:07:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:56,564 INFO L225 Difference]: With dead ends: 106936 [2019-09-10 06:07:56,564 INFO L226 Difference]: Without dead ends: 106936 [2019-09-10 06:07:56,565 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 06:07:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106936 states. [2019-09-10 06:07:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106936 to 106934. [2019-09-10 06:07:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106934 states. [2019-09-10 06:07:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106934 states to 106934 states and 165102 transitions. [2019-09-10 06:07:57,850 INFO L78 Accepts]: Start accepts. Automaton has 106934 states and 165102 transitions. Word has length 100 [2019-09-10 06:07:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:07:57,850 INFO L475 AbstractCegarLoop]: Abstraction has 106934 states and 165102 transitions. [2019-09-10 06:07:57,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:07:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 106934 states and 165102 transitions. [2019-09-10 06:07:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:07:57,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:07:57,854 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:07:57,855 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:07:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:57,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1045071639, now seen corresponding path program 1 times [2019-09-10 06:07:57,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:07:57,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:57,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:57,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:07:57,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:07:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:07:57,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:07:57,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:07:57,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 102 with the following transitions: [2019-09-10 06:07:57,958 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [145], [149], [154], [176], [180], [185], [202], [205], [207], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [288], [292], [294], [296], [299], [324], [332], [340], [346], [350], [354], [356], [358], [361], [386], [394], [402], [408], [412], [416], [418], [420], [423], [448], [456], [464], [575], [576], [580], [581], [582] [2019-09-10 06:07:57,963 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:07:57,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:07:58,014 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:07:58,345 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:07:58,345 INFO L272 AbstractInterpreter]: Visited 99 different actions 409 times. Merged at 53 different actions 282 times. Widened at 19 different actions 45 times. Performed 1216 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 9 different actions. Largest state had 159 variables. [2019-09-10 06:07:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:07:58,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:07:58,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:07:58,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:07:58,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:07:58,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:07:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:07:58,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:07:58,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:07:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:07:58,571 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:07:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream Closed [2019-09-10 06:07:58,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 06:07:58,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 06:07:58,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:07:58,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:07:58,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:07:58,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:07:58,633 INFO L87 Difference]: Start difference. First operand 106934 states and 165102 transitions. Second operand 5 states. [2019-09-10 06:07:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:07:59,308 INFO L93 Difference]: Finished difference Result 106938 states and 164944 transitions. [2019-09-10 06:07:59,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:07:59,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 06:07:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:07:59,493 INFO L225 Difference]: With dead ends: 106938 [2019-09-10 06:07:59,493 INFO L226 Difference]: Without dead ends: 106938 [2019-09-10 06:07:59,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:07:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106938 states. [2019-09-10 06:08:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106938 to 106934. [2019-09-10 06:08:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106934 states. [2019-09-10 06:08:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106934 states to 106934 states and 164942 transitions. [2019-09-10 06:08:00,601 INFO L78 Accepts]: Start accepts. Automaton has 106934 states and 164942 transitions. Word has length 101 [2019-09-10 06:08:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:00,602 INFO L475 AbstractCegarLoop]: Abstraction has 106934 states and 164942 transitions. [2019-09-10 06:08:00,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:08:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 106934 states and 164942 transitions. [2019-09-10 06:08:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 06:08:00,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:00,605 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:00,605 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1431539607, now seen corresponding path program 1 times [2019-09-10 06:08:00,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:00,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:08:00,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:00,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:00,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:00,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:00,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:00,683 INFO L87 Difference]: Start difference. First operand 106934 states and 164942 transitions. Second operand 3 states. [2019-09-10 06:08:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:02,098 INFO L93 Difference]: Finished difference Result 195624 states and 301471 transitions. [2019-09-10 06:08:02,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:02,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 06:08:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:02,518 INFO L225 Difference]: With dead ends: 195624 [2019-09-10 06:08:02,519 INFO L226 Difference]: Without dead ends: 195624 [2019-09-10 06:08:02,519 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 06:08:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195624 states. [2019-09-10 06:08:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195624 to 195190. [2019-09-10 06:08:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195190 states. [2019-09-10 06:08:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195190 states to 195190 states and 301038 transitions. [2019-09-10 06:08:08,161 INFO L78 Accepts]: Start accepts. Automaton has 195190 states and 301038 transitions. Word has length 101 [2019-09-10 06:08:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:08,161 INFO L475 AbstractCegarLoop]: Abstraction has 195190 states and 301038 transitions. [2019-09-10 06:08:08,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 195190 states and 301038 transitions. [2019-09-10 06:08:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:08:08,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:08,166 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:08:08,166 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:08,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:08,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1040913274, now seen corresponding path program 1 times [2019-09-10 06:08:08,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:08,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:08,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:08,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:08,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:08:08,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:08,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:08,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:08,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:08,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:08,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:08,242 INFO L87 Difference]: Start difference. First operand 195190 states and 301038 transitions. Second operand 3 states. [2019-09-10 06:08:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:09,084 INFO L93 Difference]: Finished difference Result 378563 states and 578740 transitions. [2019-09-10 06:08:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:09,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:08:09,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:09,693 INFO L225 Difference]: With dead ends: 378563 [2019-09-10 06:08:09,694 INFO L226 Difference]: Without dead ends: 378563 [2019-09-10 06:08:09,694 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 06:08:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378563 states. [2019-09-10 06:08:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378563 to 378561. [2019-09-10 06:08:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378561 states. [2019-09-10 06:08:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378561 states to 378561 states and 578739 transitions. [2019-09-10 06:08:15,095 INFO L78 Accepts]: Start accepts. Automaton has 378561 states and 578739 transitions. Word has length 102 [2019-09-10 06:08:15,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:15,095 INFO L475 AbstractCegarLoop]: Abstraction has 378561 states and 578739 transitions. [2019-09-10 06:08:15,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:08:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 378561 states and 578739 transitions. [2019-09-10 06:08:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:08:15,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:15,100 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:08:15,100 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash -381064316, now seen corresponding path program 1 times [2019-09-10 06:08:15,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:15,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:15,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:15,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:15,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:15,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:08:15,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:15,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:08:15,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:15,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:08:15,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:08:15,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:08:15,233 INFO L87 Difference]: Start difference. First operand 378561 states and 578739 transitions. Second operand 4 states. [2019-09-10 06:08:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:23,714 INFO L93 Difference]: Finished difference Result 735796 states and 1114832 transitions. [2019-09-10 06:08:23,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:08:23,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-10 06:08:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:08:25,082 INFO L225 Difference]: With dead ends: 735796 [2019-09-10 06:08:25,082 INFO L226 Difference]: Without dead ends: 735796 [2019-09-10 06:08:25,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:08:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735796 states. [2019-09-10 06:08:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735796 to 735794. [2019-09-10 06:08:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735794 states. [2019-09-10 06:08:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735794 states to 735794 states and 1114831 transitions. [2019-09-10 06:08:40,833 INFO L78 Accepts]: Start accepts. Automaton has 735794 states and 1114831 transitions. Word has length 102 [2019-09-10 06:08:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:08:40,833 INFO L475 AbstractCegarLoop]: Abstraction has 735794 states and 1114831 transitions. [2019-09-10 06:08:40,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:08:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 735794 states and 1114831 transitions. [2019-09-10 06:08:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 06:08:40,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:08:40,841 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:08:40,841 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:08:40,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:08:40,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1735669958, now seen corresponding path program 1 times [2019-09-10 06:08:40,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:08:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:40,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:08:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:08:40,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:08:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:08:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:08:40,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:08:40,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:08:40,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:08:40,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:08:40,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:08:40,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:08:40,907 INFO L87 Difference]: Start difference. First operand 735794 states and 1114831 transitions. Second operand 3 states. [2019-09-10 06:08:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:08:53,873 INFO L93 Difference]: Finished difference Result 1471534 states and 2229575 transitions. [2019-09-10 06:08:53,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:08:53,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-10 06:08:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:06,287 INFO L225 Difference]: With dead ends: 1471534 [2019-09-10 06:09:06,288 INFO L226 Difference]: Without dead ends: 1471534 [2019-09-10 06:09:06,288 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 06:09:07,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471534 states. [2019-09-10 06:09:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471534 to 735796. [2019-09-10 06:09:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735796 states. [2019-09-10 06:09:39,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735796 states to 735796 states and 1114833 transitions. [2019-09-10 06:09:39,553 INFO L78 Accepts]: Start accepts. Automaton has 735796 states and 1114833 transitions. Word has length 103 [2019-09-10 06:09:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:39,553 INFO L475 AbstractCegarLoop]: Abstraction has 735796 states and 1114833 transitions. [2019-09-10 06:09:39,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 735796 states and 1114833 transitions. [2019-09-10 06:09:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:09:39,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:39,559 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:09:39,560 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:39,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash -854773197, now seen corresponding path program 1 times [2019-09-10 06:09:39,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:39,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:39,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:39,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:39,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:09:39,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:39,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:09:39,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:39,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:09:39,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:09:39,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:09:39,628 INFO L87 Difference]: Start difference. First operand 735796 states and 1114833 transitions. Second operand 3 states. [2019-09-10 06:09:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:09:49,621 INFO L93 Difference]: Finished difference Result 623512 states and 936452 transitions. [2019-09-10 06:09:49,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:09:49,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-10 06:09:49,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:09:50,616 INFO L225 Difference]: With dead ends: 623512 [2019-09-10 06:09:50,617 INFO L226 Difference]: Without dead ends: 623512 [2019-09-10 06:09:50,617 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 06:09:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623512 states. [2019-09-10 06:09:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623512 to 623510. [2019-09-10 06:09:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623510 states. [2019-09-10 06:09:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623510 states to 623510 states and 936451 transitions. [2019-09-10 06:09:59,002 INFO L78 Accepts]: Start accepts. Automaton has 623510 states and 936451 transitions. Word has length 104 [2019-09-10 06:09:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:09:59,002 INFO L475 AbstractCegarLoop]: Abstraction has 623510 states and 936451 transitions. [2019-09-10 06:09:59,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:09:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 623510 states and 936451 transitions. [2019-09-10 06:09:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 06:09:59,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:09:59,009 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:09:59,010 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:09:59,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:09:59,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1855097296, now seen corresponding path program 1 times [2019-09-10 06:09:59,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:09:59,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:59,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:09:59,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:09:59,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:09:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:09:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:09:59,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:09:59,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:09:59,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:09:59,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:09:59,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:09:59,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:09:59,100 INFO L87 Difference]: Start difference. First operand 623510 states and 936451 transitions. Second operand 4 states. [2019-09-10 06:10:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:09,028 INFO L93 Difference]: Finished difference Result 563408 states and 845505 transitions. [2019-09-10 06:10:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:09,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-10 06:10:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:09,823 INFO L225 Difference]: With dead ends: 563408 [2019-09-10 06:10:09,823 INFO L226 Difference]: Without dead ends: 563080 [2019-09-10 06:10:09,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:10:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563080 states. [2019-09-10 06:10:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563080 to 563080. [2019-09-10 06:10:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563080 states. [2019-09-10 06:10:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563080 states to 563080 states and 845086 transitions. [2019-09-10 06:10:16,468 INFO L78 Accepts]: Start accepts. Automaton has 563080 states and 845086 transitions. Word has length 104 [2019-09-10 06:10:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:16,469 INFO L475 AbstractCegarLoop]: Abstraction has 563080 states and 845086 transitions. [2019-09-10 06:10:16,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 563080 states and 845086 transitions. [2019-09-10 06:10:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 06:10:16,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:16,475 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:10:16,476 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:16,476 INFO L82 PathProgramCache]: Analyzing trace with hash 31361607, now seen corresponding path program 1 times [2019-09-10 06:10:16,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:16,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:16,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:16,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:16,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:10:16,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:10:16,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:10:16,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:16,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:16,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:16,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:16,559 INFO L87 Difference]: Start difference. First operand 563080 states and 845086 transitions. Second operand 4 states. [2019-09-10 06:10:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:24,166 INFO L93 Difference]: Finished difference Result 664024 states and 999600 transitions. [2019-09-10 06:10:24,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:24,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-10 06:10:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:25,318 INFO L225 Difference]: With dead ends: 664024 [2019-09-10 06:10:25,318 INFO L226 Difference]: Without dead ends: 664024 [2019-09-10 06:10:25,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:10:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664024 states. [2019-09-10 06:10:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664024 to 592656. [2019-09-10 06:10:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592656 states. [2019-09-10 06:10:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592656 states to 592656 states and 891806 transitions. [2019-09-10 06:10:45,981 INFO L78 Accepts]: Start accepts. Automaton has 592656 states and 891806 transitions. Word has length 105 [2019-09-10 06:10:45,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:10:45,981 INFO L475 AbstractCegarLoop]: Abstraction has 592656 states and 891806 transitions. [2019-09-10 06:10:45,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:10:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 592656 states and 891806 transitions. [2019-09-10 06:10:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:10:45,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:10:45,989 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:10:45,989 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:10:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:45,990 INFO L82 PathProgramCache]: Analyzing trace with hash -836909356, now seen corresponding path program 1 times [2019-09-10 06:10:45,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:10:45,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:45,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:45,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:10:45,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:10:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:10:46,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:10:46,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:10:46,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 06:10:46,207 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [118], [123], [145], [149], [154], [157], [160], [171], [174], [176], [180], [185], [202], [205], [207], [209], [212], [215], [218], [221], [228], [236], [238], [241], [242], [244], [253], [256], [267], [270], [280], [288], [292], [294], [296], [299], [324], [332], [340], [350], [356], [358], [361], [386], [394], [402], [408], [412], [416], [418], [420], [423], [426], [429], [432], [434], [448], [456], [575], [576], [580], [581], [582] [2019-09-10 06:10:46,223 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:10:46,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:10:46,266 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:10:46,710 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 06:10:46,712 INFO L272 AbstractInterpreter]: Visited 104 different actions 576 times. Merged at 58 different actions 434 times. Widened at 24 different actions 89 times. Performed 1611 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1611 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 16 different actions. Largest state had 160 variables. [2019-09-10 06:10:46,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:10:46,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 06:10:46,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:10:46,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 06:10:46,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:10:46,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 06:10:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:10:46,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 06:10:46,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 06:10:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:10:46,924 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 06:10:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:10:46,957 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:10:46,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2019-09-10 06:10:46,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:10:46,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:10:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:10:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:10:46,959 INFO L87 Difference]: Start difference. First operand 592656 states and 891806 transitions. Second operand 4 states. [2019-09-10 06:10:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:10:49,946 INFO L93 Difference]: Finished difference Result 521954 states and 784247 transitions. [2019-09-10 06:10:49,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:10:49,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:10:49,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:10:50,809 INFO L225 Difference]: With dead ends: 521954 [2019-09-10 06:10:50,809 INFO L226 Difference]: Without dead ends: 521954 [2019-09-10 06:10:50,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:10:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521954 states. [2019-09-10 06:11:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521954 to 395500. [2019-09-10 06:11:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395500 states. [2019-09-10 06:11:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395500 states to 395500 states and 596538 transitions. [2019-09-10 06:11:07,416 INFO L78 Accepts]: Start accepts. Automaton has 395500 states and 596538 transitions. Word has length 106 [2019-09-10 06:11:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:07,416 INFO L475 AbstractCegarLoop]: Abstraction has 395500 states and 596538 transitions. [2019-09-10 06:11:07,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 395500 states and 596538 transitions. [2019-09-10 06:11:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 06:11:07,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:07,423 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:07,423 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:07,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:07,424 INFO L82 PathProgramCache]: Analyzing trace with hash 998727188, now seen corresponding path program 1 times [2019-09-10 06:11:07,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:07,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:07,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:07,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:07,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:11:07,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:07,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:11:07,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:07,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:11:07,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:11:07,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:11:07,602 INFO L87 Difference]: Start difference. First operand 395500 states and 596538 transitions. Second operand 4 states. [2019-09-10 06:11:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:09,238 INFO L93 Difference]: Finished difference Result 646510 states and 963840 transitions. [2019-09-10 06:11:09,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:11:09,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-10 06:11:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:17,530 INFO L225 Difference]: With dead ends: 646510 [2019-09-10 06:11:17,530 INFO L226 Difference]: Without dead ends: 646510 [2019-09-10 06:11:17,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:11:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646510 states. [2019-09-10 06:11:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646510 to 646508. [2019-09-10 06:11:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646508 states. [2019-09-10 06:11:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646508 states to 646508 states and 963839 transitions. [2019-09-10 06:11:27,149 INFO L78 Accepts]: Start accepts. Automaton has 646508 states and 963839 transitions. Word has length 106 [2019-09-10 06:11:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:11:27,150 INFO L475 AbstractCegarLoop]: Abstraction has 646508 states and 963839 transitions. [2019-09-10 06:11:27,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:11:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 646508 states and 963839 transitions. [2019-09-10 06:11:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:11:27,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:11:27,160 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:11:27,160 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:11:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:11:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash -229277515, now seen corresponding path program 1 times [2019-09-10 06:11:27,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:11:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:27,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:11:27,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:11:27,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:11:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:11:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:11:27,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:11:27,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:11:27,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:11:27,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:11:27,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:11:27,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:11:27,234 INFO L87 Difference]: Start difference. First operand 646508 states and 963839 transitions. Second operand 3 states. [2019-09-10 06:11:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:11:43,670 INFO L93 Difference]: Finished difference Result 1256201 states and 1855300 transitions. [2019-09-10 06:11:43,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:11:43,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 06:11:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:11:45,935 INFO L225 Difference]: With dead ends: 1256201 [2019-09-10 06:11:45,935 INFO L226 Difference]: Without dead ends: 1256201 [2019-09-10 06:11:45,936 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 06:11:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256201 states. [2019-09-10 06:12:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256201 to 1256199. [2019-09-10 06:12:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256199 states. [2019-09-10 06:12:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256199 states to 1256199 states and 1855299 transitions. [2019-09-10 06:12:24,829 INFO L78 Accepts]: Start accepts. Automaton has 1256199 states and 1855299 transitions. Word has length 108 [2019-09-10 06:12:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:24,829 INFO L475 AbstractCegarLoop]: Abstraction has 1256199 states and 1855299 transitions. [2019-09-10 06:12:24,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1256199 states and 1855299 transitions. [2019-09-10 06:12:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:12:24,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:24,849 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:12:24,849 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:24,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:24,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1206084882, now seen corresponding path program 1 times [2019-09-10 06:12:24,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:24,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:24,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:12:24,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:24,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:24,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:24,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:24,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:24,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:24,953 INFO L87 Difference]: Start difference. First operand 1256199 states and 1855299 transitions. Second operand 4 states. [2019-09-10 06:12:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:38,124 INFO L93 Difference]: Finished difference Result 1019853 states and 1502831 transitions. [2019-09-10 06:12:38,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:38,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-10 06:12:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:39,914 INFO L225 Difference]: With dead ends: 1019853 [2019-09-10 06:12:39,914 INFO L226 Difference]: Without dead ends: 1019697 [2019-09-10 06:12:39,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:12:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019697 states. [2019-09-10 06:13:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019697 to 1019697. [2019-09-10 06:13:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019697 states. [2019-09-10 06:13:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019697 states to 1019697 states and 1502645 transitions. [2019-09-10 06:13:13,267 INFO L78 Accepts]: Start accepts. Automaton has 1019697 states and 1502645 transitions. Word has length 108 [2019-09-10 06:13:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:13,267 INFO L475 AbstractCegarLoop]: Abstraction has 1019697 states and 1502645 transitions. [2019-09-10 06:13:13,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1019697 states and 1502645 transitions. [2019-09-10 06:13:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 06:13:13,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:13,278 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 06:13:13,278 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:13,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2089837102, now seen corresponding path program 1 times [2019-09-10 06:13:13,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:13,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:13,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:13,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:13,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 06:13:13,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:13,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:13,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:13,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:13,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:13,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:13,331 INFO L87 Difference]: Start difference. First operand 1019697 states and 1502645 transitions. Second operand 3 states. [2019-09-10 06:13:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:32,423 INFO L93 Difference]: Finished difference Result 2020479 states and 2950446 transitions. [2019-09-10 06:13:32,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:32,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-10 06:13:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:37,298 INFO L225 Difference]: With dead ends: 2020479 [2019-09-10 06:13:37,298 INFO L226 Difference]: Without dead ends: 2020479 [2019-09-10 06:13:37,299 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 06:13:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020479 states. [2019-09-10 06:14:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020479 to 2020477. [2019-09-10 06:14:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020477 states.