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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:15,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:15,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:15,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:15,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:15,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:15,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:15,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:15,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:15,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:15,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:15,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:15,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:15,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:15,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:15,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:15,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:15,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:15,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:15,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:15,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:15,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:15,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:15,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:15,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:15,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:15,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:15,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:15,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:15,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:15,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:15,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:15,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:15,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:15,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:15,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:15,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:15,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:15,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:15,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:15,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:15,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:23:15,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:15,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:15,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:15,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:15,269 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:15,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:15,270 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:15,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:15,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:15,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:15,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:15,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:15,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:15,271 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:15,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:15,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:15,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:15,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:15,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:15,272 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:15,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:15,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:15,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:15,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:15,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:15,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:15,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:15,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:15,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:23:15,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:15,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:15,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:15,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:15,595 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:15,596 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.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 01:23:15,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b9ae46d/86ca10acdce34ee9bb920e99c6ea6c9f/FLAG87b8326ff [2019-10-15 01:23:16,443 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:16,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 01:23:16,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b9ae46d/86ca10acdce34ee9bb920e99c6ea6c9f/FLAG87b8326ff [2019-10-15 01:23:16,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b9ae46d/86ca10acdce34ee9bb920e99c6ea6c9f [2019-10-15 01:23:16,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:16,540 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:16,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:16,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:16,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:16,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:16" (1/1) ... [2019-10-15 01:23:16,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb64a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:16, skipping insertion in model container [2019-10-15 01:23:16,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:16" (1/1) ... [2019-10-15 01:23:16,561 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:16,709 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:17,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:17,793 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:18,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:18,161 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:18,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18 WrapperNode [2019-10-15 01:23:18,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:18,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:18,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:18,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:18,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18" (1/1) ... [2019-10-15 01:23:18,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18" (1/1) ... [2019-10-15 01:23:18,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18" (1/1) ... [2019-10-15 01:23:18,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18" (1/1) ... [2019-10-15 01:23:18,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18" (1/1) ... [2019-10-15 01:23:18,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18" (1/1) ... [2019-10-15 01:23:18,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18" (1/1) ... [2019-10-15 01:23:18,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:18,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:18,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:18,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:18,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18" (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-10-15 01:23:18,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:18,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:18,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:18,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:18,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:18,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:18,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:18,510 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:18,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:18,511 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:18,511 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:18,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:22,425 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:22,426 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:22,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:22 BoogieIcfgContainer [2019-10-15 01:23:22,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:22,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:22,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:22,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:22,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:16" (1/3) ... [2019-10-15 01:23:22,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cef095f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:22, skipping insertion in model container [2019-10-15 01:23:22,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:18" (2/3) ... [2019-10-15 01:23:22,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cef095f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:22, skipping insertion in model container [2019-10-15 01:23:22,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:22" (3/3) ... [2019-10-15 01:23:22,444 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-15 01:23:22,455 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:22,465 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 01:23:22,477 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 01:23:22,513 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:22,513 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:22,513 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:22,514 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:22,514 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:22,514 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:22,514 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:22,514 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states. [2019-10-15 01:23:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:22,573 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:22,574 INFO L380 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] [2019-10-15 01:23:22,576 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:22,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:22,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2082146872, now seen corresponding path program 1 times [2019-10-15 01:23:22,592 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:22,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083211445] [2019-10-15 01:23:22,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:23,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083211445] [2019-10-15 01:23:23,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:23,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:23,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693811547] [2019-10-15 01:23:23,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:23,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:23,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:23,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:23,229 INFO L87 Difference]: Start difference. First operand 1126 states. Second operand 6 states. [2019-10-15 01:23:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:25,360 INFO L93 Difference]: Finished difference Result 2122 states and 3724 transitions. [2019-10-15 01:23:25,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:25,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 01:23:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:25,393 INFO L225 Difference]: With dead ends: 2122 [2019-10-15 01:23:25,393 INFO L226 Difference]: Without dead ends: 1429 [2019-10-15 01:23:25,403 INFO L600 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-10-15 01:23:25,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2019-10-15 01:23:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1413. [2019-10-15 01:23:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-10-15 01:23:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1913 transitions. [2019-10-15 01:23:25,557 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1913 transitions. Word has length 55 [2019-10-15 01:23:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:25,558 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 1913 transitions. [2019-10-15 01:23:25,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1913 transitions. [2019-10-15 01:23:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:25,564 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:25,565 INFO L380 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] [2019-10-15 01:23:25,565 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:25,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash 995005511, now seen corresponding path program 1 times [2019-10-15 01:23:25,566 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:25,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700327085] [2019-10-15 01:23:25,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:25,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:25,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:25,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700327085] [2019-10-15 01:23:25,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:25,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:25,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121705264] [2019-10-15 01:23:25,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:25,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:25,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:25,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:25,800 INFO L87 Difference]: Start difference. First operand 1413 states and 1913 transitions. Second operand 6 states. [2019-10-15 01:23:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:27,330 INFO L93 Difference]: Finished difference Result 3350 states and 4627 transitions. [2019-10-15 01:23:27,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:27,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 01:23:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:27,345 INFO L225 Difference]: With dead ends: 3350 [2019-10-15 01:23:27,345 INFO L226 Difference]: Without dead ends: 2341 [2019-10-15 01:23:27,349 INFO L600 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-10-15 01:23:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2019-10-15 01:23:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2321. [2019-10-15 01:23:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-10-15 01:23:27,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3206 transitions. [2019-10-15 01:23:27,459 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3206 transitions. Word has length 55 [2019-10-15 01:23:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:27,460 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 3206 transitions. [2019-10-15 01:23:27,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3206 transitions. [2019-10-15 01:23:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:27,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:27,464 INFO L380 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] [2019-10-15 01:23:27,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:27,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1195094756, now seen corresponding path program 1 times [2019-10-15 01:23:27,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:27,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484782902] [2019-10-15 01:23:27,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:27,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:27,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:27,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484782902] [2019-10-15 01:23:27,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:27,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:27,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717661966] [2019-10-15 01:23:27,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:27,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:27,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:27,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:27,644 INFO L87 Difference]: Start difference. First operand 2321 states and 3206 transitions. Second operand 5 states. [2019-10-15 01:23:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:29,183 INFO L93 Difference]: Finished difference Result 4811 states and 6730 transitions. [2019-10-15 01:23:29,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:29,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-15 01:23:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:29,204 INFO L225 Difference]: With dead ends: 4811 [2019-10-15 01:23:29,204 INFO L226 Difference]: Without dead ends: 3583 [2019-10-15 01:23:29,209 INFO L600 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-10-15 01:23:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2019-10-15 01:23:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3577. [2019-10-15 01:23:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-15 01:23:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4928 transitions. [2019-10-15 01:23:29,373 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4928 transitions. Word has length 55 [2019-10-15 01:23:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:29,373 INFO L462 AbstractCegarLoop]: Abstraction has 3577 states and 4928 transitions. [2019-10-15 01:23:29,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4928 transitions. [2019-10-15 01:23:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:29,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:29,378 INFO L380 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] [2019-10-15 01:23:29,378 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:29,379 INFO L82 PathProgramCache]: Analyzing trace with hash 103967417, now seen corresponding path program 1 times [2019-10-15 01:23:29,379 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:29,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229917570] [2019-10-15 01:23:29,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:29,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229917570] [2019-10-15 01:23:29,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:29,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:29,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209160666] [2019-10-15 01:23:29,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:29,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:29,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:29,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:29,627 INFO L87 Difference]: Start difference. First operand 3577 states and 4928 transitions. Second operand 9 states. [2019-10-15 01:23:30,748 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 20 [2019-10-15 01:23:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:33,811 INFO L93 Difference]: Finished difference Result 7800 states and 11355 transitions. [2019-10-15 01:23:33,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:23:33,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-15 01:23:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:33,861 INFO L225 Difference]: With dead ends: 7800 [2019-10-15 01:23:33,862 INFO L226 Difference]: Without dead ends: 7795 [2019-10-15 01:23:33,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:23:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7795 states. [2019-10-15 01:23:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7795 to 3577. [2019-10-15 01:23:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-15 01:23:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4927 transitions. [2019-10-15 01:23:34,194 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4927 transitions. Word has length 56 [2019-10-15 01:23:34,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:34,195 INFO L462 AbstractCegarLoop]: Abstraction has 3577 states and 4927 transitions. [2019-10-15 01:23:34,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:34,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4927 transitions. [2019-10-15 01:23:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:34,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:34,201 INFO L380 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] [2019-10-15 01:23:34,201 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:34,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1702566800, now seen corresponding path program 1 times [2019-10-15 01:23:34,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:34,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755728143] [2019-10-15 01:23:34,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:34,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:34,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:34,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755728143] [2019-10-15 01:23:34,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:34,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:34,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036743352] [2019-10-15 01:23:34,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:34,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:34,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:34,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:34,435 INFO L87 Difference]: Start difference. First operand 3577 states and 4927 transitions. Second operand 9 states. [2019-10-15 01:23:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:37,981 INFO L93 Difference]: Finished difference Result 9669 states and 14060 transitions. [2019-10-15 01:23:37,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:23:37,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-15 01:23:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:38,023 INFO L225 Difference]: With dead ends: 9669 [2019-10-15 01:23:38,023 INFO L226 Difference]: Without dead ends: 8656 [2019-10-15 01:23:38,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:23:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2019-10-15 01:23:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 3577. [2019-10-15 01:23:38,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-15 01:23:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4926 transitions. [2019-10-15 01:23:38,323 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4926 transitions. Word has length 56 [2019-10-15 01:23:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:38,324 INFO L462 AbstractCegarLoop]: Abstraction has 3577 states and 4926 transitions. [2019-10-15 01:23:38,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:38,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4926 transitions. [2019-10-15 01:23:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:38,329 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:38,329 INFO L380 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] [2019-10-15 01:23:38,330 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1133124815, now seen corresponding path program 1 times [2019-10-15 01:23:38,331 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:38,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542673499] [2019-10-15 01:23:38,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:38,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:38,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542673499] [2019-10-15 01:23:38,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:38,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:23:38,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928886855] [2019-10-15 01:23:38,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:23:38,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:23:38,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:38,568 INFO L87 Difference]: Start difference. First operand 3577 states and 4926 transitions. Second operand 8 states. [2019-10-15 01:23:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:41,410 INFO L93 Difference]: Finished difference Result 8367 states and 12323 transitions. [2019-10-15 01:23:41,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:23:41,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-15 01:23:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:41,443 INFO L225 Difference]: With dead ends: 8367 [2019-10-15 01:23:41,444 INFO L226 Difference]: Without dead ends: 7101 [2019-10-15 01:23:41,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:23:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7101 states. [2019-10-15 01:23:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7101 to 3577. [2019-10-15 01:23:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-15 01:23:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4925 transitions. [2019-10-15 01:23:41,776 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4925 transitions. Word has length 56 [2019-10-15 01:23:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:41,776 INFO L462 AbstractCegarLoop]: Abstraction has 3577 states and 4925 transitions. [2019-10-15 01:23:41,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:23:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4925 transitions. [2019-10-15 01:23:41,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:41,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:41,783 INFO L380 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] [2019-10-15 01:23:41,784 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:41,784 INFO L82 PathProgramCache]: Analyzing trace with hash 609358766, now seen corresponding path program 1 times [2019-10-15 01:23:41,784 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:41,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137090156] [2019-10-15 01:23:41,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:41,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:41,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:41,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137090156] [2019-10-15 01:23:41,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:41,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:41,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804172379] [2019-10-15 01:23:41,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:41,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:41,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:41,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:41,875 INFO L87 Difference]: Start difference. First operand 3577 states and 4925 transitions. Second operand 3 states. [2019-10-15 01:23:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:42,211 INFO L93 Difference]: Finished difference Result 5469 states and 7836 transitions. [2019-10-15 01:23:42,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:42,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 01:23:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:42,222 INFO L225 Difference]: With dead ends: 5469 [2019-10-15 01:23:42,223 INFO L226 Difference]: Without dead ends: 3990 [2019-10-15 01:23:42,227 INFO L600 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-10-15 01:23:42,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2019-10-15 01:23:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3684. [2019-10-15 01:23:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3684 states. [2019-10-15 01:23:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 5107 transitions. [2019-10-15 01:23:42,467 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 5107 transitions. Word has length 57 [2019-10-15 01:23:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:42,468 INFO L462 AbstractCegarLoop]: Abstraction has 3684 states and 5107 transitions. [2019-10-15 01:23:42,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 5107 transitions. [2019-10-15 01:23:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:42,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:42,472 INFO L380 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] [2019-10-15 01:23:42,472 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:42,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:42,473 INFO L82 PathProgramCache]: Analyzing trace with hash 371035602, now seen corresponding path program 1 times [2019-10-15 01:23:42,473 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:42,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787655486] [2019-10-15 01:23:42,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:42,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787655486] [2019-10-15 01:23:42,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:42,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:42,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921991156] [2019-10-15 01:23:42,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:42,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:42,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:42,547 INFO L87 Difference]: Start difference. First operand 3684 states and 5107 transitions. Second operand 3 states. [2019-10-15 01:23:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:43,205 INFO L93 Difference]: Finished difference Result 6301 states and 9163 transitions. [2019-10-15 01:23:43,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:43,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 01:23:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:43,216 INFO L225 Difference]: With dead ends: 6301 [2019-10-15 01:23:43,217 INFO L226 Difference]: Without dead ends: 4626 [2019-10-15 01:23:43,221 INFO L600 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-10-15 01:23:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2019-10-15 01:23:43,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4174. [2019-10-15 01:23:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-10-15 01:23:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 5875 transitions. [2019-10-15 01:23:43,486 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 5875 transitions. Word has length 57 [2019-10-15 01:23:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:43,486 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 5875 transitions. [2019-10-15 01:23:43,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:43,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 5875 transitions. [2019-10-15 01:23:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:43,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:43,490 INFO L380 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] [2019-10-15 01:23:43,491 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:43,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:43,491 INFO L82 PathProgramCache]: Analyzing trace with hash -369094904, now seen corresponding path program 1 times [2019-10-15 01:23:43,491 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:43,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981357932] [2019-10-15 01:23:43,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:43,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:43,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981357932] [2019-10-15 01:23:43,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:43,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:43,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705294142] [2019-10-15 01:23:43,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:43,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:43,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:43,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:43,571 INFO L87 Difference]: Start difference. First operand 4174 states and 5875 transitions. Second operand 3 states. [2019-10-15 01:23:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:44,354 INFO L93 Difference]: Finished difference Result 8364 states and 12201 transitions. [2019-10-15 01:23:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:44,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 01:23:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:44,369 INFO L225 Difference]: With dead ends: 8364 [2019-10-15 01:23:44,369 INFO L226 Difference]: Without dead ends: 5370 [2019-10-15 01:23:44,377 INFO L600 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-10-15 01:23:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5370 states. [2019-10-15 01:23:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5370 to 5368. [2019-10-15 01:23:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5368 states. [2019-10-15 01:23:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7645 transitions. [2019-10-15 01:23:44,894 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7645 transitions. Word has length 57 [2019-10-15 01:23:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:44,895 INFO L462 AbstractCegarLoop]: Abstraction has 5368 states and 7645 transitions. [2019-10-15 01:23:44,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7645 transitions. [2019-10-15 01:23:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:44,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:44,899 INFO L380 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] [2019-10-15 01:23:44,899 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2011629158, now seen corresponding path program 1 times [2019-10-15 01:23:44,900 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:44,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059588768] [2019-10-15 01:23:44,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:44,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059588768] [2019-10-15 01:23:44,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:44,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:44,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39663997] [2019-10-15 01:23:44,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:44,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:44,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:44,962 INFO L87 Difference]: Start difference. First operand 5368 states and 7645 transitions. Second operand 3 states. [2019-10-15 01:23:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:45,894 INFO L93 Difference]: Finished difference Result 12677 states and 18597 transitions. [2019-10-15 01:23:45,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:45,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:23:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:45,911 INFO L225 Difference]: With dead ends: 12677 [2019-10-15 01:23:45,911 INFO L226 Difference]: Without dead ends: 8089 [2019-10-15 01:23:45,921 INFO L600 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-10-15 01:23:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2019-10-15 01:23:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 6379. [2019-10-15 01:23:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6379 states. [2019-10-15 01:23:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 9282 transitions. [2019-10-15 01:23:46,482 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 9282 transitions. Word has length 58 [2019-10-15 01:23:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:46,482 INFO L462 AbstractCegarLoop]: Abstraction has 6379 states and 9282 transitions. [2019-10-15 01:23:46,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 9282 transitions. [2019-10-15 01:23:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:23:46,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:46,484 INFO L380 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] [2019-10-15 01:23:46,485 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash 883688950, now seen corresponding path program 1 times [2019-10-15 01:23:46,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:46,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55064765] [2019-10-15 01:23:46,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:46,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55064765] [2019-10-15 01:23:46,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:46,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:46,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525329580] [2019-10-15 01:23:46,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:46,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:46,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:46,546 INFO L87 Difference]: Start difference. First operand 6379 states and 9282 transitions. Second operand 3 states. [2019-10-15 01:23:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:47,407 INFO L93 Difference]: Finished difference Result 16222 states and 24049 transitions. [2019-10-15 01:23:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:47,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 01:23:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:47,432 INFO L225 Difference]: With dead ends: 16222 [2019-10-15 01:23:47,432 INFO L226 Difference]: Without dead ends: 10378 [2019-10-15 01:23:47,446 INFO L600 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-10-15 01:23:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-10-15 01:23:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 8062. [2019-10-15 01:23:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8062 states. [2019-10-15 01:23:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8062 states to 8062 states and 11884 transitions. [2019-10-15 01:23:48,281 INFO L78 Accepts]: Start accepts. Automaton has 8062 states and 11884 transitions. Word has length 58 [2019-10-15 01:23:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:48,281 INFO L462 AbstractCegarLoop]: Abstraction has 8062 states and 11884 transitions. [2019-10-15 01:23:48,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8062 states and 11884 transitions. [2019-10-15 01:23:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:48,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:48,282 INFO L380 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] [2019-10-15 01:23:48,283 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:48,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:48,283 INFO L82 PathProgramCache]: Analyzing trace with hash -550232989, now seen corresponding path program 1 times [2019-10-15 01:23:48,283 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:48,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982001862] [2019-10-15 01:23:48,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:48,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat