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-f4eb214f-m [2019-10-13 21:24:12,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:12,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:12,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:12,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:12,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:12,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:12,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:12,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:12,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:12,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:12,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:12,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:12,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:12,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:12,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:12,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:12,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:12,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:12,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:12,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:12,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:12,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:12,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:12,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:12,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:12,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:12,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:12,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:12,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:12,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:12,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:12,398 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:12,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:12,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:12,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:12,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:12,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:12,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:12,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:12,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:12,408 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-13 21:24:12,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:12,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:12,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:12,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:12,432 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:12,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:12,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:12,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:12,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:12,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:12,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:12,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:12,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:12,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:12,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:12,436 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:12,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:12,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:12,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:12,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:12,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:12,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:12,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:12,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:12,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:12,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:12,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:12,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:12,439 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-13 21:24:12,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:12,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:12,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:12,738 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:12,739 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:12,739 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-13 21:24:12,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca08b125/2e4803b7cb7c4f428847d31eb389b706/FLAG55ce93e0d [2019-10-13 21:24:13,445 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:13,446 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-13 21:24:13,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca08b125/2e4803b7cb7c4f428847d31eb389b706/FLAG55ce93e0d [2019-10-13 21:24:13,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca08b125/2e4803b7cb7c4f428847d31eb389b706 [2019-10-13 21:24:13,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:13,643 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:13,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:13,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:13,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:13,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:13" (1/1) ... [2019-10-13 21:24:13,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73984100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:13, skipping insertion in model container [2019-10-13 21:24:13,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:13" (1/1) ... [2019-10-13 21:24:13,658 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:13,785 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:14,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:14,778 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:15,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:15,094 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:15,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15 WrapperNode [2019-10-13 21:24:15,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:15,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:15,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:15,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:15,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15" (1/1) ... [2019-10-13 21:24:15,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15" (1/1) ... [2019-10-13 21:24:15,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15" (1/1) ... [2019-10-13 21:24:15,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15" (1/1) ... [2019-10-13 21:24:15,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15" (1/1) ... [2019-10-13 21:24:15,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15" (1/1) ... [2019-10-13 21:24:15,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15" (1/1) ... [2019-10-13 21:24:15,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:15,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:15,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:15,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:15,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15" (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-13 21:24:15,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:15,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:15,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 21:24:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 21:24:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 21:24:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 21:24:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:24:18,503 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:24:18,504 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:24:18,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:18 BoogieIcfgContainer [2019-10-13 21:24:18,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:24:18,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:24:18,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:24:18,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:24:18,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:13" (1/3) ... [2019-10-13 21:24:18,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dbb2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:18, skipping insertion in model container [2019-10-13 21:24:18,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:15" (2/3) ... [2019-10-13 21:24:18,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17dbb2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:18, skipping insertion in model container [2019-10-13 21:24:18,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:18" (3/3) ... [2019-10-13 21:24:18,514 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 21:24:18,523 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:24:18,532 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 21:24:18,543 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 21:24:18,578 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:24:18,578 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:24:18,578 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:24:18,578 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:24:18,579 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:24:18,579 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:24:18,579 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:24:18,579 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:24:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states. [2019-10-13 21:24:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:18,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:18,638 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-13 21:24:18,640 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:18,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2082146872, now seen corresponding path program 1 times [2019-10-13 21:24:18,655 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:18,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722288706] [2019-10-13 21:24:18,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:18,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:19,227 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-13 21:24:19,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722288706] [2019-10-13 21:24:19,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:19,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:19,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101452729] [2019-10-13 21:24:19,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:19,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:19,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:19,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:19,253 INFO L87 Difference]: Start difference. First operand 1126 states. Second operand 6 states. [2019-10-13 21:24:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:20,988 INFO L93 Difference]: Finished difference Result 2122 states and 3724 transitions. [2019-10-13 21:24:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:20,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 21:24:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:21,041 INFO L225 Difference]: With dead ends: 2122 [2019-10-13 21:24:21,041 INFO L226 Difference]: Without dead ends: 1429 [2019-10-13 21:24:21,054 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-13 21:24:21,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2019-10-13 21:24:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1413. [2019-10-13 21:24:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2019-10-13 21:24:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1913 transitions. [2019-10-13 21:24:21,208 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1913 transitions. Word has length 55 [2019-10-13 21:24:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:21,209 INFO L462 AbstractCegarLoop]: Abstraction has 1413 states and 1913 transitions. [2019-10-13 21:24:21,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1913 transitions. [2019-10-13 21:24:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:21,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:21,216 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-13 21:24:21,216 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:21,219 INFO L82 PathProgramCache]: Analyzing trace with hash 995005511, now seen corresponding path program 1 times [2019-10-13 21:24:21,219 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:21,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511676709] [2019-10-13 21:24:21,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:21,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:21,460 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-13 21:24:21,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511676709] [2019-10-13 21:24:21,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:21,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:24:21,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508074650] [2019-10-13 21:24:21,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:24:21,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:21,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:24:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:24:21,465 INFO L87 Difference]: Start difference. First operand 1413 states and 1913 transitions. Second operand 6 states. [2019-10-13 21:24:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:22,761 INFO L93 Difference]: Finished difference Result 3350 states and 4627 transitions. [2019-10-13 21:24:22,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:22,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 21:24:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:22,774 INFO L225 Difference]: With dead ends: 3350 [2019-10-13 21:24:22,775 INFO L226 Difference]: Without dead ends: 2341 [2019-10-13 21:24:22,778 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-13 21:24:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2019-10-13 21:24:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2321. [2019-10-13 21:24:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2019-10-13 21:24:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3206 transitions. [2019-10-13 21:24:22,873 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3206 transitions. Word has length 55 [2019-10-13 21:24:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:22,874 INFO L462 AbstractCegarLoop]: Abstraction has 2321 states and 3206 transitions. [2019-10-13 21:24:22,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:24:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3206 transitions. [2019-10-13 21:24:22,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:24:22,878 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:22,878 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-13 21:24:22,878 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:22,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1195094756, now seen corresponding path program 1 times [2019-10-13 21:24:22,879 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:22,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399349076] [2019-10-13 21:24:22,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:22,880 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:22,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24: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-13 21:24:22,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399349076] [2019-10-13 21:24:22,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:22,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:24:22,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070948937] [2019-10-13 21:24:22,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:24:22,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:24:22,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:24:22,975 INFO L87 Difference]: Start difference. First operand 2321 states and 3206 transitions. Second operand 5 states. [2019-10-13 21:24:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:24,145 INFO L93 Difference]: Finished difference Result 4811 states and 6730 transitions. [2019-10-13 21:24:24,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:24:24,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-13 21:24:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:24,163 INFO L225 Difference]: With dead ends: 4811 [2019-10-13 21:24:24,163 INFO L226 Difference]: Without dead ends: 3583 [2019-10-13 21:24:24,167 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-13 21:24:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2019-10-13 21:24:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3577. [2019-10-13 21:24:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-13 21:24:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4928 transitions. [2019-10-13 21:24:24,320 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4928 transitions. Word has length 55 [2019-10-13 21:24:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:24,322 INFO L462 AbstractCegarLoop]: Abstraction has 3577 states and 4928 transitions. [2019-10-13 21:24:24,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:24:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4928 transitions. [2019-10-13 21:24:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:24,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:24,327 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-13 21:24:24,327 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash 103967417, now seen corresponding path program 1 times [2019-10-13 21:24:24,328 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:24,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511945968] [2019-10-13 21:24:24,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:24,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:24,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:24,593 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-13 21:24:24,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511945968] [2019-10-13 21:24:24,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:24,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:24,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947487598] [2019-10-13 21:24:24,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:24,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:24,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:24,597 INFO L87 Difference]: Start difference. First operand 3577 states and 4928 transitions. Second operand 9 states. [2019-10-13 21:24:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:28,060 INFO L93 Difference]: Finished difference Result 7800 states and 11355 transitions. [2019-10-13 21:24:28,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:24:28,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-13 21:24:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:28,093 INFO L225 Difference]: With dead ends: 7800 [2019-10-13 21:24:28,093 INFO L226 Difference]: Without dead ends: 7795 [2019-10-13 21:24:28,097 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-13 21:24:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7795 states. [2019-10-13 21:24:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7795 to 3577. [2019-10-13 21:24:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-13 21:24:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4927 transitions. [2019-10-13 21:24:28,306 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4927 transitions. Word has length 56 [2019-10-13 21:24:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:28,307 INFO L462 AbstractCegarLoop]: Abstraction has 3577 states and 4927 transitions. [2019-10-13 21:24:28,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4927 transitions. [2019-10-13 21:24:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:28,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:28,312 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-13 21:24:28,312 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1702566800, now seen corresponding path program 1 times [2019-10-13 21:24:28,313 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:28,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801060672] [2019-10-13 21:24:28,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:28,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:28,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:28,506 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-13 21:24:28,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801060672] [2019-10-13 21:24:28,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:28,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:24:28,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091199443] [2019-10-13 21:24:28,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:24:28,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:28,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:24:28,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:24:28,510 INFO L87 Difference]: Start difference. First operand 3577 states and 4927 transitions. Second operand 9 states. [2019-10-13 21:24:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:31,587 INFO L93 Difference]: Finished difference Result 9669 states and 14060 transitions. [2019-10-13 21:24:31,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:24:31,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-10-13 21:24:31,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:31,623 INFO L225 Difference]: With dead ends: 9669 [2019-10-13 21:24:31,624 INFO L226 Difference]: Without dead ends: 8656 [2019-10-13 21:24:31,628 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-13 21:24:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2019-10-13 21:24:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 3577. [2019-10-13 21:24:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-13 21:24:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4926 transitions. [2019-10-13 21:24:31,887 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4926 transitions. Word has length 56 [2019-10-13 21:24:31,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:31,888 INFO L462 AbstractCegarLoop]: Abstraction has 3577 states and 4926 transitions. [2019-10-13 21:24:31,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:24:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4926 transitions. [2019-10-13 21:24:31,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:24:31,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:31,893 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-13 21:24:31,894 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:31,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1133124815, now seen corresponding path program 1 times [2019-10-13 21:24:31,895 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:31,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389993550] [2019-10-13 21:24:31,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:31,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:31,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:32,103 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-13 21:24:32,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389993550] [2019-10-13 21:24:32,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:32,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:24:32,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489793649] [2019-10-13 21:24:32,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:24:32,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:32,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:24:32,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:24:32,106 INFO L87 Difference]: Start difference. First operand 3577 states and 4926 transitions. Second operand 8 states. [2019-10-13 21:24:34,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:34,515 INFO L93 Difference]: Finished difference Result 8367 states and 12323 transitions. [2019-10-13 21:24:34,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:24:34,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-13 21:24:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:34,542 INFO L225 Difference]: With dead ends: 8367 [2019-10-13 21:24:34,543 INFO L226 Difference]: Without dead ends: 7101 [2019-10-13 21:24:34,548 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-13 21:24:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7101 states. [2019-10-13 21:24:34,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7101 to 3577. [2019-10-13 21:24:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3577 states. [2019-10-13 21:24:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 4925 transitions. [2019-10-13 21:24:34,845 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 4925 transitions. Word has length 56 [2019-10-13 21:24:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:34,846 INFO L462 AbstractCegarLoop]: Abstraction has 3577 states and 4925 transitions. [2019-10-13 21:24:34,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:24:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 4925 transitions. [2019-10-13 21:24:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:34,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:34,853 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-13 21:24:34,853 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:34,854 INFO L82 PathProgramCache]: Analyzing trace with hash 609358766, now seen corresponding path program 1 times [2019-10-13 21:24:34,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:34,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378912007] [2019-10-13 21:24:34,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:34,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:34,946 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-13 21:24:34,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378912007] [2019-10-13 21:24:34,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:34,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:34,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58592092] [2019-10-13 21:24:34,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:34,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:34,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:34,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:34,948 INFO L87 Difference]: Start difference. First operand 3577 states and 4925 transitions. Second operand 3 states. [2019-10-13 21:24:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:35,239 INFO L93 Difference]: Finished difference Result 5469 states and 7836 transitions. [2019-10-13 21:24:35,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:35,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 21:24:35,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:35,255 INFO L225 Difference]: With dead ends: 5469 [2019-10-13 21:24:35,256 INFO L226 Difference]: Without dead ends: 3990 [2019-10-13 21:24:35,260 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-13 21:24:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3990 states. [2019-10-13 21:24:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3990 to 3684. [2019-10-13 21:24:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3684 states. [2019-10-13 21:24:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 5107 transitions. [2019-10-13 21:24:35,489 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 5107 transitions. Word has length 57 [2019-10-13 21:24:35,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:35,490 INFO L462 AbstractCegarLoop]: Abstraction has 3684 states and 5107 transitions. [2019-10-13 21:24:35,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 5107 transitions. [2019-10-13 21:24:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:35,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:35,494 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-13 21:24:35,494 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:35,494 INFO L82 PathProgramCache]: Analyzing trace with hash 371035602, now seen corresponding path program 1 times [2019-10-13 21:24:35,495 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:35,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958113995] [2019-10-13 21:24:35,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:35,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:35,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:35,573 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-13 21:24:35,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958113995] [2019-10-13 21:24:35,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:35,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:35,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386636301] [2019-10-13 21:24:35,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:35,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:35,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:35,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:35,575 INFO L87 Difference]: Start difference. First operand 3684 states and 5107 transitions. Second operand 3 states. [2019-10-13 21:24:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:35,997 INFO L93 Difference]: Finished difference Result 6301 states and 9163 transitions. [2019-10-13 21:24:35,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:35,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 21:24:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:36,006 INFO L225 Difference]: With dead ends: 6301 [2019-10-13 21:24:36,006 INFO L226 Difference]: Without dead ends: 4626 [2019-10-13 21:24:36,012 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-13 21:24:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2019-10-13 21:24:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4174. [2019-10-13 21:24:36,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-10-13 21:24:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 5875 transitions. [2019-10-13 21:24:36,500 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 5875 transitions. Word has length 57 [2019-10-13 21:24:36,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:36,501 INFO L462 AbstractCegarLoop]: Abstraction has 4174 states and 5875 transitions. [2019-10-13 21:24:36,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 5875 transitions. [2019-10-13 21:24:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 21:24:36,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:36,506 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-13 21:24:36,507 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:36,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash -369094904, now seen corresponding path program 1 times [2019-10-13 21:24:36,507 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:36,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007022982] [2019-10-13 21:24:36,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:36,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:36,607 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-13 21:24:36,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007022982] [2019-10-13 21:24:36,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:36,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:36,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863193067] [2019-10-13 21:24:36,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:36,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:36,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:36,612 INFO L87 Difference]: Start difference. First operand 4174 states and 5875 transitions. Second operand 3 states. [2019-10-13 21:24:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:37,200 INFO L93 Difference]: Finished difference Result 8364 states and 12201 transitions. [2019-10-13 21:24:37,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:37,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 21:24:37,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:37,212 INFO L225 Difference]: With dead ends: 8364 [2019-10-13 21:24:37,212 INFO L226 Difference]: Without dead ends: 5370 [2019-10-13 21:24:37,220 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-13 21:24:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5370 states. [2019-10-13 21:24:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5370 to 5368. [2019-10-13 21:24:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5368 states. [2019-10-13 21:24:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5368 states to 5368 states and 7645 transitions. [2019-10-13 21:24:37,745 INFO L78 Accepts]: Start accepts. Automaton has 5368 states and 7645 transitions. Word has length 57 [2019-10-13 21:24:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:37,745 INFO L462 AbstractCegarLoop]: Abstraction has 5368 states and 7645 transitions. [2019-10-13 21:24:37,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5368 states and 7645 transitions. [2019-10-13 21:24:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:37,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:37,749 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-13 21:24:37,749 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:37,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:37,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2011629158, now seen corresponding path program 1 times [2019-10-13 21:24:37,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:37,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256708421] [2019-10-13 21:24:37,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,750 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:37,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:37,811 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-13 21:24:37,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256708421] [2019-10-13 21:24:37,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:37,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:37,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573576982] [2019-10-13 21:24:37,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:37,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:37,813 INFO L87 Difference]: Start difference. First operand 5368 states and 7645 transitions. Second operand 3 states. [2019-10-13 21:24:38,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:38,666 INFO L93 Difference]: Finished difference Result 12677 states and 18597 transitions. [2019-10-13 21:24:38,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:38,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 21:24:38,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:38,683 INFO L225 Difference]: With dead ends: 12677 [2019-10-13 21:24:38,683 INFO L226 Difference]: Without dead ends: 8089 [2019-10-13 21:24:38,691 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-13 21:24:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2019-10-13 21:24:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 6379. [2019-10-13 21:24:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6379 states. [2019-10-13 21:24:39,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 9282 transitions. [2019-10-13 21:24:39,193 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 9282 transitions. Word has length 58 [2019-10-13 21:24:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:39,194 INFO L462 AbstractCegarLoop]: Abstraction has 6379 states and 9282 transitions. [2019-10-13 21:24:39,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 9282 transitions. [2019-10-13 21:24:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 21:24:39,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:39,196 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-13 21:24:39,201 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash 883688950, now seen corresponding path program 1 times [2019-10-13 21:24:39,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:39,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955103151] [2019-10-13 21:24:39,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:39,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:39,255 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-13 21:24:39,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955103151] [2019-10-13 21:24:39,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:39,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:24:39,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223224794] [2019-10-13 21:24:39,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:24:39,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:39,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:24:39,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:24:39,257 INFO L87 Difference]: Start difference. First operand 6379 states and 9282 transitions. Second operand 3 states. [2019-10-13 21:24:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:24:40,206 INFO L93 Difference]: Finished difference Result 16222 states and 24049 transitions. [2019-10-13 21:24:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:24:40,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 21:24:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:24:40,230 INFO L225 Difference]: With dead ends: 16222 [2019-10-13 21:24:40,231 INFO L226 Difference]: Without dead ends: 10378 [2019-10-13 21:24:40,242 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-13 21:24:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-10-13 21:24:40,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 8062. [2019-10-13 21:24:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8062 states. [2019-10-13 21:24:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8062 states to 8062 states and 11884 transitions. [2019-10-13 21:24:40,995 INFO L78 Accepts]: Start accepts. Automaton has 8062 states and 11884 transitions. Word has length 58 [2019-10-13 21:24:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:24:40,995 INFO L462 AbstractCegarLoop]: Abstraction has 8062 states and 11884 transitions. [2019-10-13 21:24:40,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:24:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 8062 states and 11884 transitions. [2019-10-13 21:24:40,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 21:24:40,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:24:40,998 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-13 21:24:40,998 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:24:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:24:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash -550232989, now seen corresponding path program 1 times [2019-10-13 21:24:40,999 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:24:40,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47055424] [2019-10-13 21:24:40,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:40,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:24:41,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:24:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:24:41,632 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-13 21:24:41,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47055424] [2019-10-13 21:24:41,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:24:41,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-13 21:24:41,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458911242] [2019-10-13 21:24:41,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:24:41,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:24:41,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:24:41,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:24:41,633 INFO L87 Difference]: Start difference. First operand 8062 states and 11884 transitions. Second operand 19 states. [2019-10-13 21:24:41,828 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2019-10-13 21:24:42,572 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-10-13 21:24:42,791 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-10-13 21:24:43,022 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-13 21:24:43,184 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47