/usr/bin/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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:41:36,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:41:36,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:41:36,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:41:36,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:41:36,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:41:36,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:41:36,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:41:36,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:41:36,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:41:36,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:41:36,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:41:36,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:41:36,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:41:36,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:41:36,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:41:36,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:41:36,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:41:36,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:41:36,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:41:36,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:41:36,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:41:36,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:41:36,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:41:36,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:41:36,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:41:36,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:41:36,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:41:36,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:41:36,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:41:36,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:41:36,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:41:36,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:41:36,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:41:36,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:41:36,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:41:36,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:41:36,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:41:36,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:41:36,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:41:36,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:41:36,719 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-11-07 04:41:36,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:41:36,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:41:36,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:41:36,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:41:36,743 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:41:36,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:41:36,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:41:36,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:41:36,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:41:36,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:41:36,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:41:36,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:41:36,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:41:36,747 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:41:36,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:41:36,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:41:36,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:41:36,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:41:36,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:41:36,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:41:36,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:41:36,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:41:36,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:41:36,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:41:36,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:41:36,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:41:36,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:41:36,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:41:36,750 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-11-07 04:41:37,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:41:37,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:41:37,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:41:37,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:41:37,086 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:41:37,087 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.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 04:41:37,150 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8029a290a/4a6d4154eb1a4c8e995355e475ecbaaa/FLAG17691424f [2019-11-07 04:41:37,835 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:41:37,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 04:41:37,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8029a290a/4a6d4154eb1a4c8e995355e475ecbaaa/FLAG17691424f [2019-11-07 04:41:38,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8029a290a/4a6d4154eb1a4c8e995355e475ecbaaa [2019-11-07 04:41:38,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:41:38,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:41:38,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:38,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:41:38,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:41:38,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:38" (1/1) ... [2019-11-07 04:41:38,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184cb6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:38, skipping insertion in model container [2019-11-07 04:41:38,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:38" (1/1) ... [2019-11-07 04:41:38,096 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:41:38,362 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:41:39,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:39,448 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:41:39,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:39,805 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:41:39,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39 WrapperNode [2019-11-07 04:41:39,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:39,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:41:39,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:41:39,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:41:39,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39" (1/1) ... [2019-11-07 04:41:39,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39" (1/1) ... [2019-11-07 04:41:39,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39" (1/1) ... [2019-11-07 04:41:39,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39" (1/1) ... [2019-11-07 04:41:39,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39" (1/1) ... [2019-11-07 04:41:39,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39" (1/1) ... [2019-11-07 04:41:40,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39" (1/1) ... [2019-11-07 04:41:40,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:41:40,039 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:41:40,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:41:40,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:41:40,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39" (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-11-07 04:41:40,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:41:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:41:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:41:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:41:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:41:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:41:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 04:41:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:41:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:41:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:41:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:41:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:41:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:41:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:41:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:41:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:41:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:41:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:41:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:41:44,548 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:41:44,549 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:41:44,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:44 BoogieIcfgContainer [2019-11-07 04:41:44,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:41:44,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:41:44,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:41:44,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:41:44,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:41:38" (1/3) ... [2019-11-07 04:41:44,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebcc578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:44, skipping insertion in model container [2019-11-07 04:41:44,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:39" (2/3) ... [2019-11-07 04:41:44,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ebcc578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:44, skipping insertion in model container [2019-11-07 04:41:44,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:44" (3/3) ... [2019-11-07 04:41:44,570 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 04:41:44,581 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:41:44,591 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-07 04:41:44,602 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-07 04:41:44,636 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:41:44,636 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:41:44,637 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:41:44,637 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:41:44,637 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:41:44,637 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:41:44,637 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:41:44,637 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:41:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states. [2019-11-07 04:41:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:41:44,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:44,702 INFO L410 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] [2019-11-07 04:41:44,705 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:44,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1364126483, now seen corresponding path program 1 times [2019-11-07 04:41:44,721 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:44,721 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599695918] [2019-11-07 04:41:44,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:45,261 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599695918] [2019-11-07 04:41:45,262 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:45,262 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:45,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603288148] [2019-11-07 04:41:45,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:45,270 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:45,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:45,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:45,284 INFO L87 Difference]: Start difference. First operand 1182 states. Second operand 5 states. [2019-11-07 04:41:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:47,460 INFO L93 Difference]: Finished difference Result 2278 states and 3982 transitions. [2019-11-07 04:41:47,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:47,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-07 04:41:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:47,497 INFO L225 Difference]: With dead ends: 2278 [2019-11-07 04:41:47,498 INFO L226 Difference]: Without dead ends: 1426 [2019-11-07 04:41:47,512 INFO L630 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-11-07 04:41:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2019-11-07 04:41:47,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1420. [2019-11-07 04:41:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2019-11-07 04:41:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1862 transitions. [2019-11-07 04:41:47,680 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1862 transitions. Word has length 54 [2019-11-07 04:41:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:47,681 INFO L462 AbstractCegarLoop]: Abstraction has 1420 states and 1862 transitions. [2019-11-07 04:41:47,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1862 transitions. [2019-11-07 04:41:47,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:41:47,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:47,686 INFO L410 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-11-07 04:41:47,686 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash -672874759, now seen corresponding path program 1 times [2019-11-07 04:41:47,687 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:47,688 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173592331] [2019-11-07 04:41:47,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:47,894 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173592331] [2019-11-07 04:41:47,894 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:47,895 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:41:47,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65056370] [2019-11-07 04:41:47,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:41:47,897 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:47,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:41:47,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:41:47,898 INFO L87 Difference]: Start difference. First operand 1420 states and 1862 transitions. Second operand 6 states. [2019-11-07 04:41:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:49,292 INFO L93 Difference]: Finished difference Result 2953 states and 3915 transitions. [2019-11-07 04:41:49,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:49,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-07 04:41:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:49,307 INFO L225 Difference]: With dead ends: 2953 [2019-11-07 04:41:49,307 INFO L226 Difference]: Without dead ends: 1982 [2019-11-07 04:41:49,311 INFO L630 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-11-07 04:41:49,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-11-07 04:41:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1966. [2019-11-07 04:41:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-11-07 04:41:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2586 transitions. [2019-11-07 04:41:49,412 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2586 transitions. Word has length 55 [2019-11-07 04:41:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:49,412 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 2586 transitions. [2019-11-07 04:41:49,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:41:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2586 transitions. [2019-11-07 04:41:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:41:49,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:49,419 INFO L410 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-11-07 04:41:49,420 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:49,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1781940792, now seen corresponding path program 1 times [2019-11-07 04:41:49,422 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:49,422 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119844482] [2019-11-07 04:41:49,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:49,591 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119844482] [2019-11-07 04:41:49,591 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:49,592 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:41:49,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619788887] [2019-11-07 04:41:49,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:41:49,593 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:49,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:41:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:41:49,594 INFO L87 Difference]: Start difference. First operand 1966 states and 2586 transitions. Second operand 6 states. [2019-11-07 04:41:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:50,907 INFO L93 Difference]: Finished difference Result 4903 states and 6449 transitions. [2019-11-07 04:41:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:50,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-07 04:41:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:50,926 INFO L225 Difference]: With dead ends: 4903 [2019-11-07 04:41:50,926 INFO L226 Difference]: Without dead ends: 3594 [2019-11-07 04:41:50,930 INFO L630 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-11-07 04:41:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-11-07 04:41:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3574. [2019-11-07 04:41:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-11-07 04:41:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4699 transitions. [2019-11-07 04:41:51,078 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4699 transitions. Word has length 55 [2019-11-07 04:41:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:51,078 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4699 transitions. [2019-11-07 04:41:51,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:41:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4699 transitions. [2019-11-07 04:41:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:41:51,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:51,083 INFO L410 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-11-07 04:41:51,084 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1568068960, now seen corresponding path program 1 times [2019-11-07 04:41:51,084 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:51,085 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699711151] [2019-11-07 04:41:51,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:51,376 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699711151] [2019-11-07 04:41:51,376 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:51,376 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:41:51,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978065455] [2019-11-07 04:41:51,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:41:51,377 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:41:51,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:41:51,378 INFO L87 Difference]: Start difference. First operand 3574 states and 4699 transitions. Second operand 9 states. [2019-11-07 04:41:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:54,867 INFO L93 Difference]: Finished difference Result 5337 states and 7152 transitions. [2019-11-07 04:41:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-07 04:41:54,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-07 04:41:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:54,931 INFO L225 Difference]: With dead ends: 5337 [2019-11-07 04:41:54,931 INFO L226 Difference]: Without dead ends: 5332 [2019-11-07 04:41:54,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-11-07 04:41:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5332 states. [2019-11-07 04:41:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5332 to 3574. [2019-11-07 04:41:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-11-07 04:41:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4698 transitions. [2019-11-07 04:41:55,306 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4698 transitions. Word has length 56 [2019-11-07 04:41:55,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:55,307 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4698 transitions. [2019-11-07 04:41:55,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:41:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4698 transitions. [2019-11-07 04:41:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:41:55,312 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:55,313 INFO L410 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-11-07 04:41:55,313 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:55,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:55,314 INFO L82 PathProgramCache]: Analyzing trace with hash -634470005, now seen corresponding path program 1 times [2019-11-07 04:41:55,314 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:55,315 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257031409] [2019-11-07 04:41:55,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:55,561 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257031409] [2019-11-07 04:41:55,561 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:55,562 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:41:55,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560678370] [2019-11-07 04:41:55,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:41:55,564 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:55,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:41:55,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:41:55,566 INFO L87 Difference]: Start difference. First operand 3574 states and 4698 transitions. Second operand 9 states. [2019-11-07 04:41:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:59,340 INFO L93 Difference]: Finished difference Result 8465 states and 11375 transitions. [2019-11-07 04:41:59,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 04:41:59,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-07 04:41:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:59,372 INFO L225 Difference]: With dead ends: 8465 [2019-11-07 04:41:59,372 INFO L226 Difference]: Without dead ends: 8171 [2019-11-07 04:41:59,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:41:59,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2019-11-07 04:41:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 3574. [2019-11-07 04:41:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-11-07 04:41:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4697 transitions. [2019-11-07 04:41:59,642 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4697 transitions. Word has length 56 [2019-11-07 04:41:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:59,643 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4697 transitions. [2019-11-07 04:41:59,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:41:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4697 transitions. [2019-11-07 04:41:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:41:59,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:59,648 INFO L410 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-11-07 04:41:59,648 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:59,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2025706282, now seen corresponding path program 1 times [2019-11-07 04:41:59,649 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:59,649 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52195154] [2019-11-07 04:41:59,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:41:59,896 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52195154] [2019-11-07 04:41:59,897 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:59,898 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:41:59,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71458306] [2019-11-07 04:41:59,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:41:59,899 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:59,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:41:59,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:41:59,900 INFO L87 Difference]: Start difference. First operand 3574 states and 4697 transitions. Second operand 8 states. [2019-11-07 04:42:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:02,652 INFO L93 Difference]: Finished difference Result 7606 states and 10513 transitions. [2019-11-07 04:42:02,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:42:02,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-07 04:42:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:02,697 INFO L225 Difference]: With dead ends: 7606 [2019-11-07 04:42:02,697 INFO L226 Difference]: Without dead ends: 6706 [2019-11-07 04:42:02,700 INFO L630 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-11-07 04:42:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2019-11-07 04:42:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 3574. [2019-11-07 04:42:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-11-07 04:42:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 4696 transitions. [2019-11-07 04:42:02,890 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 4696 transitions. Word has length 56 [2019-11-07 04:42:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:02,890 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 4696 transitions. [2019-11-07 04:42:02,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:42:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 4696 transitions. [2019-11-07 04:42:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:02,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:02,895 INFO L410 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-11-07 04:42:02,895 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:02,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1601603689, now seen corresponding path program 1 times [2019-11-07 04:42:02,896 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:02,896 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304598159] [2019-11-07 04:42:02,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:02,968 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304598159] [2019-11-07 04:42:02,968 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:02,968 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:02,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729561931] [2019-11-07 04:42:02,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:02,969 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:02,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:02,970 INFO L87 Difference]: Start difference. First operand 3574 states and 4696 transitions. Second operand 3 states. [2019-11-07 04:42:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:03,415 INFO L93 Difference]: Finished difference Result 6645 states and 8841 transitions. [2019-11-07 04:42:03,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:03,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-07 04:42:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:03,428 INFO L225 Difference]: With dead ends: 6645 [2019-11-07 04:42:03,429 INFO L226 Difference]: Without dead ends: 4648 [2019-11-07 04:42:03,434 INFO L630 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-11-07 04:42:03,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2019-11-07 04:42:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 4642. [2019-11-07 04:42:03,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4642 states. [2019-11-07 04:42:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4642 states to 4642 states and 5984 transitions. [2019-11-07 04:42:03,748 INFO L78 Accepts]: Start accepts. Automaton has 4642 states and 5984 transitions. Word has length 57 [2019-11-07 04:42:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:03,748 INFO L462 AbstractCegarLoop]: Abstraction has 4642 states and 5984 transitions. [2019-11-07 04:42:03,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4642 states and 5984 transitions. [2019-11-07 04:42:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:03,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:03,756 INFO L410 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-11-07 04:42:03,757 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:03,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -466438381, now seen corresponding path program 1 times [2019-11-07 04:42:03,757 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:03,757 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56164645] [2019-11-07 04:42:03,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:03,838 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56164645] [2019-11-07 04:42:03,839 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:03,839 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:03,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415748106] [2019-11-07 04:42:03,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:03,840 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:03,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:03,840 INFO L87 Difference]: Start difference. First operand 4642 states and 5984 transitions. Second operand 3 states. [2019-11-07 04:42:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:04,616 INFO L93 Difference]: Finished difference Result 6703 states and 8942 transitions. [2019-11-07 04:42:04,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:04,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-07 04:42:04,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:04,628 INFO L225 Difference]: With dead ends: 6703 [2019-11-07 04:42:04,628 INFO L226 Difference]: Without dead ends: 5172 [2019-11-07 04:42:04,633 INFO L630 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-11-07 04:42:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2019-11-07 04:42:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 4832. [2019-11-07 04:42:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4832 states. [2019-11-07 04:42:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 6302 transitions. [2019-11-07 04:42:04,981 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 6302 transitions. Word has length 57 [2019-11-07 04:42:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:04,982 INFO L462 AbstractCegarLoop]: Abstraction has 4832 states and 6302 transitions. [2019-11-07 04:42:04,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 6302 transitions. [2019-11-07 04:42:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:04,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:04,987 INFO L410 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-11-07 04:42:04,987 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:04,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1782949341, now seen corresponding path program 1 times [2019-11-07 04:42:04,988 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:04,988 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958293196] [2019-11-07 04:42:04,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:05,050 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958293196] [2019-11-07 04:42:05,051 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:05,051 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:05,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068515296] [2019-11-07 04:42:05,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:05,052 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:05,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:05,052 INFO L87 Difference]: Start difference. First operand 4832 states and 6302 transitions. Second operand 3 states. [2019-11-07 04:42:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:05,789 INFO L93 Difference]: Finished difference Result 7920 states and 10691 transitions. [2019-11-07 04:42:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:05,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-07 04:42:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:05,801 INFO L225 Difference]: With dead ends: 7920 [2019-11-07 04:42:05,802 INFO L226 Difference]: Without dead ends: 5800 [2019-11-07 04:42:05,807 INFO L630 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-11-07 04:42:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5800 states. [2019-11-07 04:42:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5800 to 5300. [2019-11-07 04:42:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5300 states. [2019-11-07 04:42:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 6966 transitions. [2019-11-07 04:42:06,261 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 6966 transitions. Word has length 57 [2019-11-07 04:42:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:06,261 INFO L462 AbstractCegarLoop]: Abstraction has 5300 states and 6966 transitions. [2019-11-07 04:42:06,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 6966 transitions. [2019-11-07 04:42:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:06,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:06,266 INFO L410 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-11-07 04:42:06,267 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:06,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:06,267 INFO L82 PathProgramCache]: Analyzing trace with hash -794875623, now seen corresponding path program 1 times [2019-11-07 04:42:06,267 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:06,267 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694284626] [2019-11-07 04:42:06,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:06,316 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694284626] [2019-11-07 04:42:06,316 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:06,317 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:06,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891398196] [2019-11-07 04:42:06,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:06,318 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:06,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:06,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:06,318 INFO L87 Difference]: Start difference. First operand 5300 states and 6966 transitions. Second operand 3 states. [2019-11-07 04:42:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:07,080 INFO L93 Difference]: Finished difference Result 9159 states and 12034 transitions. [2019-11-07 04:42:07,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:07,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:07,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:07,096 INFO L225 Difference]: With dead ends: 9159 [2019-11-07 04:42:07,096 INFO L226 Difference]: Without dead ends: 4419 [2019-11-07 04:42:07,112 INFO L630 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-11-07 04:42:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2019-11-07 04:42:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 3526. [2019-11-07 04:42:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2019-11-07 04:42:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 4545 transitions. [2019-11-07 04:42:07,530 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 4545 transitions. Word has length 58 [2019-11-07 04:42:07,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:07,531 INFO L462 AbstractCegarLoop]: Abstraction has 3526 states and 4545 transitions. [2019-11-07 04:42:07,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4545 transitions. [2019-11-07 04:42:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:07,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:07,534 INFO L410 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-11-07 04:42:07,534 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:07,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1917578780, now seen corresponding path program 1 times [2019-11-07 04:42:07,535 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:07,535 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054639476] [2019-11-07 04:42:07,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:07,600 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054639476] [2019-11-07 04:42:07,600 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:07,600 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:07,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058710827] [2019-11-07 04:42:07,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:07,601 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:07,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:07,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:07,602 INFO L87 Difference]: Start difference. First operand 3526 states and 4545 transitions. Second operand 3 states. [2019-11-07 04:42:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:08,075 INFO L93 Difference]: Finished difference Result 5836 states and 7671 transitions. [2019-11-07 04:42:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:08,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:08,083 INFO L225 Difference]: With dead ends: 5836 [2019-11-07 04:42:08,083 INFO L226 Difference]: Without dead ends: 3278 [2019-11-07 04:42:08,090 INFO L630 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-11-07 04:42:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2019-11-07 04:42:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 2660. [2019-11-07 04:42:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-11-07 04:42:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3401 transitions. [2019-11-07 04:42:08,421 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3401 transitions. Word has length 58 [2019-11-07 04:42:08,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:08,422 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 3401 transitions. [2019-11-07 04:42:08,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3401 transitions. [2019-11-07 04:42:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:08,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:08,424 INFO L410 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-11-07 04:42:08,424 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:08,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1724765725, now seen corresponding path program 1 times [2019-11-07 04:42:08,425 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:08,425 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292083938] [2019-11-07 04:42:08,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:08,495 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292083938] [2019-11-07 04:42:08,496 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:08,496 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:08,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447255032] [2019-11-07 04:42:08,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:08,497 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:08,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:08,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:08,497 INFO L87 Difference]: Start difference. First operand 2660 states and 3401 transitions. Second operand 3 states. [2019-11-07 04:42:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:08,950 INFO L93 Difference]: Finished difference Result 5481 states and 7239 transitions. [2019-11-07 04:42:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:08,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:08,959 INFO L225 Difference]: With dead ends: 5481 [2019-11-07 04:42:08,959 INFO L226 Difference]: Without dead ends: 3482 [2019-11-07 04:42:08,964 INFO L630 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-11-07 04:42:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2019-11-07 04:42:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 2838. [2019-11-07 04:42:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2019-11-07 04:42:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3720 transitions. [2019-11-07 04:42:09,334 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3720 transitions. Word has length 58 [2019-11-07 04:42:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:09,334 INFO L462 AbstractCegarLoop]: Abstraction has 2838 states and 3720 transitions. [2019-11-07 04:42:09,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3720 transitions. [2019-11-07 04:42:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:42:09,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:09,338 INFO L410 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-11-07 04:42:09,338 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:09,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:09,339 INFO L82 PathProgramCache]: Analyzing trace with hash 377672324, now seen corresponding path program 1 times [2019-11-07 04:42:09,339 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:09,339 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425211724] [2019-11-07 04:42:09,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat