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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:22,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:22,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:22,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:22,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:22,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:22,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:22,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:22,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:22,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:22,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:22,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:22,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:22,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:22,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:22,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:22,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:22,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:22,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:22,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:22,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:22,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:22,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:22,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:22,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:22,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:22,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:22,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:22,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:22,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:22,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:22,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:22,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:22,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:22,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:22,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:22,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:22,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:22,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:22,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:22,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:22,085 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 03:26:22,105 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:22,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:22,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:22,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:22,108 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:22,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:22,108 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:22,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:22,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:22,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:22,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:22,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:22,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:22,111 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:22,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:22,111 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:22,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:22,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:22,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:22,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:22,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:22,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:22,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:22,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:22,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:22,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:22,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:22,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:22,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:26:22,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:22,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:22,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:22,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:22,435 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:22,436 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.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 03:26:22,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f41e1e0/4d59af6b68364084aa8283a5e9c890a1/FLAG092ef2a76 [2019-10-15 03:26:23,283 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:23,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 03:26:23,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f41e1e0/4d59af6b68364084aa8283a5e9c890a1/FLAG092ef2a76 [2019-10-15 03:26:23,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f41e1e0/4d59af6b68364084aa8283a5e9c890a1 [2019-10-15 03:26:23,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:23,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:23,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:23,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:23,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:23,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:23" (1/1) ... [2019-10-15 03:26:23,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3729bd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:23, skipping insertion in model container [2019-10-15 03:26:23,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:23" (1/1) ... [2019-10-15 03:26:23,380 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:23,545 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:24,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:24,731 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:25,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:25,103 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:25,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25 WrapperNode [2019-10-15 03:26:25,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:25,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:25,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:25,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:25,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25" (1/1) ... [2019-10-15 03:26:25,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25" (1/1) ... [2019-10-15 03:26:25,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25" (1/1) ... [2019-10-15 03:26:25,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25" (1/1) ... [2019-10-15 03:26:25,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25" (1/1) ... [2019-10-15 03:26:25,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25" (1/1) ... [2019-10-15 03:26:25,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25" (1/1) ... [2019-10-15 03:26:25,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:25,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:25,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:25,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:25,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25" (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 03:26:25,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:25,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:25,432 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:25,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:25,433 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:25,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:25,433 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:25,433 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:25,433 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:25,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:25,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:29,547 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:29,548 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:29,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:29 BoogieIcfgContainer [2019-10-15 03:26:29,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:29,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:29,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:29,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:29,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:23" (1/3) ... [2019-10-15 03:26:29,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206965b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:29, skipping insertion in model container [2019-10-15 03:26:29,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:25" (2/3) ... [2019-10-15 03:26:29,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@206965b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:29, skipping insertion in model container [2019-10-15 03:26:29,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:29" (3/3) ... [2019-10-15 03:26:29,558 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-15 03:26:29,568 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:29,578 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-15 03:26:29,589 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-15 03:26:29,624 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:29,624 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:29,625 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:29,625 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:29,625 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:29,625 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:29,625 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:29,625 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states. [2019-10-15 03:26:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:29,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:29,685 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:29,687 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash 733972695, now seen corresponding path program 1 times [2019-10-15 03:26:29,703 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:29,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981260861] [2019-10-15 03:26:29,703 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:29,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:29,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:30,384 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 03:26:30,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981260861] [2019-10-15 03:26:30,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:30,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:30,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431688079] [2019-10-15 03:26:30,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:30,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:30,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:30,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:30,411 INFO L87 Difference]: Start difference. First operand 1140 states. Second operand 6 states. [2019-10-15 03:26:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:32,197 INFO L93 Difference]: Finished difference Result 2212 states and 3775 transitions. [2019-10-15 03:26:32,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:32,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 03:26:32,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:32,237 INFO L225 Difference]: With dead ends: 2212 [2019-10-15 03:26:32,237 INFO L226 Difference]: Without dead ends: 1488 [2019-10-15 03:26:32,251 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 03:26:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-10-15 03:26:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1465. [2019-10-15 03:26:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-10-15 03:26:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1840 transitions. [2019-10-15 03:26:32,430 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1840 transitions. Word has length 55 [2019-10-15 03:26:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:32,431 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 1840 transitions. [2019-10-15 03:26:32,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1840 transitions. [2019-10-15 03:26:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:32,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:32,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:32,494 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2111314929, now seen corresponding path program 1 times [2019-10-15 03:26:32,495 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:32,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362329008] [2019-10-15 03:26:32,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:32,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:32,754 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 03:26:32,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362329008] [2019-10-15 03:26:32,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:32,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:32,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726938305] [2019-10-15 03:26:32,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:32,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:32,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:32,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:32,760 INFO L87 Difference]: Start difference. First operand 1465 states and 1840 transitions. Second operand 6 states. [2019-10-15 03:26:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:34,148 INFO L93 Difference]: Finished difference Result 3061 states and 3889 transitions. [2019-10-15 03:26:34,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:34,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 03:26:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:34,165 INFO L225 Difference]: With dead ends: 3061 [2019-10-15 03:26:34,165 INFO L226 Difference]: Without dead ends: 2199 [2019-10-15 03:26:34,170 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 03:26:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2019-10-15 03:26:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 2183. [2019-10-15 03:26:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2019-10-15 03:26:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2764 transitions. [2019-10-15 03:26:34,279 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2764 transitions. Word has length 55 [2019-10-15 03:26:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:34,280 INFO L462 AbstractCegarLoop]: Abstraction has 2183 states and 2764 transitions. [2019-10-15 03:26:34,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2764 transitions. [2019-10-15 03:26:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:34,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:34,288 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:34,289 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:34,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1234087864, now seen corresponding path program 1 times [2019-10-15 03:26:34,290 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:34,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004631413] [2019-10-15 03:26:34,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:34,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:34,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:34,541 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 03:26:34,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004631413] [2019-10-15 03:26:34,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:34,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:34,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985364656] [2019-10-15 03:26:34,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:34,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:34,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:34,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:34,544 INFO L87 Difference]: Start difference. First operand 2183 states and 2764 transitions. Second operand 5 states. [2019-10-15 03:26:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:36,014 INFO L93 Difference]: Finished difference Result 4401 states and 5595 transitions. [2019-10-15 03:26:36,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:36,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-15 03:26:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:36,036 INFO L225 Difference]: With dead ends: 4401 [2019-10-15 03:26:36,036 INFO L226 Difference]: Without dead ends: 3325 [2019-10-15 03:26:36,040 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 03:26:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2019-10-15 03:26:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3319. [2019-10-15 03:26:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-15 03:26:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4153 transitions. [2019-10-15 03:26:36,372 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4153 transitions. Word has length 55 [2019-10-15 03:26:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:36,376 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4153 transitions. [2019-10-15 03:26:36,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:36,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4153 transitions. [2019-10-15 03:26:36,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:26:36,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:36,383 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 03:26:36,383 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:36,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash -374787316, now seen corresponding path program 1 times [2019-10-15 03:26:36,384 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:36,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809135843] [2019-10-15 03:26:36,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:36,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:36,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:36,781 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 03:26:36,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809135843] [2019-10-15 03:26:36,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:36,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:26:36,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640907303] [2019-10-15 03:26:36,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:26:36,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:36,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:26:36,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:36,786 INFO L87 Difference]: Start difference. First operand 3319 states and 4153 transitions. Second operand 8 states. [2019-10-15 03:26:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:39,472 INFO L93 Difference]: Finished difference Result 7454 states and 9846 transitions. [2019-10-15 03:26:39,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:26:39,473 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-15 03:26:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:39,506 INFO L225 Difference]: With dead ends: 7454 [2019-10-15 03:26:39,506 INFO L226 Difference]: Without dead ends: 6490 [2019-10-15 03:26:39,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-15 03:26:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6490 states. [2019-10-15 03:26:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6490 to 3319. [2019-10-15 03:26:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-15 03:26:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4152 transitions. [2019-10-15 03:26:39,826 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4152 transitions. Word has length 57 [2019-10-15 03:26:39,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:39,827 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4152 transitions. [2019-10-15 03:26:39,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:26:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4152 transitions. [2019-10-15 03:26:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:26:39,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:39,833 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 03:26:39,833 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:39,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:39,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1908353876, now seen corresponding path program 1 times [2019-10-15 03:26:39,834 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:39,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873086930] [2019-10-15 03:26:39,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:39,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:39,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:40,071 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 03:26:40,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873086930] [2019-10-15 03:26:40,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:40,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:40,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918161450] [2019-10-15 03:26:40,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:40,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:40,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:40,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:40,074 INFO L87 Difference]: Start difference. First operand 3319 states and 4152 transitions. Second operand 9 states. [2019-10-15 03:26:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:42,956 INFO L93 Difference]: Finished difference Result 5403 states and 6945 transitions. [2019-10-15 03:26:42,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-15 03:26:42,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-15 03:26:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:42,979 INFO L225 Difference]: With dead ends: 5403 [2019-10-15 03:26:42,980 INFO L226 Difference]: Without dead ends: 5397 [2019-10-15 03:26:42,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-10-15 03:26:42,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2019-10-15 03:26:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 3319. [2019-10-15 03:26:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-15 03:26:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4151 transitions. [2019-10-15 03:26:43,226 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4151 transitions. Word has length 57 [2019-10-15 03:26:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:43,229 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4151 transitions. [2019-10-15 03:26:43,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4151 transitions. [2019-10-15 03:26:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:26:43,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:43,233 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 03:26:43,233 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:43,234 INFO L82 PathProgramCache]: Analyzing trace with hash -171785464, now seen corresponding path program 1 times [2019-10-15 03:26:43,234 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:43,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518373711] [2019-10-15 03:26:43,234 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:43,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:43,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:43,478 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 03:26:43,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518373711] [2019-10-15 03:26:43,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:43,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:26:43,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261858833] [2019-10-15 03:26:43,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:26:43,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:26:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:26:43,480 INFO L87 Difference]: Start difference. First operand 3319 states and 4151 transitions. Second operand 9 states. [2019-10-15 03:26:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:46,541 INFO L93 Difference]: Finished difference Result 6995 states and 9012 transitions. [2019-10-15 03:26:46,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:26:46,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-15 03:26:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:46,584 INFO L225 Difference]: With dead ends: 6995 [2019-10-15 03:26:46,584 INFO L226 Difference]: Without dead ends: 6709 [2019-10-15 03:26:46,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-15 03:26:46,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-10-15 03:26:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 3319. [2019-10-15 03:26:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-15 03:26:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4150 transitions. [2019-10-15 03:26:46,878 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4150 transitions. Word has length 57 [2019-10-15 03:26:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:46,880 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4150 transitions. [2019-10-15 03:26:46,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:26:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4150 transitions. [2019-10-15 03:26:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:46,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:46,888 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:46,888 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:46,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:46,888 INFO L82 PathProgramCache]: Analyzing trace with hash -2090309520, now seen corresponding path program 1 times [2019-10-15 03:26:46,889 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:46,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130177003] [2019-10-15 03:26:46,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:46,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:47,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130177003] [2019-10-15 03:26:47,031 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:47,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:47,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800794665] [2019-10-15 03:26:47,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:47,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:47,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:47,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:47,033 INFO L87 Difference]: Start difference. First operand 3319 states and 4150 transitions. Second operand 3 states. [2019-10-15 03:26:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:47,376 INFO L93 Difference]: Finished difference Result 4537 states and 5821 transitions. [2019-10-15 03:26:47,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:47,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:26:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:47,409 INFO L225 Difference]: With dead ends: 4537 [2019-10-15 03:26:47,409 INFO L226 Difference]: Without dead ends: 3436 [2019-10-15 03:26:47,413 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 03:26:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2019-10-15 03:26:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3244. [2019-10-15 03:26:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2019-10-15 03:26:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4047 transitions. [2019-10-15 03:26:47,763 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4047 transitions. Word has length 58 [2019-10-15 03:26:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:47,764 INFO L462 AbstractCegarLoop]: Abstraction has 3244 states and 4047 transitions. [2019-10-15 03:26:47,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4047 transitions. [2019-10-15 03:26:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:47,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:47,768 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:47,768 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:47,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1502019993, now seen corresponding path program 1 times [2019-10-15 03:26:47,769 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:47,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378043200] [2019-10-15 03:26:47,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:47,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:47,862 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 03:26:47,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378043200] [2019-10-15 03:26:47,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:47,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:47,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936206824] [2019-10-15 03:26:47,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:47,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:47,864 INFO L87 Difference]: Start difference. First operand 3244 states and 4047 transitions. Second operand 3 states. [2019-10-15 03:26:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:48,335 INFO L93 Difference]: Finished difference Result 4994 states and 6444 transitions. [2019-10-15 03:26:48,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:48,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:26:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:48,346 INFO L225 Difference]: With dead ends: 4994 [2019-10-15 03:26:48,347 INFO L226 Difference]: Without dead ends: 3758 [2019-10-15 03:26:48,351 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 03:26:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2019-10-15 03:26:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3472. [2019-10-15 03:26:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2019-10-15 03:26:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4377 transitions. [2019-10-15 03:26:48,704 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4377 transitions. Word has length 58 [2019-10-15 03:26:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:48,704 INFO L462 AbstractCegarLoop]: Abstraction has 3472 states and 4377 transitions. [2019-10-15 03:26:48,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4377 transitions. [2019-10-15 03:26:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:48,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:48,708 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:48,708 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash -272730919, now seen corresponding path program 1 times [2019-10-15 03:26:48,709 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:48,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003289278] [2019-10-15 03:26:48,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,709 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:48,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:48,810 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 03:26:48,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003289278] [2019-10-15 03:26:48,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:48,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:48,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686824571] [2019-10-15 03:26:48,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:48,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:48,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:48,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:48,812 INFO L87 Difference]: Start difference. First operand 3472 states and 4377 transitions. Second operand 3 states. [2019-10-15 03:26:49,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:49,555 INFO L93 Difference]: Finished difference Result 5662 states and 7301 transitions. [2019-10-15 03:26:49,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:49,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-15 03:26:49,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:49,562 INFO L225 Difference]: With dead ends: 5662 [2019-10-15 03:26:49,563 INFO L226 Difference]: Without dead ends: 3376 [2019-10-15 03:26:49,571 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 03:26:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2019-10-15 03:26:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3374. [2019-10-15 03:26:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3374 states. [2019-10-15 03:26:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4207 transitions. [2019-10-15 03:26:50,010 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4207 transitions. Word has length 58 [2019-10-15 03:26:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:50,010 INFO L462 AbstractCegarLoop]: Abstraction has 3374 states and 4207 transitions. [2019-10-15 03:26:50,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4207 transitions. [2019-10-15 03:26:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:26:50,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:50,013 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 03:26:50,014 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash -475874997, now seen corresponding path program 1 times [2019-10-15 03:26:50,014 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:50,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482810051] [2019-10-15 03:26:50,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:50,085 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 03:26:50,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482810051] [2019-10-15 03:26:50,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:50,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:50,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528053196] [2019-10-15 03:26:50,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:50,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:50,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:50,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:50,088 INFO L87 Difference]: Start difference. First operand 3374 states and 4207 transitions. Second operand 3 states. [2019-10-15 03:26:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:50,784 INFO L93 Difference]: Finished difference Result 5820 states and 7391 transitions. [2019-10-15 03:26:50,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:50,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 03:26:50,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:50,792 INFO L225 Difference]: With dead ends: 5820 [2019-10-15 03:26:50,792 INFO L226 Difference]: Without dead ends: 3270 [2019-10-15 03:26:50,800 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 03:26:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2019-10-15 03:26:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2598. [2019-10-15 03:26:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2019-10-15 03:26:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3221 transitions. [2019-10-15 03:26:51,134 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3221 transitions. Word has length 59 [2019-10-15 03:26:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:51,134 INFO L462 AbstractCegarLoop]: Abstraction has 2598 states and 3221 transitions. [2019-10-15 03:26:51,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3221 transitions. [2019-10-15 03:26:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:26:51,137 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:51,137 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 03:26:51,137 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:51,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:51,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1742126863, now seen corresponding path program 1 times [2019-10-15 03:26:51,138 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:51,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780124816] [2019-10-15 03:26:51,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:51,209 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 03:26:51,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780124816] [2019-10-15 03:26:51,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:51,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:51,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570830905] [2019-10-15 03:26:51,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:51,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:51,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:51,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:51,211 INFO L87 Difference]: Start difference. First operand 2598 states and 3221 transitions. Second operand 3 states. [2019-10-15 03:26:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:51,952 INFO L93 Difference]: Finished difference Result 5758 states and 7340 transitions. [2019-10-15 03:26:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:51,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-15 03:26:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:51,960 INFO L225 Difference]: With dead ends: 5758 [2019-10-15 03:26:51,960 INFO L226 Difference]: Without dead ends: 3718 [2019-10-15 03:26:51,964 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 03:26:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-10-15 03:26:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 2993. [2019-10-15 03:26:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2993 states. [2019-10-15 03:26:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 3785 transitions. [2019-10-15 03:26:52,423 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 3785 transitions. Word has length 59 [2019-10-15 03:26:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:52,423 INFO L462 AbstractCegarLoop]: Abstraction has 2993 states and 3785 transitions. [2019-10-15 03:26:52,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 3785 transitions. [2019-10-15 03:26:52,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:26:52,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:52,426 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 03:26:52,426 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:52,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:52,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2026503182, now seen corresponding path program 1 times [2019-10-15 03:26:52,426 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:52,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407166732] [2019-10-15 03:26:52,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:53,808 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 03:26:53,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407166732] [2019-10-15 03:26:53,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:53,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-15 03:26:53,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950825185] [2019-10-15 03:26:53,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-15 03:26:53,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:53,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-15 03:26:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-10-15 03:26:53,810 INFO L87 Difference]: Start difference. First operand 2993 states and 3785 transitions. Second operand 21 states. [2019-10-15 03:26:54,077 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49