/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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:42:22,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:42:22,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:42:22,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:42:22,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:42:22,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:42:22,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:42:22,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:42:22,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:42:22,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:42:22,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:42:22,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:42:22,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:42:22,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:42:22,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:42:22,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:42:22,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:42:22,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:42:22,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:42:22,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:42:22,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:42:22,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:42:22,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:42:22,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:42:22,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:42:22,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:42:22,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:42:22,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:42:22,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:42:22,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:42:22,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:42:22,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:42:22,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:42:22,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:42:22,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:42:22,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:42:22,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:42:22,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:42:22,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:42:22,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:42:22,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:42:22,808 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:42:22,834 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:42:22,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:42:22,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:42:22,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:42:22,836 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:42:22,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:42:22,836 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:42:22,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:42:22,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:42:22,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:42:22,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:42:22,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:42:22,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:42:22,838 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:42:22,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:42:22,838 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:42:22,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:42:22,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:42:22,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:42:22,839 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:42:22,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:42:22,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:42:22,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:42:22,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:42:22,840 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:42:22,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:42:22,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:42:22,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:42:22,840 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:42:23,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:42:23,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:42:23,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:42:23,149 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:42:23,149 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:42:23,150 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 04:42:23,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3ffb2e4/05a1dddab08847c8b97f6b606146dcc2/FLAG3c26181a4 [2019-11-07 04:42:24,002 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:42:24,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 04:42:24,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3ffb2e4/05a1dddab08847c8b97f6b606146dcc2/FLAG3c26181a4 [2019-11-07 04:42:24,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f3ffb2e4/05a1dddab08847c8b97f6b606146dcc2 [2019-11-07 04:42:24,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:42:24,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:42:24,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:24,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:42:24,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:42:24,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:24" (1/1) ... [2019-11-07 04:42:24,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd74acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:24, skipping insertion in model container [2019-11-07 04:42:24,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:24" (1/1) ... [2019-11-07 04:42:24,130 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:42:24,289 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:42:25,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:25,282 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:42:25,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:25,675 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:42:25,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:25 WrapperNode [2019-11-07 04:42:25,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:25,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:42:25,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:42:25,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:42:25,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:25" (1/1) ... [2019-11-07 04:42:25,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:25" (1/1) ... [2019-11-07 04:42:25,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:25" (1/1) ... [2019-11-07 04:42:25,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:25" (1/1) ... [2019-11-07 04:42:25,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:25" (1/1) ... [2019-11-07 04:42:25,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:25" (1/1) ... [2019-11-07 04:42:25,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:25" (1/1) ... [2019-11-07 04:42:25,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:42:25,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:42:25,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:42:25,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:42:25,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42: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-11-07 04:42:25,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:42:25,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:42:25,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:42:25,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:42:25,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:42:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:42:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 04:42:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:42:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:42:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:42:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:42:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:42:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:42:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:42:25,992 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:42:25,992 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:42:25,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:42:25,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:42:25,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:42:30,421 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:42:30,422 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:42:30,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:30 BoogieIcfgContainer [2019-11-07 04:42:30,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:42:30,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:42:30,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:42:30,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:42:30,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:42:24" (1/3) ... [2019-11-07 04:42:30,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e87b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:30, skipping insertion in model container [2019-11-07 04:42:30,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:25" (2/3) ... [2019-11-07 04:42:30,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e87b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:30, skipping insertion in model container [2019-11-07 04:42:30,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:30" (3/3) ... [2019-11-07 04:42:30,446 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 04:42:30,458 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:42:30,469 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-07 04:42:30,482 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-07 04:42:30,527 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:42:30,527 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:42:30,527 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:42:30,527 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:42:30,527 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:42:30,528 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:42:30,528 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:42:30,528 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:42:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states. [2019-11-07 04:42:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:30,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:30,616 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:42:30,619 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:30,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1364126483, now seen corresponding path program 1 times [2019-11-07 04:42:30,638 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:30,640 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023945874] [2019-11-07 04:42:30,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:31,215 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:31,216 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023945874] [2019-11-07 04:42:31,217 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:31,217 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:31,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191660867] [2019-11-07 04:42:31,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:31,226 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:31,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:31,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:31,244 INFO L87 Difference]: Start difference. First operand 1182 states. Second operand 5 states. [2019-11-07 04:42:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:33,288 INFO L93 Difference]: Finished difference Result 2270 states and 3974 transitions. [2019-11-07 04:42:33,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:33,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-07 04:42:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:33,315 INFO L225 Difference]: With dead ends: 2270 [2019-11-07 04:42:33,316 INFO L226 Difference]: Without dead ends: 1418 [2019-11-07 04:42:33,328 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:42:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-11-07 04:42:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1412. [2019-11-07 04:42:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-11-07 04:42:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1854 transitions. [2019-11-07 04:42:33,484 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1854 transitions. Word has length 54 [2019-11-07 04:42:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:33,485 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 1854 transitions. [2019-11-07 04:42:33,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1854 transitions. [2019-11-07 04:42:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:33,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:33,490 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:42:33,491 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:33,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:33,491 INFO L82 PathProgramCache]: Analyzing trace with hash -672874759, now seen corresponding path program 1 times [2019-11-07 04:42:33,492 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:33,492 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112164755] [2019-11-07 04:42:33,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:33,741 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:33,742 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112164755] [2019-11-07 04:42:33,742 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:33,742 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:33,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349540189] [2019-11-07 04:42:33,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:33,745 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:33,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:33,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:33,746 INFO L87 Difference]: Start difference. First operand 1412 states and 1854 transitions. Second operand 6 states. [2019-11-07 04:42:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:35,181 INFO L93 Difference]: Finished difference Result 2943 states and 3905 transitions. [2019-11-07 04:42:35,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:35,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-07 04:42:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:35,193 INFO L225 Difference]: With dead ends: 2943 [2019-11-07 04:42:35,193 INFO L226 Difference]: Without dead ends: 1976 [2019-11-07 04:42:35,197 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:42:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2019-11-07 04:42:35,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1960. [2019-11-07 04:42:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-11-07 04:42:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2580 transitions. [2019-11-07 04:42:35,309 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2580 transitions. Word has length 55 [2019-11-07 04:42:35,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:35,309 INFO L462 AbstractCegarLoop]: Abstraction has 1960 states and 2580 transitions. [2019-11-07 04:42:35,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2580 transitions. [2019-11-07 04:42:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:35,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:35,403 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:42:35,405 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:35,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:35,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1781940792, now seen corresponding path program 1 times [2019-11-07 04:42:35,405 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:35,406 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28395279] [2019-11-07 04:42:35,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:35,554 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:35,555 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28395279] [2019-11-07 04:42:35,555 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:35,555 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:35,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320513856] [2019-11-07 04:42:35,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:35,557 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:35,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:35,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:35,557 INFO L87 Difference]: Start difference. First operand 1960 states and 2580 transitions. Second operand 6 states. [2019-11-07 04:42:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:36,924 INFO L93 Difference]: Finished difference Result 4894 states and 6440 transitions. [2019-11-07 04:42:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:36,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-07 04:42:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:36,944 INFO L225 Difference]: With dead ends: 4894 [2019-11-07 04:42:36,944 INFO L226 Difference]: Without dead ends: 3588 [2019-11-07 04:42:36,948 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:42:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2019-11-07 04:42:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3568. [2019-11-07 04:42:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-11-07 04:42:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4693 transitions. [2019-11-07 04:42:37,198 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4693 transitions. Word has length 55 [2019-11-07 04:42:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:37,199 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4693 transitions. [2019-11-07 04:42:37,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4693 transitions. [2019-11-07 04:42:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:42:37,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:37,204 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:42:37,205 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1568068960, now seen corresponding path program 1 times [2019-11-07 04:42:37,206 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:37,206 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643210618] [2019-11-07 04:42:37,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:37,508 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:37,508 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643210618] [2019-11-07 04:42:37,509 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:37,509 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:37,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440633283] [2019-11-07 04:42:37,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:37,510 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:37,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:37,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:37,513 INFO L87 Difference]: Start difference. First operand 3568 states and 4693 transitions. Second operand 9 states. [2019-11-07 04:42:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:40,945 INFO L93 Difference]: Finished difference Result 5331 states and 7146 transitions. [2019-11-07 04:42:40,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-07 04:42:40,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-07 04:42:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:41,008 INFO L225 Difference]: With dead ends: 5331 [2019-11-07 04:42:41,009 INFO L226 Difference]: Without dead ends: 5326 [2019-11-07 04:42:41,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-11-07 04:42:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5326 states. [2019-11-07 04:42:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5326 to 3568. [2019-11-07 04:42:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-11-07 04:42:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4692 transitions. [2019-11-07 04:42:41,476 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4692 transitions. Word has length 56 [2019-11-07 04:42:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:41,477 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4692 transitions. [2019-11-07 04:42:41,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4692 transitions. [2019-11-07 04:42:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:42:41,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:41,484 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:42:41,484 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:41,485 INFO L82 PathProgramCache]: Analyzing trace with hash -634470005, now seen corresponding path program 1 times [2019-11-07 04:42:41,485 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:41,486 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051389097] [2019-11-07 04:42:41,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:41,706 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:41,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051389097] [2019-11-07 04:42:41,706 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:41,707 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:41,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099707785] [2019-11-07 04:42:41,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:41,709 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:41,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:41,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:41,711 INFO L87 Difference]: Start difference. First operand 3568 states and 4692 transitions. Second operand 9 states. [2019-11-07 04:42:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:45,415 INFO L93 Difference]: Finished difference Result 8465 states and 11375 transitions. [2019-11-07 04:42:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 04:42:45,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-11-07 04:42:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:45,452 INFO L225 Difference]: With dead ends: 8465 [2019-11-07 04:42:45,452 INFO L226 Difference]: Without dead ends: 8171 [2019-11-07 04:42:45,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:42:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2019-11-07 04:42:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 3568. [2019-11-07 04:42:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-11-07 04:42:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4691 transitions. [2019-11-07 04:42:45,752 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4691 transitions. Word has length 56 [2019-11-07 04:42:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:45,753 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4691 transitions. [2019-11-07 04:42:45,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4691 transitions. [2019-11-07 04:42:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:42:45,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:45,761 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:42:45,761 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:45,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:45,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2025706282, now seen corresponding path program 1 times [2019-11-07 04:42:45,762 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:45,762 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071344700] [2019-11-07 04:42:45,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:46,047 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:46,048 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071344700] [2019-11-07 04:42:46,049 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:46,049 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:42:46,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143782958] [2019-11-07 04:42:46,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:42:46,050 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:46,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:42:46,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:42:46,050 INFO L87 Difference]: Start difference. First operand 3568 states and 4691 transitions. Second operand 8 states. [2019-11-07 04:42:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:48,829 INFO L93 Difference]: Finished difference Result 7600 states and 10507 transitions. [2019-11-07 04:42:48,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:42:48,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-07 04:42:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:48,856 INFO L225 Difference]: With dead ends: 7600 [2019-11-07 04:42:48,856 INFO L226 Difference]: Without dead ends: 6700 [2019-11-07 04:42:48,860 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:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6700 states. [2019-11-07 04:42:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6700 to 3568. [2019-11-07 04:42:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3568 states. [2019-11-07 04:42:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 4690 transitions. [2019-11-07 04:42:49,102 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 4690 transitions. Word has length 56 [2019-11-07 04:42:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:49,103 INFO L462 AbstractCegarLoop]: Abstraction has 3568 states and 4690 transitions. [2019-11-07 04:42:49,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:42:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 4690 transitions. [2019-11-07 04:42:49,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:49,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:49,108 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:49,108 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1601603689, now seen corresponding path program 1 times [2019-11-07 04:42:49,109 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:49,109 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121211192] [2019-11-07 04:42:49,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:49,178 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:49,179 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121211192] [2019-11-07 04:42:49,179 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:49,179 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:49,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004274837] [2019-11-07 04:42:49,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:49,180 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:49,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:49,181 INFO L87 Difference]: Start difference. First operand 3568 states and 4690 transitions. Second operand 3 states. [2019-11-07 04:42:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:49,767 INFO L93 Difference]: Finished difference Result 6320 states and 8431 transitions. [2019-11-07 04:42:49,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:49,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-07 04:42:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:49,800 INFO L225 Difference]: With dead ends: 6320 [2019-11-07 04:42:49,801 INFO L226 Difference]: Without dead ends: 4323 [2019-11-07 04:42:49,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:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2019-11-07 04:42:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 4317. [2019-11-07 04:42:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4317 states. [2019-11-07 04:42:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 5609 transitions. [2019-11-07 04:42:50,224 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 5609 transitions. Word has length 57 [2019-11-07 04:42:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:50,224 INFO L462 AbstractCegarLoop]: Abstraction has 4317 states and 5609 transitions. [2019-11-07 04:42:50,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 5609 transitions. [2019-11-07 04:42:50,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:50,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:50,229 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:50,230 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:50,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:50,230 INFO L82 PathProgramCache]: Analyzing trace with hash -466438381, now seen corresponding path program 1 times [2019-11-07 04:42:50,230 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:50,230 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684646243] [2019-11-07 04:42:50,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:50,314 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:50,314 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684646243] [2019-11-07 04:42:50,315 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:50,315 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:50,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894953796] [2019-11-07 04:42:50,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:50,316 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:50,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:50,316 INFO L87 Difference]: Start difference. First operand 4317 states and 5609 transitions. Second operand 3 states. [2019-11-07 04:42:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:50,665 INFO L93 Difference]: Finished difference Result 6378 states and 8567 transitions. [2019-11-07 04:42:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:50,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-07 04:42:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:50,677 INFO L225 Difference]: With dead ends: 6378 [2019-11-07 04:42:50,677 INFO L226 Difference]: Without dead ends: 4883 [2019-11-07 04:42:50,682 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:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-11-07 04:42:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4543. [2019-11-07 04:42:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4543 states. [2019-11-07 04:42:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4543 states to 4543 states and 5970 transitions. [2019-11-07 04:42:51,050 INFO L78 Accepts]: Start accepts. Automaton has 4543 states and 5970 transitions. Word has length 57 [2019-11-07 04:42:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:51,050 INFO L462 AbstractCegarLoop]: Abstraction has 4543 states and 5970 transitions. [2019-11-07 04:42:51,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4543 states and 5970 transitions. [2019-11-07 04:42:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:51,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:51,056 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:51,056 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1782949341, now seen corresponding path program 1 times [2019-11-07 04:42:51,057 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:51,057 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409960490] [2019-11-07 04:42:51,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:51,121 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:51,122 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409960490] [2019-11-07 04:42:51,122 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:51,122 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:51,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485902194] [2019-11-07 04:42:51,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:51,123 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:51,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:51,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:51,123 INFO L87 Difference]: Start difference. First operand 4543 states and 5970 transitions. Second operand 3 states. [2019-11-07 04:42:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:51,823 INFO L93 Difference]: Finished difference Result 7631 states and 10359 transitions. [2019-11-07 04:42:51,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:51,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-07 04:42:51,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:51,835 INFO L225 Difference]: With dead ends: 7631 [2019-11-07 04:42:51,835 INFO L226 Difference]: Without dead ends: 5552 [2019-11-07 04:42:51,841 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:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5552 states. [2019-11-07 04:42:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5552 to 5052. [2019-11-07 04:42:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5052 states. [2019-11-07 04:42:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5052 states to 5052 states and 6682 transitions. [2019-11-07 04:42:52,370 INFO L78 Accepts]: Start accepts. Automaton has 5052 states and 6682 transitions. Word has length 57 [2019-11-07 04:42:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:52,371 INFO L462 AbstractCegarLoop]: Abstraction has 5052 states and 6682 transitions. [2019-11-07 04:42:52,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 5052 states and 6682 transitions. [2019-11-07 04:42:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:52,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:52,376 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:52,376 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:52,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash -794875623, now seen corresponding path program 1 times [2019-11-07 04:42:52,377 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:52,377 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86698569] [2019-11-07 04:42:52,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:52,434 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:52,435 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86698569] [2019-11-07 04:42:52,435 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:52,435 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:52,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394149409] [2019-11-07 04:42:52,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:52,438 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:52,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:52,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:52,440 INFO L87 Difference]: Start difference. First operand 5052 states and 6682 transitions. Second operand 3 states. [2019-11-07 04:42:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:53,342 INFO L93 Difference]: Finished difference Result 8594 states and 11344 transitions. [2019-11-07 04:42:53,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:53,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:53,356 INFO L225 Difference]: With dead ends: 8594 [2019-11-07 04:42:53,357 INFO L226 Difference]: Without dead ends: 4102 [2019-11-07 04:42:53,377 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:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-07 04:42:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3090. [2019-11-07 04:42:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-11-07 04:42:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 4001 transitions. [2019-11-07 04:42:53,810 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 4001 transitions. Word has length 58 [2019-11-07 04:42:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:53,811 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 4001 transitions. [2019-11-07 04:42:53,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 4001 transitions. [2019-11-07 04:42:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:53,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:53,819 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:53,820 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:53,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:53,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1917578780, now seen corresponding path program 1 times [2019-11-07 04:42:53,821 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:53,821 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268929706] [2019-11-07 04:42:53,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:53,886 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:53,886 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268929706] [2019-11-07 04:42:53,886 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:53,887 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:53,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51968185] [2019-11-07 04:42:53,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:53,887 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:53,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:53,888 INFO L87 Difference]: Start difference. First operand 3090 states and 4001 transitions. Second operand 3 states. [2019-11-07 04:42:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:54,425 INFO L93 Difference]: Finished difference Result 5306 states and 7007 transitions. [2019-11-07 04:42:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:54,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:54,432 INFO L225 Difference]: With dead ends: 5306 [2019-11-07 04:42:54,432 INFO L226 Difference]: Without dead ends: 2974 [2019-11-07 04:42:54,436 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:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2019-11-07 04:42:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2364. [2019-11-07 04:42:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-11-07 04:42:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3039 transitions. [2019-11-07 04:42:54,745 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3039 transitions. Word has length 58 [2019-11-07 04:42:54,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:54,745 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 3039 transitions. [2019-11-07 04:42:54,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3039 transitions. [2019-11-07 04:42:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:54,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:54,748 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:54,749 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1724765725, now seen corresponding path program 1 times [2019-11-07 04:42:54,749 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:54,749 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919578225] [2019-11-07 04:42:54,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:54,803 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:54,803 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919578225] [2019-11-07 04:42:54,804 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:54,804 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:54,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002500627] [2019-11-07 04:42:54,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:54,804 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:54,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:54,805 INFO L87 Difference]: Start difference. First operand 2364 states and 3039 transitions. Second operand 3 states. [2019-11-07 04:42:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:55,182 INFO L93 Difference]: Finished difference Result 5185 states and 6877 transitions. [2019-11-07 04:42:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:55,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:55,190 INFO L225 Difference]: With dead ends: 5185 [2019-11-07 04:42:55,190 INFO L226 Difference]: Without dead ends: 3343 [2019-11-07 04:42:55,195 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:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2019-11-07 04:42:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 2699. [2019-11-07 04:42:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2019-11-07 04:42:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3550 transitions. [2019-11-07 04:42:55,567 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3550 transitions. Word has length 58 [2019-11-07 04:42:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:55,567 INFO L462 AbstractCegarLoop]: Abstraction has 2699 states and 3550 transitions. [2019-11-07 04:42:55,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3550 transitions. [2019-11-07 04:42:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-07 04:42:55,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:55,570 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:55,570 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:55,570 INFO L82 PathProgramCache]: Analyzing trace with hash 377672324, now seen corresponding path program 1 times [2019-11-07 04:42:55,571 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:55,571 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181776185] [2019-11-07 04:42:55,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:56,309 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:56,310 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181776185] [2019-11-07 04:42:56,310 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:56,310 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-07 04:42:56,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802198820] [2019-11-07 04:42:56,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-07 04:42:56,311 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:56,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-07 04:42:56,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-07 04:42:56,311 INFO L87 Difference]: Start difference. First operand 2699 states and 3550 transitions. Second operand 19 states. [2019-11-07 04:42:56,494 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75