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.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:21:09,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:21:09,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:21:09,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:21:09,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:21:09,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:21:09,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:21:09,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:21:09,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:21:09,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:21:09,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:21:09,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:21:09,057 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:21:09,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:21:09,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:21:09,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:21:09,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:21:09,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:21:09,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:21:09,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:21:09,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:21:09,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:21:09,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:21:09,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:21:09,085 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:21:09,085 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:21:09,085 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:21:09,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:21:09,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:21:09,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:21:09,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:21:09,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:21:09,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:21:09,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:21:09,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:21:09,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:21:09,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:21:09,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:21:09,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:21:09,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:21:09,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:21:09,099 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:21:09,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:21:09,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:21:09,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:21:09,133 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:21:09,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:21:09,133 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:21:09,134 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:21:09,134 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:21:09,134 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:21:09,135 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:21:09,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:21:09,137 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:21:09,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:21:09,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:21:09,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:21:09,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:21:09,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:21:09,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:21:09,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:21:09,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:21:09,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:21:09,142 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:21:09,143 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:21:09,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:21:09,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:21:09,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:21:09,144 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:21:09,144 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:21:09,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:21:09,144 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:21:09,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:21:09,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:21:09,218 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:21:09,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:21:09,220 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:21:09,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:21:09,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2307e0a62/41c26857798b46b999e498c67ef1b66b/FLAGbd88547c2 [2019-09-10 06:21:09,758 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:21:09,759 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:21:09,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2307e0a62/41c26857798b46b999e498c67ef1b66b/FLAGbd88547c2 [2019-09-10 06:21:10,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2307e0a62/41c26857798b46b999e498c67ef1b66b [2019-09-10 06:21:10,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:21:10,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:21:10,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:21:10,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:21:10,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:21:10,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:21:10" (1/1) ... [2019-09-10 06:21:10,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d4e3ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10, skipping insertion in model container [2019-09-10 06:21:10,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:21:10" (1/1) ... [2019-09-10 06:21:10,086 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:21:10,139 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:21:10,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:21:10,659 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:21:10,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:21:10,851 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:21:10,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10 WrapperNode [2019-09-10 06:21:10,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:21:10,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:21:10,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:21:10,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:21:10,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10" (1/1) ... [2019-09-10 06:21:10,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10" (1/1) ... [2019-09-10 06:21:10,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10" (1/1) ... [2019-09-10 06:21:10,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10" (1/1) ... [2019-09-10 06:21:10,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10" (1/1) ... [2019-09-10 06:21:10,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10" (1/1) ... [2019-09-10 06:21:10,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10" (1/1) ... [2019-09-10 06:21:10,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:21:10,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:21:10,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:21:10,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:21:10,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10" (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:21:11,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:21:11,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:21:11,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:21:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:21:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:21:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:21:11,032 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:21:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:21:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:21:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:21:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:21:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:21:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:21:11,036 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:21:11,036 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:21:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:21:11,037 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:21:11,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:21:11,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:21:12,442 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:21:12,444 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:21:12,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:21:12 BoogieIcfgContainer [2019-09-10 06:21:12,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:21:12,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:21:12,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:21:12,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:21:12,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:21:10" (1/3) ... [2019-09-10 06:21:12,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dff7ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:21:12, skipping insertion in model container [2019-09-10 06:21:12,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:10" (2/3) ... [2019-09-10 06:21:12,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dff7ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:21:12, skipping insertion in model container [2019-09-10 06:21:12,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:21:12" (3/3) ... [2019-09-10 06:21:12,458 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-10 06:21:12,466 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:21:12,480 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:21:12,496 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:21:12,522 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:21:12,523 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:21:12,523 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:21:12,523 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:21:12,523 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:21:12,523 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:21:12,524 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:21:12,524 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:21:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-09-10 06:21:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:21:12,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:12,576 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:12,578 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2040025279, now seen corresponding path program 1 times [2019-09-10 06:21:12,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:12,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:12,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:12,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:12,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:13,190 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:21:13,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:13,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:13,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:13,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:13,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:13,218 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 3 states. [2019-09-10 06:21:13,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:13,377 INFO L93 Difference]: Finished difference Result 444 states and 770 transitions. [2019-09-10 06:21:13,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:13,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-10 06:21:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:13,414 INFO L225 Difference]: With dead ends: 444 [2019-09-10 06:21:13,414 INFO L226 Difference]: Without dead ends: 436 [2019-09-10 06:21:13,417 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:21:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-10 06:21:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-09-10 06:21:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-10 06:21:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 718 transitions. [2019-09-10 06:21:13,546 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 718 transitions. Word has length 115 [2019-09-10 06:21:13,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:13,547 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 718 transitions. [2019-09-10 06:21:13,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 718 transitions. [2019-09-10 06:21:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:21:13,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:13,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:13,564 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:13,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1630734110, now seen corresponding path program 1 times [2019-09-10 06:21:13,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:13,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:13,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:13,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:13,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:13,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:13,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:13,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:13,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:13,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:13,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:13,844 INFO L87 Difference]: Start difference. First operand 434 states and 718 transitions. Second operand 3 states. [2019-09-10 06:21:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:13,879 INFO L93 Difference]: Finished difference Result 537 states and 891 transitions. [2019-09-10 06:21:13,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:13,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 06:21:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:13,884 INFO L225 Difference]: With dead ends: 537 [2019-09-10 06:21:13,884 INFO L226 Difference]: Without dead ends: 537 [2019-09-10 06:21:13,885 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:21:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-10 06:21:13,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-09-10 06:21:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-10 06:21:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 890 transitions. [2019-09-10 06:21:13,903 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 890 transitions. Word has length 118 [2019-09-10 06:21:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:13,904 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 890 transitions. [2019-09-10 06:21:13,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 890 transitions. [2019-09-10 06:21:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:21:13,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:13,907 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:13,907 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:13,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1903519920, now seen corresponding path program 1 times [2019-09-10 06:21:13,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:13,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:13,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:13,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:14,023 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:21:14,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:14,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:14,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:14,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:14,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:14,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:14,025 INFO L87 Difference]: Start difference. First operand 535 states and 890 transitions. Second operand 3 states. [2019-09-10 06:21:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:14,054 INFO L93 Difference]: Finished difference Result 848 states and 1411 transitions. [2019-09-10 06:21:14,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:14,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 06:21:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:14,060 INFO L225 Difference]: With dead ends: 848 [2019-09-10 06:21:14,060 INFO L226 Difference]: Without dead ends: 848 [2019-09-10 06:21:14,060 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:21:14,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-09-10 06:21:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2019-09-10 06:21:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-10 06:21:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1410 transitions. [2019-09-10 06:21:14,085 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1410 transitions. Word has length 118 [2019-09-10 06:21:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:14,086 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1410 transitions. [2019-09-10 06:21:14,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1410 transitions. [2019-09-10 06:21:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:21:14,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:14,088 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:14,089 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1633458995, now seen corresponding path program 1 times [2019-09-10 06:21:14,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:14,202 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:21:14,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:14,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:14,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:14,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:14,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:14,204 INFO L87 Difference]: Start difference. First operand 846 states and 1410 transitions. Second operand 3 states. [2019-09-10 06:21:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:14,239 INFO L93 Difference]: Finished difference Result 1126 states and 1877 transitions. [2019-09-10 06:21:14,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:14,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 06:21:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:14,246 INFO L225 Difference]: With dead ends: 1126 [2019-09-10 06:21:14,246 INFO L226 Difference]: Without dead ends: 1126 [2019-09-10 06:21:14,247 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:21:14,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-10 06:21:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124. [2019-09-10 06:21:14,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-09-10 06:21:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1876 transitions. [2019-09-10 06:21:14,279 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1876 transitions. Word has length 121 [2019-09-10 06:21:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:14,279 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1876 transitions. [2019-09-10 06:21:14,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1876 transitions. [2019-09-10 06:21:14,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 06:21:14,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:14,282 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:14,282 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:14,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1760173243, now seen corresponding path program 1 times [2019-09-10 06:21:14,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:14,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:14,422 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:21:14,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:14,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:14,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:14,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:14,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:14,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:14,424 INFO L87 Difference]: Start difference. First operand 1124 states and 1876 transitions. Second operand 3 states. [2019-09-10 06:21:14,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:14,460 INFO L93 Difference]: Finished difference Result 1954 states and 3248 transitions. [2019-09-10 06:21:14,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:14,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 06:21:14,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:14,471 INFO L225 Difference]: With dead ends: 1954 [2019-09-10 06:21:14,471 INFO L226 Difference]: Without dead ends: 1954 [2019-09-10 06:21:14,472 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:21:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-09-10 06:21:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2019-09-10 06:21:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-10 06:21:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3247 transitions. [2019-09-10 06:21:14,524 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3247 transitions. Word has length 121 [2019-09-10 06:21:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:14,525 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3247 transitions. [2019-09-10 06:21:14,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:14,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3247 transitions. [2019-09-10 06:21:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:21:14,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:14,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:14,527 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash -499105252, now seen corresponding path program 1 times [2019-09-10 06:21:14,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:14,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:14,625 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:21:14,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:14,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:14,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:14,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:14,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:14,627 INFO L87 Difference]: Start difference. First operand 1952 states and 3247 transitions. Second operand 3 states. [2019-09-10 06:21:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:14,669 INFO L93 Difference]: Finished difference Result 2647 states and 4403 transitions. [2019-09-10 06:21:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:14,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 06:21:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:14,684 INFO L225 Difference]: With dead ends: 2647 [2019-09-10 06:21:14,684 INFO L226 Difference]: Without dead ends: 2647 [2019-09-10 06:21:14,684 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:21:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-09-10 06:21:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2645. [2019-09-10 06:21:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-09-10 06:21:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4402 transitions. [2019-09-10 06:21:14,749 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4402 transitions. Word has length 124 [2019-09-10 06:21:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:14,750 INFO L475 AbstractCegarLoop]: Abstraction has 2645 states and 4402 transitions. [2019-09-10 06:21:14,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:14,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4402 transitions. [2019-09-10 06:21:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:21:14,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:14,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:14,752 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:14,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:14,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1030513194, now seen corresponding path program 1 times [2019-09-10 06:21:14,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:14,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:14,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:14,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:14,980 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:21:14,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:14,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:14,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:14,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:14,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:14,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:14,982 INFO L87 Difference]: Start difference. First operand 2645 states and 4402 transitions. Second operand 3 states. [2019-09-10 06:21:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:15,062 INFO L93 Difference]: Finished difference Result 4816 states and 7949 transitions. [2019-09-10 06:21:15,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:15,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-10 06:21:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:15,097 INFO L225 Difference]: With dead ends: 4816 [2019-09-10 06:21:15,097 INFO L226 Difference]: Without dead ends: 4816 [2019-09-10 06:21:15,098 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:21:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-09-10 06:21:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4814. [2019-09-10 06:21:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-09-10 06:21:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 7948 transitions. [2019-09-10 06:21:15,255 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 7948 transitions. Word has length 124 [2019-09-10 06:21:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:15,256 INFO L475 AbstractCegarLoop]: Abstraction has 4814 states and 7948 transitions. [2019-09-10 06:21:15,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 7948 transitions. [2019-09-10 06:21:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 06:21:15,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:15,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:15,258 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash -577751605, now seen corresponding path program 1 times [2019-09-10 06:21:15,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:15,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:15,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:15,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:15,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:15,550 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:21:15,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:15,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:21:15,551 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:15,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:21:15,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:21:15,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:21:15,554 INFO L87 Difference]: Start difference. First operand 4814 states and 7948 transitions. Second operand 6 states. [2019-09-10 06:21:16,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:16,144 INFO L93 Difference]: Finished difference Result 24302 states and 40369 transitions. [2019-09-10 06:21:16,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 06:21:16,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-10 06:21:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:16,271 INFO L225 Difference]: With dead ends: 24302 [2019-09-10 06:21:16,271 INFO L226 Difference]: Without dead ends: 24302 [2019-09-10 06:21:16,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:21:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24302 states. [2019-09-10 06:21:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24302 to 9308. [2019-09-10 06:21:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9308 states. [2019-09-10 06:21:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 15301 transitions. [2019-09-10 06:21:16,737 INFO L78 Accepts]: Start accepts. Automaton has 9308 states and 15301 transitions. Word has length 127 [2019-09-10 06:21:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:16,738 INFO L475 AbstractCegarLoop]: Abstraction has 9308 states and 15301 transitions. [2019-09-10 06:21:16,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:21:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9308 states and 15301 transitions. [2019-09-10 06:21:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:21:16,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:16,740 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:16,741 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:16,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:16,741 INFO L82 PathProgramCache]: Analyzing trace with hash -796598874, now seen corresponding path program 1 times [2019-09-10 06:21:16,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:16,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:16,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:16,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:16,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:16,920 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:21:16,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:16,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:16,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:16,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:16,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:16,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:16,923 INFO L87 Difference]: Start difference. First operand 9308 states and 15301 transitions. Second operand 4 states. [2019-09-10 06:21:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:17,182 INFO L93 Difference]: Finished difference Result 18232 states and 30131 transitions. [2019-09-10 06:21:17,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:17,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 06:21:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:17,231 INFO L225 Difference]: With dead ends: 18232 [2019-09-10 06:21:17,232 INFO L226 Difference]: Without dead ends: 18232 [2019-09-10 06:21:17,233 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:21:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18232 states. [2019-09-10 06:21:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18232 to 15163. [2019-09-10 06:21:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-10 06:21:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 24965 transitions. [2019-09-10 06:21:17,553 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 24965 transitions. Word has length 128 [2019-09-10 06:21:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:17,554 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 24965 transitions. [2019-09-10 06:21:17,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:21:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 24965 transitions. [2019-09-10 06:21:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 06:21:17,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:17,556 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:17,557 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash 584578538, now seen corresponding path program 1 times [2019-09-10 06:21:17,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:17,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:17,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:17,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:17,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:21:17,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:17,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:17,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:17,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:17,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:17,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:17,688 INFO L87 Difference]: Start difference. First operand 15163 states and 24965 transitions. Second operand 3 states. [2019-09-10 06:21:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:17,795 INFO L93 Difference]: Finished difference Result 20841 states and 34254 transitions. [2019-09-10 06:21:17,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:17,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-10 06:21:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:17,860 INFO L225 Difference]: With dead ends: 20841 [2019-09-10 06:21:17,860 INFO L226 Difference]: Without dead ends: 20841 [2019-09-10 06:21:17,861 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:21:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20841 states. [2019-09-10 06:21:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20841 to 20839. [2019-09-10 06:21:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20839 states. [2019-09-10 06:21:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20839 states to 20839 states and 34253 transitions. [2019-09-10 06:21:18,323 INFO L78 Accepts]: Start accepts. Automaton has 20839 states and 34253 transitions. Word has length 128 [2019-09-10 06:21:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:18,323 INFO L475 AbstractCegarLoop]: Abstraction has 20839 states and 34253 transitions. [2019-09-10 06:21:18,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 20839 states and 34253 transitions. [2019-09-10 06:21:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 06:21:18,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:18,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:18,326 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:18,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1013628402, now seen corresponding path program 1 times [2019-09-10 06:21:18,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:18,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:18,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:18,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:18,451 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:21:18,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:18,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:18,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:18,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:18,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:18,453 INFO L87 Difference]: Start difference. First operand 20839 states and 34253 transitions. Second operand 4 states. [2019-09-10 06:21:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:18,666 INFO L93 Difference]: Finished difference Result 40351 states and 66359 transitions. [2019-09-10 06:21:18,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:18,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 06:21:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:18,769 INFO L225 Difference]: With dead ends: 40351 [2019-09-10 06:21:18,769 INFO L226 Difference]: Without dead ends: 40351 [2019-09-10 06:21:18,770 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:21:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-10 06:21:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 33920. [2019-09-10 06:21:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33920 states. [2019-09-10 06:21:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33920 states to 33920 states and 55603 transitions. [2019-09-10 06:21:20,074 INFO L78 Accepts]: Start accepts. Automaton has 33920 states and 55603 transitions. Word has length 129 [2019-09-10 06:21:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:20,074 INFO L475 AbstractCegarLoop]: Abstraction has 33920 states and 55603 transitions. [2019-09-10 06:21:20,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:21:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 33920 states and 55603 transitions. [2019-09-10 06:21:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 06:21:20,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:20,077 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1300657133, now seen corresponding path program 1 times [2019-09-10 06:21:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:20,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:20,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:20,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:20,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:20,257 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:21:20,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:20,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:20,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:20,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:20,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:20,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:20,261 INFO L87 Difference]: Start difference. First operand 33920 states and 55603 transitions. Second operand 4 states. [2019-09-10 06:21:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:20,849 INFO L93 Difference]: Finished difference Result 64914 states and 106473 transitions. [2019-09-10 06:21:20,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:20,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 06:21:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:21,007 INFO L225 Difference]: With dead ends: 64914 [2019-09-10 06:21:21,007 INFO L226 Difference]: Without dead ends: 64914 [2019-09-10 06:21:21,008 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:21:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64914 states. [2019-09-10 06:21:22,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64914 to 54909. [2019-09-10 06:21:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54909 states. [2019-09-10 06:21:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54909 states to 54909 states and 89761 transitions. [2019-09-10 06:21:22,934 INFO L78 Accepts]: Start accepts. Automaton has 54909 states and 89761 transitions. Word has length 130 [2019-09-10 06:21:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:22,934 INFO L475 AbstractCegarLoop]: Abstraction has 54909 states and 89761 transitions. [2019-09-10 06:21:22,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:21:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 54909 states and 89761 transitions. [2019-09-10 06:21:22,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 06:21:22,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:22,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:22,937 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:22,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:22,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1613171225, now seen corresponding path program 1 times [2019-09-10 06:21:22,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:22,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:22,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:22,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:23,141 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:21:23,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:23,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:21:23,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:23,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:21:23,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:21:23,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:21:23,143 INFO L87 Difference]: Start difference. First operand 54909 states and 89761 transitions. Second operand 7 states. [2019-09-10 06:21:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:24,512 INFO L93 Difference]: Finished difference Result 212252 states and 346491 transitions. [2019-09-10 06:21:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 06:21:24,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-10 06:21:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:26,914 INFO L225 Difference]: With dead ends: 212252 [2019-09-10 06:21:26,914 INFO L226 Difference]: Without dead ends: 212252 [2019-09-10 06:21:26,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 06:21:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212252 states. [2019-09-10 06:21:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212252 to 148492. [2019-09-10 06:21:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-10 06:21:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 241054 transitions. [2019-09-10 06:21:30,026 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 241054 transitions. Word has length 131 [2019-09-10 06:21:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:30,026 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 241054 transitions. [2019-09-10 06:21:30,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:21:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 241054 transitions. [2019-09-10 06:21:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 06:21:30,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:30,028 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:30,028 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1715276375, now seen corresponding path program 1 times [2019-09-10 06:21:30,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:30,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:30,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:30,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:30,356 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:21:30,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:30,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:21:30,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:30,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:21:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:21:30,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:21:30,359 INFO L87 Difference]: Start difference. First operand 148492 states and 241054 transitions. Second operand 6 states. [2019-09-10 06:21:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:31,202 INFO L93 Difference]: Finished difference Result 205422 states and 333953 transitions. [2019-09-10 06:21:31,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:21:31,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-10 06:21:31,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:31,547 INFO L225 Difference]: With dead ends: 205422 [2019-09-10 06:21:31,547 INFO L226 Difference]: Without dead ends: 205422 [2019-09-10 06:21:31,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:21:31,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205422 states. [2019-09-10 06:21:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205422 to 148492. [2019-09-10 06:21:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-10 06:21:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 240429 transitions. [2019-09-10 06:21:36,214 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 240429 transitions. Word has length 133 [2019-09-10 06:21:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:36,214 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 240429 transitions. [2019-09-10 06:21:36,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:21:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 240429 transitions. [2019-09-10 06:21:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 06:21:36,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:36,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:36,217 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash -326924610, now seen corresponding path program 1 times [2019-09-10 06:21:36,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:36,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:36,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:36,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:36,525 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:21:36,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:36,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:21:36,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:36,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:21:36,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:21:36,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:21:36,527 INFO L87 Difference]: Start difference. First operand 148492 states and 240429 transitions. Second operand 6 states. [2019-09-10 06:21:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:38,121 INFO L93 Difference]: Finished difference Result 287801 states and 465957 transitions. [2019-09-10 06:21:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:21:38,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-10 06:21:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:38,600 INFO L225 Difference]: With dead ends: 287801 [2019-09-10 06:21:38,600 INFO L226 Difference]: Without dead ends: 287801 [2019-09-10 06:21:38,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:21:38,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287801 states. [2019-09-10 06:21:44,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287801 to 287797. [2019-09-10 06:21:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287797 states. [2019-09-10 06:21:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287797 states to 287797 states and 465955 transitions. [2019-09-10 06:21:44,662 INFO L78 Accepts]: Start accepts. Automaton has 287797 states and 465955 transitions. Word has length 136 [2019-09-10 06:21:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:44,663 INFO L475 AbstractCegarLoop]: Abstraction has 287797 states and 465955 transitions. [2019-09-10 06:21:44,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:21:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 287797 states and 465955 transitions. [2019-09-10 06:21:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 06:21:44,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:44,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:21:44,665 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1546637434, now seen corresponding path program 1 times [2019-09-10 06:21:44,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:44,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:44,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:44,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:44,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:48,544 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:21:48,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:48,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:21:48,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:48,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:21:48,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:21:48,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:21:48,546 INFO L87 Difference]: Start difference. First operand 287797 states and 465955 transitions. Second operand 5 states. [2019-09-10 06:21:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:49,644 INFO L93 Difference]: Finished difference Result 473703 states and 760804 transitions. [2019-09-10 06:21:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:21:49,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-10 06:21:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:50,302 INFO L225 Difference]: With dead ends: 473703 [2019-09-10 06:21:50,302 INFO L226 Difference]: Without dead ends: 473703 [2019-09-10 06:21:50,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:21:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473703 states. [2019-09-10 06:21:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473703 to 292397. [2019-09-10 06:21:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292397 states. [2019-09-10 06:22:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292397 states to 292397 states and 470510 transitions. [2019-09-10 06:22:00,432 INFO L78 Accepts]: Start accepts. Automaton has 292397 states and 470510 transitions. Word has length 137 [2019-09-10 06:22:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:00,432 INFO L475 AbstractCegarLoop]: Abstraction has 292397 states and 470510 transitions. [2019-09-10 06:22:00,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:22:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 292397 states and 470510 transitions. [2019-09-10 06:22:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:22:00,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:00,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:00,444 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:00,444 INFO L82 PathProgramCache]: Analyzing trace with hash 470040001, now seen corresponding path program 1 times [2019-09-10 06:22:00,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:00,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:00,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:00,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:00,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 06:22:00,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:00,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:00,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:00,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:00,564 INFO L87 Difference]: Start difference. First operand 292397 states and 470510 transitions. Second operand 3 states. [2019-09-10 06:22:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:03,213 INFO L93 Difference]: Finished difference Result 461227 states and 742315 transitions. [2019-09-10 06:22:03,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:03,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 06:22:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:04,043 INFO L225 Difference]: With dead ends: 461227 [2019-09-10 06:22:04,044 INFO L226 Difference]: Without dead ends: 461227 [2019-09-10 06:22:04,044 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:22:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461227 states. [2019-09-10 06:22:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461227 to 460488. [2019-09-10 06:22:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460488 states. [2019-09-10 06:22:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460488 states to 460488 states and 741577 transitions. [2019-09-10 06:22:13,689 INFO L78 Accepts]: Start accepts. Automaton has 460488 states and 741577 transitions. Word has length 167 [2019-09-10 06:22:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:13,689 INFO L475 AbstractCegarLoop]: Abstraction has 460488 states and 741577 transitions. [2019-09-10 06:22:13,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 460488 states and 741577 transitions. [2019-09-10 06:22:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:22:13,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:13,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,701 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:13,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1226993252, now seen corresponding path program 1 times [2019-09-10 06:22:13,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:13,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:13,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:13,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 06:22:14,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:14,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:14,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:14,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:14,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:14,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:14,026 INFO L87 Difference]: Start difference. First operand 460488 states and 741577 transitions. Second operand 4 states. [2019-09-10 06:22:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:21,138 INFO L93 Difference]: Finished difference Result 730440 states and 1179153 transitions. [2019-09-10 06:22:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:22:21,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-10 06:22:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:22,050 INFO L225 Difference]: With dead ends: 730440 [2019-09-10 06:22:22,050 INFO L226 Difference]: Without dead ends: 730440 [2019-09-10 06:22:22,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:22:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730440 states. [2019-09-10 06:22:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730440 to 648322. [2019-09-10 06:22:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648322 states. [2019-09-10 06:22:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648322 states to 648322 states and 1046877 transitions. [2019-09-10 06:22:37,243 INFO L78 Accepts]: Start accepts. Automaton has 648322 states and 1046877 transitions. Word has length 167 [2019-09-10 06:22:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:37,244 INFO L475 AbstractCegarLoop]: Abstraction has 648322 states and 1046877 transitions. [2019-09-10 06:22:37,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 648322 states and 1046877 transitions. [2019-09-10 06:22:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:22:37,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:37,250 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:37,251 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash -452129158, now seen corresponding path program 1 times [2019-09-10 06:22:37,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:37,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:37,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:37,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 06:22:37,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:37,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:22:37,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:38,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:22:38,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:22:38,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:22:38,984 INFO L87 Difference]: Start difference. First operand 648322 states and 1046877 transitions. Second operand 6 states. [2019-09-10 06:22:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:51,669 INFO L93 Difference]: Finished difference Result 954587 states and 1545349 transitions. [2019-09-10 06:22:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:22:51,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-10 06:22:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:53,301 INFO L225 Difference]: With dead ends: 954587 [2019-09-10 06:22:53,302 INFO L226 Difference]: Without dead ends: 954587 [2019-09-10 06:22:53,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:22:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954587 states. [2019-09-10 06:23:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954587 to 803425. [2019-09-10 06:23:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803425 states. [2019-09-10 06:23:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803425 states to 803425 states and 1297607 transitions. [2019-09-10 06:23:21,147 INFO L78 Accepts]: Start accepts. Automaton has 803425 states and 1297607 transitions. Word has length 167 [2019-09-10 06:23:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:21,148 INFO L475 AbstractCegarLoop]: Abstraction has 803425 states and 1297607 transitions. [2019-09-10 06:23:21,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:23:21,148 INFO L276 IsEmpty]: Start isEmpty. Operand 803425 states and 1297607 transitions. [2019-09-10 06:23:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 06:23:21,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:21,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:21,153 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:21,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1361288056, now seen corresponding path program 1 times [2019-09-10 06:23:21,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:21,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:21,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 06:23:23,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:23,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:23,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:23,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:23,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:23,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:23,387 INFO L87 Difference]: Start difference. First operand 803425 states and 1297607 transitions. Second operand 4 states. [2019-09-10 06:23:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:35,310 INFO L93 Difference]: Finished difference Result 1297824 states and 2101482 transitions. [2019-09-10 06:23:35,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:23:35,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-10 06:23:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:37,960 INFO L225 Difference]: With dead ends: 1297824 [2019-09-10 06:23:37,960 INFO L226 Difference]: Without dead ends: 1297824 [2019-09-10 06:23:37,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:23:38,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297824 states. [2019-09-10 06:23:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297824 to 1148136. [2019-09-10 06:23:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148136 states. [2019-09-10 06:24:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148136 states to 1148136 states and 1859406 transitions. [2019-09-10 06:24:18,919 INFO L78 Accepts]: Start accepts. Automaton has 1148136 states and 1859406 transitions. Word has length 167 [2019-09-10 06:24:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:18,920 INFO L475 AbstractCegarLoop]: Abstraction has 1148136 states and 1859406 transitions. [2019-09-10 06:24:18,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:24:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1148136 states and 1859406 transitions. [2019-09-10 06:24:18,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 06:24:18,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:18,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:18,924 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:18,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2008292970, now seen corresponding path program 1 times [2019-09-10 06:24:18,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:18,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:18,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:24:19,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:19,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:24:19,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:19,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:24:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:24:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:24:19,043 INFO L87 Difference]: Start difference. First operand 1148136 states and 1859406 transitions. Second operand 3 states. [2019-09-10 06:24:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:39,450 INFO L93 Difference]: Finished difference Result 2253103 states and 3634534 transitions. [2019-09-10 06:24:39,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:24:39,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-10 06:24:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:43,665 INFO L225 Difference]: With dead ends: 2253103 [2019-09-10 06:24:43,665 INFO L226 Difference]: Without dead ends: 2253103 [2019-09-10 06:24:43,666 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:24:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253103 states.