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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:15,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:15,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:15,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:15,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:15,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:15,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:15,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:15,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:15,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:15,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:15,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:15,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:15,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:15,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:15,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:15,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:15,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:15,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:15,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:15,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:15,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:15,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:15,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:15,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:15,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:15,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:15,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:15,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:15,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:15,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:15,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:15,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:15,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:15,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:15,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:15,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:15,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:15,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:15,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:15,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:15,301 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,333 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:15,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:15,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:15,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:15,338 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:15,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:15,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:15,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:15,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:15,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:15,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:15,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:15,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:15,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:15,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:15,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:15,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:15,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:15,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:15,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:15,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:15,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:15,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:15,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:15,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:15,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:15,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:15,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:15,348 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,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:15,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:15,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:15,638 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:15,638 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:15,639 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.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 01:23:15,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de928d06/b65949cf87824740a4dbd581a3e833b9/FLAG5f78a4565 [2019-10-15 01:23:16,421 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:16,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 01:23:16,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de928d06/b65949cf87824740a4dbd581a3e833b9/FLAG5f78a4565 [2019-10-15 01:23:16,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de928d06/b65949cf87824740a4dbd581a3e833b9 [2019-10-15 01:23:16,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:16,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:16,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:16,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:16,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:16,567 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,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7f709c 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,570 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,579 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:16,734 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:17,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:17,827 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:18,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:18,181 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:18,182 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,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:18,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:18,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:18,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:18,202 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,203 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,265 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,265 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,340 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,378 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,399 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,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:18,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:18,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:18,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:18,437 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,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:18,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:18,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:18,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:18,513 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:18,514 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:18,515 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,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:18,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:22,088 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:22,090 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:22,093 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,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:22,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:22,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:22,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:22,098 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,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b61aed6 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,099 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,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b61aed6 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,100 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,106 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 01:23:22,117 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:22,139 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 01:23:22,153 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 01:23:22,194 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:22,195 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:22,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:22,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:22,195 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:22,195 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:22,195 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:22,196 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:22,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states. [2019-10-15 01:23:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:22,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:22,258 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:22,260 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:22,266 INFO L82 PathProgramCache]: Analyzing trace with hash 543541410, now seen corresponding path program 1 times [2019-10-15 01:23:22,277 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:22,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298752932] [2019-10-15 01:23:22,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:22,972 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:22,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298752932] [2019-10-15 01:23:22,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:22,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:23:22,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128700554] [2019-10-15 01:23:22,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:23:22,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:23,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:23:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:23:23,004 INFO L87 Difference]: Start difference. First operand 1295 states. Second operand 5 states. [2019-10-15 01:23:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:25,409 INFO L93 Difference]: Finished difference Result 2522 states and 4334 transitions. [2019-10-15 01:23:25,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:25,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-10-15 01:23:25,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:25,448 INFO L225 Difference]: With dead ends: 2522 [2019-10-15 01:23:25,448 INFO L226 Difference]: Without dead ends: 1594 [2019-10-15 01:23:25,463 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:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2019-10-15 01:23:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1588. [2019-10-15 01:23:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2019-10-15 01:23:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2070 transitions. [2019-10-15 01:23:25,674 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2070 transitions. Word has length 56 [2019-10-15 01:23:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:25,675 INFO L462 AbstractCegarLoop]: Abstraction has 1588 states and 2070 transitions. [2019-10-15 01:23:25,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:23:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2070 transitions. [2019-10-15 01:23:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:25,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:25,683 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:25,684 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:25,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:25,685 INFO L82 PathProgramCache]: Analyzing trace with hash 653011577, now seen corresponding path program 1 times [2019-10-15 01:23:25,685 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:25,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17144321] [2019-10-15 01:23:25,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:25,686 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:25,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:26,008 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:26,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17144321] [2019-10-15 01:23:26,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:26,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:26,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477498866] [2019-10-15 01:23:26,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:26,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:26,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:26,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:26,013 INFO L87 Difference]: Start difference. First operand 1588 states and 2070 transitions. Second operand 6 states. [2019-10-15 01:23:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:27,553 INFO L93 Difference]: Finished difference Result 3593 states and 4735 transitions. [2019-10-15 01:23:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:27,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-15 01:23:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:27,574 INFO L225 Difference]: With dead ends: 3593 [2019-10-15 01:23:27,574 INFO L226 Difference]: Without dead ends: 2603 [2019-10-15 01:23:27,579 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,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-10-15 01:23:27,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 2580. [2019-10-15 01:23:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2019-10-15 01:23:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3414 transitions. [2019-10-15 01:23:27,730 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3414 transitions. Word has length 57 [2019-10-15 01:23:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:27,731 INFO L462 AbstractCegarLoop]: Abstraction has 2580 states and 3414 transitions. [2019-10-15 01:23:27,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3414 transitions. [2019-10-15 01:23:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 01:23:27,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:27,735 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:27,735 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:27,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2124615921, now seen corresponding path program 1 times [2019-10-15 01:23:27,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:27,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180575932] [2019-10-15 01:23:27,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:27,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:27,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:27,873 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,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180575932] [2019-10-15 01:23:27,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:27,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:27,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25542074] [2019-10-15 01:23:27,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:27,875 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:27,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:27,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:27,876 INFO L87 Difference]: Start difference. First operand 2580 states and 3414 transitions. Second operand 6 states. [2019-10-15 01:23:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:29,089 INFO L93 Difference]: Finished difference Result 6102 states and 8181 transitions. [2019-10-15 01:23:29,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:29,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-10-15 01:23:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:29,115 INFO L225 Difference]: With dead ends: 6102 [2019-10-15 01:23:29,115 INFO L226 Difference]: Without dead ends: 4454 [2019-10-15 01:23:29,120 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:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2019-10-15 01:23:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4438. [2019-10-15 01:23:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-15 01:23:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5921 transitions. [2019-10-15 01:23:29,309 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5921 transitions. Word has length 57 [2019-10-15 01:23:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:29,310 INFO L462 AbstractCegarLoop]: Abstraction has 4438 states and 5921 transitions. [2019-10-15 01:23:29,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5921 transitions. [2019-10-15 01:23:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:29,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:29,315 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:29,315 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1225390693, now seen corresponding path program 1 times [2019-10-15 01:23:29,316 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:29,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526423469] [2019-10-15 01:23:29,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:29,547 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,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526423469] [2019-10-15 01:23:29,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:29,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:29,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007518437] [2019-10-15 01:23:29,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:29,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:29,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:29,550 INFO L87 Difference]: Start difference. First operand 4438 states and 5921 transitions. Second operand 9 states. [2019-10-15 01:23:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:32,801 INFO L93 Difference]: Finished difference Result 8492 states and 12034 transitions. [2019-10-15 01:23:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-15 01:23:32,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-15 01:23:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:32,844 INFO L225 Difference]: With dead ends: 8492 [2019-10-15 01:23:32,844 INFO L226 Difference]: Without dead ends: 8486 [2019-10-15 01:23:32,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:23:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2019-10-15 01:23:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 4438. [2019-10-15 01:23:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-15 01:23:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5920 transitions. [2019-10-15 01:23:33,150 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5920 transitions. Word has length 59 [2019-10-15 01:23:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:33,151 INFO L462 AbstractCegarLoop]: Abstraction has 4438 states and 5920 transitions. [2019-10-15 01:23:33,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5920 transitions. [2019-10-15 01:23:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:33,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:33,158 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:33,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:33,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2072576560, now seen corresponding path program 1 times [2019-10-15 01:23:33,160 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:33,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415218369] [2019-10-15 01:23:33,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:33,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:33,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:33,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415218369] [2019-10-15 01:23:33,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:33,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:33,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414322992] [2019-10-15 01:23:33,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:33,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:33,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:33,418 INFO L87 Difference]: Start difference. First operand 4438 states and 5920 transitions. Second operand 9 states. [2019-10-15 01:23:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:37,268 INFO L93 Difference]: Finished difference Result 12604 states and 17782 transitions. [2019-10-15 01:23:37,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:23:37,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-10-15 01:23:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:37,318 INFO L225 Difference]: With dead ends: 12604 [2019-10-15 01:23:37,319 INFO L226 Difference]: Without dead ends: 11461 [2019-10-15 01:23:37,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:23:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2019-10-15 01:23:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 4438. [2019-10-15 01:23:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-15 01:23:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5919 transitions. [2019-10-15 01:23:37,721 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5919 transitions. Word has length 59 [2019-10-15 01:23:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:37,722 INFO L462 AbstractCegarLoop]: Abstraction has 4438 states and 5919 transitions. [2019-10-15 01:23:37,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5919 transitions. [2019-10-15 01:23:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 01:23:37,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:37,726 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:37,727 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1462179803, now seen corresponding path program 1 times [2019-10-15 01:23:37,728 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:37,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629926178] [2019-10-15 01:23:37,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:37,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:37,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:37,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629926178] [2019-10-15 01:23:37,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:37,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:23:37,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701006100] [2019-10-15 01:23:37,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:23:37,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:37,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:23:37,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:37,989 INFO L87 Difference]: Start difference. First operand 4438 states and 5919 transitions. Second operand 8 states. [2019-10-15 01:23:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:40,953 INFO L93 Difference]: Finished difference Result 9646 states and 13819 transitions. [2019-10-15 01:23:40,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:23:40,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-10-15 01:23:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:40,980 INFO L225 Difference]: With dead ends: 9646 [2019-10-15 01:23:40,981 INFO L226 Difference]: Without dead ends: 8253 [2019-10-15 01:23:40,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:23:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2019-10-15 01:23:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 4438. [2019-10-15 01:23:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4438 states. [2019-10-15 01:23:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 5918 transitions. [2019-10-15 01:23:41,326 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 5918 transitions. Word has length 59 [2019-10-15 01:23:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:41,327 INFO L462 AbstractCegarLoop]: Abstraction has 4438 states and 5918 transitions. [2019-10-15 01:23:41,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:23:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 5918 transitions. [2019-10-15 01:23:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:41,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:41,334 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, 1] [2019-10-15 01:23:41,335 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 895594476, now seen corresponding path program 1 times [2019-10-15 01:23:41,335 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:41,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340593662] [2019-10-15 01:23:41,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:41,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:41,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:41,446 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,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340593662] [2019-10-15 01:23:41,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:41,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:41,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213396607] [2019-10-15 01:23:41,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:41,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:41,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:41,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:41,449 INFO L87 Difference]: Start difference. First operand 4438 states and 5918 transitions. Second operand 3 states. [2019-10-15 01:23:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:42,051 INFO L93 Difference]: Finished difference Result 8143 states and 11088 transitions. [2019-10-15 01:23:42,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:42,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:23:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:42,075 INFO L225 Difference]: With dead ends: 8143 [2019-10-15 01:23:42,075 INFO L226 Difference]: Without dead ends: 5548 [2019-10-15 01:23:42,084 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,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2019-10-15 01:23:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5542. [2019-10-15 01:23:42,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5542 states. [2019-10-15 01:23:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7349 transitions. [2019-10-15 01:23:42,713 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7349 transitions. Word has length 60 [2019-10-15 01:23:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:42,716 INFO L462 AbstractCegarLoop]: Abstraction has 5542 states and 7349 transitions. [2019-10-15 01:23:42,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7349 transitions. [2019-10-15 01:23:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:42,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:42,724 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, 1] [2019-10-15 01:23:42,724 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:42,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:42,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1516341452, now seen corresponding path program 1 times [2019-10-15 01:23:42,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:42,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238371467] [2019-10-15 01:23:42,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:42,890 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,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238371467] [2019-10-15 01:23:42,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:42,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:42,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638948602] [2019-10-15 01:23:42,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:42,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:42,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:42,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:42,893 INFO L87 Difference]: Start difference. First operand 5542 states and 7349 transitions. Second operand 3 states. [2019-10-15 01:23:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:43,538 INFO L93 Difference]: Finished difference Result 9044 states and 12648 transitions. [2019-10-15 01:23:43,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:43,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:23:43,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:43,555 INFO L225 Difference]: With dead ends: 9044 [2019-10-15 01:23:43,555 INFO L226 Difference]: Without dead ends: 6694 [2019-10-15 01:23:43,564 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,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6694 states. [2019-10-15 01:23:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6694 to 6090. [2019-10-15 01:23:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6090 states. [2019-10-15 01:23:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6090 states to 6090 states and 8232 transitions. [2019-10-15 01:23:44,100 INFO L78 Accepts]: Start accepts. Automaton has 6090 states and 8232 transitions. Word has length 60 [2019-10-15 01:23:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:44,100 INFO L462 AbstractCegarLoop]: Abstraction has 6090 states and 8232 transitions. [2019-10-15 01:23:44,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6090 states and 8232 transitions. [2019-10-15 01:23:44,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 01:23:44,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:44,105 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, 1] [2019-10-15 01:23:44,106 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:44,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:44,106 INFO L82 PathProgramCache]: Analyzing trace with hash -514589220, now seen corresponding path program 1 times [2019-10-15 01:23:44,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:44,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170346401] [2019-10-15 01:23:44,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:44,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:23:44,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170346401] [2019-10-15 01:23:44,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:44,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:44,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256286620] [2019-10-15 01:23:44,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:44,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:44,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:44,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:44,211 INFO L87 Difference]: Start difference. First operand 6090 states and 8232 transitions. Second operand 3 states. [2019-10-15 01:23:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:45,094 INFO L93 Difference]: Finished difference Result 11404 states and 16131 transitions. [2019-10-15 01:23:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:45,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-15 01:23:45,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:45,120 INFO L225 Difference]: With dead ends: 11404 [2019-10-15 01:23:45,120 INFO L226 Difference]: Without dead ends: 8067 [2019-10-15 01:23:45,131 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,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-10-15 01:23:46,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 7151. [2019-10-15 01:23:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-10-15 01:23:46,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 9773 transitions. [2019-10-15 01:23:46,112 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 9773 transitions. Word has length 60 [2019-10-15 01:23:46,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:46,112 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 9773 transitions. [2019-10-15 01:23:46,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 9773 transitions. [2019-10-15 01:23:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 01:23:46,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:46,125 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, 1, 1] [2019-10-15 01:23:46,125 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash -293371609, now seen corresponding path program 1 times [2019-10-15 01:23:46,126 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:46,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778430944] [2019-10-15 01:23:46,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:46,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:46,214 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,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778430944] [2019-10-15 01:23:46,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:46,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:46,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802828483] [2019-10-15 01:23:46,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:46,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:46,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:46,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:46,217 INFO L87 Difference]: Start difference. First operand 7151 states and 9773 transitions. Second operand 3 states. [2019-10-15 01:23:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:47,086 INFO L93 Difference]: Finished difference Result 15308 states and 21660 transitions. [2019-10-15 01:23:47,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:47,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-15 01:23:47,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:47,109 INFO L225 Difference]: With dead ends: 15308 [2019-10-15 01:23:47,109 INFO L226 Difference]: Without dead ends: 9721 [2019-10-15 01:23:47,121 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,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9721 states. [2019-10-15 01:23:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9721 to 7854. [2019-10-15 01:23:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2019-10-15 01:23:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 11004 transitions. [2019-10-15 01:23:47,876 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 11004 transitions. Word has length 61 [2019-10-15 01:23:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:47,876 INFO L462 AbstractCegarLoop]: Abstraction has 7854 states and 11004 transitions. [2019-10-15 01:23:47,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 11004 transitions. [2019-10-15 01:23:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 01:23:47,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:47,880 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, 1, 1] [2019-10-15 01:23:47,880 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2069285283, now seen corresponding path program 1 times [2019-10-15 01:23:47,881 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:47,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776803528] [2019-10-15 01:23:47,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:48,332 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:48,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776803528] [2019-10-15 01:23:48,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:48,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:23:48,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590334614] [2019-10-15 01:23:48,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:23:48,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:23:48,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:23:48,335 INFO L87 Difference]: Start difference. First operand 7854 states and 11004 transitions. Second operand 10 states.