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_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:17:25,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:17:25,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:17:25,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:17:25,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:17:25,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:17:25,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:17:25,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:17:25,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:17:25,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:17:25,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:17:25,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:17:25,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:17:25,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:17:25,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:17:25,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:17:25,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:17:25,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:17:25,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:17:25,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:17:25,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:17:25,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:17:25,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:17:25,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:17:25,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:17:25,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:17:25,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:17:25,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:17:25,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:17:25,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:17:25,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:17:25,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:17:25,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:17:25,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:17:25,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:17:25,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:17:25,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:17:25,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:17:25,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:17:25,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:17:25,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:17:25,237 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 07:17:25,251 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:17:25,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:17:25,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:17:25,252 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:17:25,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:17:25,253 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:17:25,253 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:17:25,253 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:17:25,254 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:17:25,254 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:17:25,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:17:25,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:17:25,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:17:25,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:17:25,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:17:25,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:17:25,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:17:25,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:17:25,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:17:25,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:17:25,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:17:25,257 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:17:25,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:17:25,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:17:25,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:17:25,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:17:25,258 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:17:25,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:17:25,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:17:25,258 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:17:25,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:17:25,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:17:25,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:17:25,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:17:25,304 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:17:25,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-10 07:17:25,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe34cf7e4/cfa6115f0b78456c8edd10773816de48/FLAGa476a2585 [2019-09-10 07:17:25,908 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:17:25,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-10 07:17:25,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe34cf7e4/cfa6115f0b78456c8edd10773816de48/FLAGa476a2585 [2019-09-10 07:17:26,183 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe34cf7e4/cfa6115f0b78456c8edd10773816de48 [2019-09-10 07:17:26,192 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:17:26,194 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:17:26,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:17:26,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:17:26,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:17:26,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:17:26" (1/1) ... [2019-09-10 07:17:26,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67837e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26, skipping insertion in model container [2019-09-10 07:17:26,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:17:26" (1/1) ... [2019-09-10 07:17:26,210 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:17:26,274 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:17:26,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:17:26,787 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:17:26,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:17:26,922 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:17:26,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26 WrapperNode [2019-09-10 07:17:26,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:17:26,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:17:26,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:17:26,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:17:26,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26" (1/1) ... [2019-09-10 07:17:26,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26" (1/1) ... [2019-09-10 07:17:26,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26" (1/1) ... [2019-09-10 07:17:26,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26" (1/1) ... [2019-09-10 07:17:26,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26" (1/1) ... [2019-09-10 07:17:26,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26" (1/1) ... [2019-09-10 07:17:26,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26" (1/1) ... [2019-09-10 07:17:27,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:17:27,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:17:27,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:17:27,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:17:27,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26" (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 07:17:27,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:17:27,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:17:27,074 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:17:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:17:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:17:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:17:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:17:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:17:27,075 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:17:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:17:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:17:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:17:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:17:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:17:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:17:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:17:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:17:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:17:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:17:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:17:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:17:28,420 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:17:28,421 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:17:28,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:17:28 BoogieIcfgContainer [2019-09-10 07:17:28,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:17:28,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:17:28,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:17:28,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:17:28,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:17:26" (1/3) ... [2019-09-10 07:17:28,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de59c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:17:28, skipping insertion in model container [2019-09-10 07:17:28,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:17:26" (2/3) ... [2019-09-10 07:17:28,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de59c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:17:28, skipping insertion in model container [2019-09-10 07:17:28,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:17:28" (3/3) ... [2019-09-10 07:17:28,434 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-10 07:17:28,442 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:17:28,451 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:17:28,467 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:17:28,496 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:17:28,496 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:17:28,496 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:17:28,496 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:17:28,497 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:17:28,497 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:17:28,497 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:17:28,497 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:17:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states. [2019-09-10 07:17:28,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:17:28,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:28,555 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] [2019-09-10 07:17:28,557 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash -515366270, now seen corresponding path program 1 times [2019-09-10 07:17:28,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:28,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:28,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:29,105 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 07:17:29,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:29,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:29,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:29,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:29,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:29,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:29,134 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 3 states. [2019-09-10 07:17:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:29,290 INFO L93 Difference]: Finished difference Result 408 states and 677 transitions. [2019-09-10 07:17:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:29,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-10 07:17:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:29,310 INFO L225 Difference]: With dead ends: 408 [2019-09-10 07:17:29,311 INFO L226 Difference]: Without dead ends: 400 [2019-09-10 07:17:29,312 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 07:17:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-10 07:17:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2019-09-10 07:17:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-10 07:17:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 594 transitions. [2019-09-10 07:17:29,382 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 594 transitions. Word has length 101 [2019-09-10 07:17:29,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:29,383 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 594 transitions. [2019-09-10 07:17:29,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:17:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 594 transitions. [2019-09-10 07:17:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:17:29,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:29,389 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] [2019-09-10 07:17:29,389 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:29,390 INFO L82 PathProgramCache]: Analyzing trace with hash 862673413, now seen corresponding path program 1 times [2019-09-10 07:17:29,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:29,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:29,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:29,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:29,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:17:29,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:29,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:17:29,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:29,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:17:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:17:29,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:17:29,854 INFO L87 Difference]: Start difference. First operand 398 states and 594 transitions. Second operand 8 states. [2019-09-10 07:17:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:30,344 INFO L93 Difference]: Finished difference Result 1669 states and 2567 transitions. [2019-09-10 07:17:30,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:17:30,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-10 07:17:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:30,356 INFO L225 Difference]: With dead ends: 1669 [2019-09-10 07:17:30,356 INFO L226 Difference]: Without dead ends: 1669 [2019-09-10 07:17:30,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:17:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-10 07:17:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1659. [2019-09-10 07:17:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-09-10 07:17:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2562 transitions. [2019-09-10 07:17:30,444 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2562 transitions. Word has length 102 [2019-09-10 07:17:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:30,445 INFO L475 AbstractCegarLoop]: Abstraction has 1659 states and 2562 transitions. [2019-09-10 07:17:30,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:17:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2562 transitions. [2019-09-10 07:17:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:17:30,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:30,457 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] [2019-09-10 07:17:30,459 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:30,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1435350370, now seen corresponding path program 1 times [2019-09-10 07:17:30,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:30,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:30,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:30,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:30,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:30,674 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 07:17:30,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:30,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:17:30,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:30,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:17:30,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:17:30,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:17:30,677 INFO L87 Difference]: Start difference. First operand 1659 states and 2562 transitions. Second operand 6 states. [2019-09-10 07:17:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:31,335 INFO L93 Difference]: Finished difference Result 4181 states and 6525 transitions. [2019-09-10 07:17:31,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:17:31,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-09-10 07:17:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:31,361 INFO L225 Difference]: With dead ends: 4181 [2019-09-10 07:17:31,362 INFO L226 Difference]: Without dead ends: 4181 [2019-09-10 07:17:31,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:17:31,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-09-10 07:17:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4177. [2019-09-10 07:17:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4177 states. [2019-09-10 07:17:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 6523 transitions. [2019-09-10 07:17:31,470 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 6523 transitions. Word has length 103 [2019-09-10 07:17:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:31,470 INFO L475 AbstractCegarLoop]: Abstraction has 4177 states and 6523 transitions. [2019-09-10 07:17:31,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:17:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 6523 transitions. [2019-09-10 07:17:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:17:31,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:31,476 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] [2019-09-10 07:17:31,476 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:31,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:31,476 INFO L82 PathProgramCache]: Analyzing trace with hash -49006449, now seen corresponding path program 1 times [2019-09-10 07:17:31,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:31,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:31,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:31,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:31,636 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 07:17:31,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:31,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:17:31,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:31,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:17:31,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:17:31,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:17:31,639 INFO L87 Difference]: Start difference. First operand 4177 states and 6523 transitions. Second operand 5 states. [2019-09-10 07:17:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:32,203 INFO L93 Difference]: Finished difference Result 7519 states and 11732 transitions. [2019-09-10 07:17:32,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:17:32,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:17:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:32,246 INFO L225 Difference]: With dead ends: 7519 [2019-09-10 07:17:32,246 INFO L226 Difference]: Without dead ends: 7519 [2019-09-10 07:17:32,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:32,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7519 states. [2019-09-10 07:17:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7519 to 7517. [2019-09-10 07:17:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7517 states. [2019-09-10 07:17:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7517 states to 7517 states and 11731 transitions. [2019-09-10 07:17:32,506 INFO L78 Accepts]: Start accepts. Automaton has 7517 states and 11731 transitions. Word has length 103 [2019-09-10 07:17:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:32,507 INFO L475 AbstractCegarLoop]: Abstraction has 7517 states and 11731 transitions. [2019-09-10 07:17:32,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:17:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7517 states and 11731 transitions. [2019-09-10 07:17:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:17:32,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:32,513 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] [2019-09-10 07:17:32,514 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1556143714, now seen corresponding path program 1 times [2019-09-10 07:17:32,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:32,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:32,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:32,681 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 07:17:32,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:32,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:17:32,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:32,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:17:32,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:17:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:17:32,684 INFO L87 Difference]: Start difference. First operand 7517 states and 11731 transitions. Second operand 5 states. [2019-09-10 07:17:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:33,088 INFO L93 Difference]: Finished difference Result 14147 states and 22072 transitions. [2019-09-10 07:17:33,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:17:33,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:17:33,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:33,213 INFO L225 Difference]: With dead ends: 14147 [2019-09-10 07:17:33,213 INFO L226 Difference]: Without dead ends: 14147 [2019-09-10 07:17:33,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14147 states. [2019-09-10 07:17:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14147 to 14145. [2019-09-10 07:17:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14145 states. [2019-09-10 07:17:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 22071 transitions. [2019-09-10 07:17:33,775 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 22071 transitions. Word has length 103 [2019-09-10 07:17:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:33,775 INFO L475 AbstractCegarLoop]: Abstraction has 14145 states and 22071 transitions. [2019-09-10 07:17:33,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:17:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 22071 transitions. [2019-09-10 07:17:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:17:33,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:33,781 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] [2019-09-10 07:17:33,781 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash 202933120, now seen corresponding path program 1 times [2019-09-10 07:17:33,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:33,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:33,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:33,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:33,891 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 07:17:33,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:33,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:17:33,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:33,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:17:33,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:17:33,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:17:33,893 INFO L87 Difference]: Start difference. First operand 14145 states and 22071 transitions. Second operand 5 states. [2019-09-10 07:17:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:34,375 INFO L93 Difference]: Finished difference Result 27577 states and 42889 transitions. [2019-09-10 07:17:34,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:17:34,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:17:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:34,449 INFO L225 Difference]: With dead ends: 27577 [2019-09-10 07:17:34,449 INFO L226 Difference]: Without dead ends: 27577 [2019-09-10 07:17:34,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27577 states. [2019-09-10 07:17:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27577 to 27575. [2019-09-10 07:17:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27575 states. [2019-09-10 07:17:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27575 states to 27575 states and 42888 transitions. [2019-09-10 07:17:35,415 INFO L78 Accepts]: Start accepts. Automaton has 27575 states and 42888 transitions. Word has length 103 [2019-09-10 07:17:35,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:35,416 INFO L475 AbstractCegarLoop]: Abstraction has 27575 states and 42888 transitions. [2019-09-10 07:17:35,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:17:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27575 states and 42888 transitions. [2019-09-10 07:17:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:17:35,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:35,431 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] [2019-09-10 07:17:35,439 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:35,441 INFO L82 PathProgramCache]: Analyzing trace with hash -76299663, now seen corresponding path program 1 times [2019-09-10 07:17:35,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:35,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:35,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:35,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:35,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:35,545 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 07:17:35,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:35,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:17:35,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:35,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:17:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:17:35,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:17:35,547 INFO L87 Difference]: Start difference. First operand 27575 states and 42888 transitions. Second operand 5 states. [2019-09-10 07:17:36,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:36,062 INFO L93 Difference]: Finished difference Result 54541 states and 84469 transitions. [2019-09-10 07:17:36,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:17:36,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:17:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:36,195 INFO L225 Difference]: With dead ends: 54541 [2019-09-10 07:17:36,195 INFO L226 Difference]: Without dead ends: 54541 [2019-09-10 07:17:36,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54541 states. [2019-09-10 07:17:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54541 to 54539. [2019-09-10 07:17:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54539 states. [2019-09-10 07:17:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54539 states to 54539 states and 84468 transitions. [2019-09-10 07:17:38,357 INFO L78 Accepts]: Start accepts. Automaton has 54539 states and 84468 transitions. Word has length 103 [2019-09-10 07:17:38,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:38,357 INFO L475 AbstractCegarLoop]: Abstraction has 54539 states and 84468 transitions. [2019-09-10 07:17:38,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:17:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 54539 states and 84468 transitions. [2019-09-10 07:17:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 07:17:38,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:38,370 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] [2019-09-10 07:17:38,370 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:38,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:38,371 INFO L82 PathProgramCache]: Analyzing trace with hash -737272749, now seen corresponding path program 1 times [2019-09-10 07:17:38,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:38,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:38,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:38,469 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 07:17:38,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:38,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:17:38,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:38,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:17:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:17:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:17:38,471 INFO L87 Difference]: Start difference. First operand 54539 states and 84468 transitions. Second operand 5 states. [2019-09-10 07:17:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:39,179 INFO L93 Difference]: Finished difference Result 108557 states and 167155 transitions. [2019-09-10 07:17:39,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:17:39,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-10 07:17:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:39,479 INFO L225 Difference]: With dead ends: 108557 [2019-09-10 07:17:39,480 INFO L226 Difference]: Without dead ends: 108557 [2019-09-10 07:17:39,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:17:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108557 states. [2019-09-10 07:17:42,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108557 to 108555. [2019-09-10 07:17:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108555 states. [2019-09-10 07:17:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108555 states to 108555 states and 167154 transitions. [2019-09-10 07:17:42,595 INFO L78 Accepts]: Start accepts. Automaton has 108555 states and 167154 transitions. Word has length 103 [2019-09-10 07:17:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:42,596 INFO L475 AbstractCegarLoop]: Abstraction has 108555 states and 167154 transitions. [2019-09-10 07:17:42,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:17:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 108555 states and 167154 transitions. [2019-09-10 07:17:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:17:42,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:42,620 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] [2019-09-10 07:17:42,620 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:42,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:42,621 INFO L82 PathProgramCache]: Analyzing trace with hash 303097242, now seen corresponding path program 1 times [2019-09-10 07:17:42,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:42,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:42,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:42,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:42,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:42,749 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 07:17:42,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:42,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:17:42,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:42,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:17:42,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:17:42,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:17:42,752 INFO L87 Difference]: Start difference. First operand 108555 states and 167154 transitions. Second operand 5 states. [2019-09-10 07:17:43,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:43,624 INFO L93 Difference]: Finished difference Result 205867 states and 315170 transitions. [2019-09-10 07:17:43,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:17:43,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-10 07:17:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:46,356 INFO L225 Difference]: With dead ends: 205867 [2019-09-10 07:17:46,356 INFO L226 Difference]: Without dead ends: 205867 [2019-09-10 07:17:46,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:17:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205867 states. [2019-09-10 07:17:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205867 to 109707. [2019-09-10 07:17:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109707 states. [2019-09-10 07:17:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109707 states to 109707 states and 168306 transitions. [2019-09-10 07:17:48,596 INFO L78 Accepts]: Start accepts. Automaton has 109707 states and 168306 transitions. Word has length 104 [2019-09-10 07:17:48,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:48,597 INFO L475 AbstractCegarLoop]: Abstraction has 109707 states and 168306 transitions. [2019-09-10 07:17:48,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:17:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 109707 states and 168306 transitions. [2019-09-10 07:17:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:17:48,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:48,618 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] [2019-09-10 07:17:48,619 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1148405721, now seen corresponding path program 1 times [2019-09-10 07:17:48,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:48,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:48,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:48,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:48,742 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 07:17:48,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:48,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:17:48,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:48,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:17:48,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:17:48,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:17:48,749 INFO L87 Difference]: Start difference. First operand 109707 states and 168306 transitions. Second operand 4 states. [2019-09-10 07:17:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:50,096 INFO L93 Difference]: Finished difference Result 205997 states and 313827 transitions. [2019-09-10 07:17:50,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 07:17:50,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-10 07:17:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:50,536 INFO L225 Difference]: With dead ends: 205997 [2019-09-10 07:17:50,536 INFO L226 Difference]: Without dead ends: 205997 [2019-09-10 07:17:50,537 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 07:17:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205997 states. [2019-09-10 07:17:54,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205997 to 205995. [2019-09-10 07:17:54,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205995 states. [2019-09-10 07:17:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205995 states to 205995 states and 313826 transitions. [2019-09-10 07:17:55,935 INFO L78 Accepts]: Start accepts. Automaton has 205995 states and 313826 transitions. Word has length 105 [2019-09-10 07:17:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:17:55,935 INFO L475 AbstractCegarLoop]: Abstraction has 205995 states and 313826 transitions. [2019-09-10 07:17:55,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:17:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 205995 states and 313826 transitions. [2019-09-10 07:17:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:17:55,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:17:55,954 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] [2019-09-10 07:17:55,955 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:17:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:17:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1796571939, now seen corresponding path program 1 times [2019-09-10 07:17:55,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:17:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:55,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:17:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:17:55,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:17:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:17:56,030 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 07:17:56,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:17:56,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:17:56,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:17:56,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:17:56,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:17:56,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:17:56,032 INFO L87 Difference]: Start difference. First operand 205995 states and 313826 transitions. Second operand 3 states. [2019-09-10 07:17:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:17:56,944 INFO L93 Difference]: Finished difference Result 267677 states and 402735 transitions. [2019-09-10 07:17:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:17:56,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:17:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:17:57,290 INFO L225 Difference]: With dead ends: 267677 [2019-09-10 07:17:57,290 INFO L226 Difference]: Without dead ends: 267677 [2019-09-10 07:17:57,290 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 07:17:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267677 states. [2019-09-10 07:18:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267677 to 265968. [2019-09-10 07:18:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265968 states. [2019-09-10 07:18:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265968 states to 265968 states and 401027 transitions. [2019-09-10 07:18:03,708 INFO L78 Accepts]: Start accepts. Automaton has 265968 states and 401027 transitions. Word has length 106 [2019-09-10 07:18:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:03,709 INFO L475 AbstractCegarLoop]: Abstraction has 265968 states and 401027 transitions. [2019-09-10 07:18:03,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 265968 states and 401027 transitions. [2019-09-10 07:18:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:18:03,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:03,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:18:03,727 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1528380005, now seen corresponding path program 1 times [2019-09-10 07:18:03,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:03,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:03,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:03,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:03,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:03,805 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 07:18:03,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:03,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:03,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:03,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:03,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:03,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:03,807 INFO L87 Difference]: Start difference. First operand 265968 states and 401027 transitions. Second operand 3 states. [2019-09-10 07:18:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:09,728 INFO L93 Difference]: Finished difference Result 317739 states and 472226 transitions. [2019-09-10 07:18:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:09,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:18:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:10,235 INFO L225 Difference]: With dead ends: 317739 [2019-09-10 07:18:10,236 INFO L226 Difference]: Without dead ends: 317739 [2019-09-10 07:18:10,236 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 07:18:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317739 states. [2019-09-10 07:18:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317739 to 315735. [2019-09-10 07:18:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315735 states. [2019-09-10 07:18:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315735 states to 315735 states and 470223 transitions. [2019-09-10 07:18:13,752 INFO L78 Accepts]: Start accepts. Automaton has 315735 states and 470223 transitions. Word has length 106 [2019-09-10 07:18:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:13,753 INFO L475 AbstractCegarLoop]: Abstraction has 315735 states and 470223 transitions. [2019-09-10 07:18:13,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 315735 states and 470223 transitions. [2019-09-10 07:18:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:18:13,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:13,778 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] [2019-09-10 07:18:13,778 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:13,779 INFO L82 PathProgramCache]: Analyzing trace with hash -449321198, now seen corresponding path program 1 times [2019-09-10 07:18:13,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:13,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:13,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:13,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:13,856 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 07:18:13,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:13,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:13,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:13,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:13,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:13,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:13,858 INFO L87 Difference]: Start difference. First operand 315735 states and 470223 transitions. Second operand 3 states. [2019-09-10 07:18:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:14,768 INFO L93 Difference]: Finished difference Result 349713 states and 512828 transitions. [2019-09-10 07:18:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:14,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:18:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:15,591 INFO L225 Difference]: With dead ends: 349713 [2019-09-10 07:18:15,592 INFO L226 Difference]: Without dead ends: 347985 [2019-09-10 07:18:15,593 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 07:18:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347985 states. [2019-09-10 07:18:23,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347985 to 310531. [2019-09-10 07:18:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310531 states. [2019-09-10 07:18:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310531 states to 310531 states and 456763 transitions. [2019-09-10 07:18:23,612 INFO L78 Accepts]: Start accepts. Automaton has 310531 states and 456763 transitions. Word has length 106 [2019-09-10 07:18:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:23,612 INFO L475 AbstractCegarLoop]: Abstraction has 310531 states and 456763 transitions. [2019-09-10 07:18:23,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 310531 states and 456763 transitions. [2019-09-10 07:18:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:18:23,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:23,628 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] [2019-09-10 07:18:23,628 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -237205661, now seen corresponding path program 1 times [2019-09-10 07:18:23,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:23,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:23,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:23,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:24,674 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 07:18:24,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:24,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:18:24,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:24,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:18:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:18:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:18:24,676 INFO L87 Difference]: Start difference. First operand 310531 states and 456763 transitions. Second operand 3 states. [2019-09-10 07:18:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:25,647 INFO L93 Difference]: Finished difference Result 333597 states and 482394 transitions. [2019-09-10 07:18:25,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:18:25,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:18:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:26,118 INFO L225 Difference]: With dead ends: 333597 [2019-09-10 07:18:26,118 INFO L226 Difference]: Without dead ends: 333597 [2019-09-10 07:18:26,119 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 07:18:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333597 states. [2019-09-10 07:18:31,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333597 to 331027. [2019-09-10 07:18:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331027 states. [2019-09-10 07:18:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331027 states to 331027 states and 479825 transitions. [2019-09-10 07:18:40,508 INFO L78 Accepts]: Start accepts. Automaton has 331027 states and 479825 transitions. Word has length 106 [2019-09-10 07:18:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:18:40,508 INFO L475 AbstractCegarLoop]: Abstraction has 331027 states and 479825 transitions. [2019-09-10 07:18:40,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:18:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 331027 states and 479825 transitions. [2019-09-10 07:18:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:18:40,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:18:40,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] [2019-09-10 07:18:40,527 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:18:40,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:18:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash -121059675, now seen corresponding path program 1 times [2019-09-10 07:18:40,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:18:40,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:40,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:18:40,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:18:40,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:18:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:18:40,642 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 07:18:40,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:18:40,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:18:40,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:18:40,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:18:40,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:18:40,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:18:40,644 INFO L87 Difference]: Start difference. First operand 331027 states and 479825 transitions. Second operand 7 states. [2019-09-10 07:18:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:18:54,448 INFO L93 Difference]: Finished difference Result 1954519 states and 2795795 transitions. [2019-09-10 07:18:54,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:18:54,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:18:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:18:58,521 INFO L225 Difference]: With dead ends: 1954519 [2019-09-10 07:18:58,522 INFO L226 Difference]: Without dead ends: 1954519 [2019-09-10 07:18:58,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:18:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954519 states. [2019-09-10 07:19:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954519 to 331659. [2019-09-10 07:19:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331659 states. [2019-09-10 07:19:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331659 states to 331659 states and 480655 transitions. [2019-09-10 07:19:21,074 INFO L78 Accepts]: Start accepts. Automaton has 331659 states and 480655 transitions. Word has length 106 [2019-09-10 07:19:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:21,074 INFO L475 AbstractCegarLoop]: Abstraction has 331659 states and 480655 transitions. [2019-09-10 07:19:21,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:19:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 331659 states and 480655 transitions. [2019-09-10 07:19:21,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:19:21,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:21,098 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] [2019-09-10 07:19:21,098 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:21,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1920757475, now seen corresponding path program 1 times [2019-09-10 07:19:21,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:21,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:21,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:21,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:21,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:21,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:21,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:21,175 INFO L87 Difference]: Start difference. First operand 331659 states and 480655 transitions. Second operand 3 states. [2019-09-10 07:19:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:24,023 INFO L93 Difference]: Finished difference Result 599588 states and 862245 transitions. [2019-09-10 07:19:24,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:24,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 07:19:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:24,851 INFO L225 Difference]: With dead ends: 599588 [2019-09-10 07:19:24,852 INFO L226 Difference]: Without dead ends: 599588 [2019-09-10 07:19:24,852 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 07:19:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599588 states. [2019-09-10 07:19:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599588 to 598656. [2019-09-10 07:19:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598656 states. [2019-09-10 07:19:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598656 states to 598656 states and 861314 transitions. [2019-09-10 07:19:38,983 INFO L78 Accepts]: Start accepts. Automaton has 598656 states and 861314 transitions. Word has length 106 [2019-09-10 07:19:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:38,983 INFO L475 AbstractCegarLoop]: Abstraction has 598656 states and 861314 transitions. [2019-09-10 07:19:38,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 598656 states and 861314 transitions. [2019-09-10 07:19:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:19:39,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:39,029 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] [2019-09-10 07:19:39,029 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2046382973, now seen corresponding path program 1 times [2019-09-10 07:19:39,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:39,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:39,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:39,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:39,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:39,148 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 07:19:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:39,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:19:39,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:39,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:19:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:19:39,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:19:39,150 INFO L87 Difference]: Start difference. First operand 598656 states and 861314 transitions. Second operand 7 states. [2019-09-10 07:20:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:04,460 INFO L93 Difference]: Finished difference Result 2834380 states and 4021538 transitions. [2019-09-10 07:20:04,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:20:04,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:20:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:10,541 INFO L225 Difference]: With dead ends: 2834380 [2019-09-10 07:20:10,541 INFO L226 Difference]: Without dead ends: 2834380 [2019-09-10 07:20:10,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:20:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834380 states. [2019-09-10 07:20:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834380 to 601313. [2019-09-10 07:20:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601313 states. [2019-09-10 07:20:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601313 states to 601313 states and 864892 transitions. [2019-09-10 07:20:45,462 INFO L78 Accepts]: Start accepts. Automaton has 601313 states and 864892 transitions. Word has length 106 [2019-09-10 07:20:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:45,462 INFO L475 AbstractCegarLoop]: Abstraction has 601313 states and 864892 transitions. [2019-09-10 07:20:45,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:20:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 601313 states and 864892 transitions. [2019-09-10 07:20:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:20:45,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:45,496 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] [2019-09-10 07:20:45,497 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:45,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:45,497 INFO L82 PathProgramCache]: Analyzing trace with hash 772249746, now seen corresponding path program 1 times [2019-09-10 07:20:45,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:45,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:45,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:45,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:45,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:45,611 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 07:20:45,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:45,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:20:45,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:45,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:20:45,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:20:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:20:45,613 INFO L87 Difference]: Start difference. First operand 601313 states and 864892 transitions. Second operand 7 states. [2019-09-10 07:21:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:01,335 INFO L93 Difference]: Finished difference Result 1855408 states and 2630999 transitions. [2019-09-10 07:21:01,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:21:01,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:21:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:06,439 INFO L225 Difference]: With dead ends: 1855408 [2019-09-10 07:21:06,440 INFO L226 Difference]: Without dead ends: 1855408 [2019-09-10 07:21:06,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:21:07,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855408 states. [2019-09-10 07:21:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855408 to 728140. [2019-09-10 07:21:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728140 states. [2019-09-10 07:21:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728140 states to 728140 states and 1044580 transitions. [2019-09-10 07:21:34,831 INFO L78 Accepts]: Start accepts. Automaton has 728140 states and 1044580 transitions. Word has length 106 [2019-09-10 07:21:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:34,831 INFO L475 AbstractCegarLoop]: Abstraction has 728140 states and 1044580 transitions. [2019-09-10 07:21:34,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:21:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 728140 states and 1044580 transitions. [2019-09-10 07:21:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:21:34,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:34,874 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] [2019-09-10 07:21:34,874 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1051094235, now seen corresponding path program 1 times [2019-09-10 07:21:34,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:34,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:34,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:34,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:34,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:34,992 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 07:21:34,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:34,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:21:34,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:34,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:21:34,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:21:34,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:21:34,995 INFO L87 Difference]: Start difference. First operand 728140 states and 1044580 transitions. Second operand 7 states. [2019-09-10 07:22:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:06,026 INFO L93 Difference]: Finished difference Result 3904113 states and 5523212 transitions. [2019-09-10 07:22:06,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:22:06,027 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:22:06,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:16,211 INFO L225 Difference]: With dead ends: 3904113 [2019-09-10 07:22:16,211 INFO L226 Difference]: Without dead ends: 3904113 [2019-09-10 07:22:16,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:22:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904113 states. [2019-09-10 07:23:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904113 to 730055. [2019-09-10 07:23:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730055 states. [2019-09-10 07:23:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730055 states to 730055 states and 1047122 transitions. [2019-09-10 07:23:07,623 INFO L78 Accepts]: Start accepts. Automaton has 730055 states and 1047122 transitions. Word has length 106 [2019-09-10 07:23:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:07,623 INFO L475 AbstractCegarLoop]: Abstraction has 730055 states and 1047122 transitions. [2019-09-10 07:23:07,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:23:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 730055 states and 1047122 transitions. [2019-09-10 07:23:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:23:07,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:07,669 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] [2019-09-10 07:23:07,670 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1954533251, now seen corresponding path program 1 times [2019-09-10 07:23:07,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:07,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:07,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:07,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:07,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:07,780 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 07:23:07,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:07,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:23:07,781 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:07,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:23:07,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:23:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:23:07,782 INFO L87 Difference]: Start difference. First operand 730055 states and 1047122 transitions. Second operand 7 states. [2019-09-10 07:23:40,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:40,002 INFO L93 Difference]: Finished difference Result 4412051 states and 6245036 transitions. [2019-09-10 07:23:40,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:23:40,002 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-10 07:23:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:09,372 INFO L225 Difference]: With dead ends: 4412051 [2019-09-10 07:24:09,372 INFO L226 Difference]: Without dead ends: 4412051 [2019-09-10 07:24:09,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:24:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4412051 states. [2019-09-10 07:24:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4412051 to 732479. [2019-09-10 07:24:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732479 states. [2019-09-10 07:25:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732479 states to 732479 states and 1050398 transitions. [2019-09-10 07:25:11,852 INFO L78 Accepts]: Start accepts. Automaton has 732479 states and 1050398 transitions. Word has length 106 [2019-09-10 07:25:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:11,853 INFO L475 AbstractCegarLoop]: Abstraction has 732479 states and 1050398 transitions. [2019-09-10 07:25:11,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:25:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 732479 states and 1050398 transitions. [2019-09-10 07:25:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:25:11,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:11,896 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] [2019-09-10 07:25:11,897 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash -48088507, now seen corresponding path program 1 times [2019-09-10 07:25:11,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:11,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:11,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:11,961 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 07:25:11,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:11,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:11,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:11,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:11,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:11,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:11,964 INFO L87 Difference]: Start difference. First operand 732479 states and 1050398 transitions. Second operand 3 states.