/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.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:41:46,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:41:46,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:41:46,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:41:46,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:41:46,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:41:46,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:41:46,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:41:46,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:41:46,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:41:46,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:41:46,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:41:46,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:41:46,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:41:46,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:41:46,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:41:46,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:41:46,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:41:46,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:41:46,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:41:46,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:41:46,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:41:46,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:41:46,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:41:46,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:41:46,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:41:46,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:41:46,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:41:46,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:41:46,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:41:46,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:41:46,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:41:46,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:41:46,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:41:46,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:41:46,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:41:46,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:41:46,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:41:46,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:41:46,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:41:46,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:41:46,916 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:46,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:41:46,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:41:46,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:41:46,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:41:46,931 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:41:46,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:41:46,932 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:41:46,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:41:46,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:41:46,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:41:46,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:41:46,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:41:46,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:41:46,934 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:41:46,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:41:46,934 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:41:46,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:41:46,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:41:46,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:41:46,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:41:46,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:41:46,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:41:46,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:41:46,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:41:46,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:41:46,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:41:46,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:41:46,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:41:46,937 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:47,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:41:47,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:41:47,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:41:47,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:41:47,231 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:41:47,232 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 04:41:47,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9499349d/21e81b01bf914c4fb9d7a9831b1815bb/FLAG3496e58b1 [2019-11-07 04:41:47,953 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:41:47,957 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 04:41:47,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9499349d/21e81b01bf914c4fb9d7a9831b1815bb/FLAG3496e58b1 [2019-11-07 04:41:48,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9499349d/21e81b01bf914c4fb9d7a9831b1815bb [2019-11-07 04:41:48,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:41:48,187 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:41:48,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:48,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:41:48,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:41:48,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:48" (1/1) ... [2019-11-07 04:41:48,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2801555d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:48, skipping insertion in model container [2019-11-07 04:41:48,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:48" (1/1) ... [2019-11-07 04:41:48,239 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:41:48,390 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:41:49,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:49,093 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:41:49,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:49,486 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:41:49,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:49 WrapperNode [2019-11-07 04:41:49,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:49,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:41:49,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:41:49,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:41:49,499 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:49" (1/1) ... [2019-11-07 04:41:49,500 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:49" (1/1) ... [2019-11-07 04:41:49,524 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:49" (1/1) ... [2019-11-07 04:41:49,524 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:49" (1/1) ... [2019-11-07 04:41:49,569 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:49" (1/1) ... [2019-11-07 04:41:49,595 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:49" (1/1) ... [2019-11-07 04:41:49,604 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:49" (1/1) ... [2019-11-07 04:41:49,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:41:49,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:41:49,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:41:49,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:41:49,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:49" (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:49,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:41:49,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:41:49,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:41:49,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:41:49,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:41:49,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:41:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 04:41:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:41:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:41:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:41:49,720 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:41:49,721 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:41:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:41:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:41:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:41:49,722 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:41:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:41:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:41:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:41:51,837 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:41:51,837 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:41:51,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:51 BoogieIcfgContainer [2019-11-07 04:41:51,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:41:51,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:41:51,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:41:51,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:41:51,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:41:48" (1/3) ... [2019-11-07 04:41:51,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d06c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:51, skipping insertion in model container [2019-11-07 04:41:51,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:49" (2/3) ... [2019-11-07 04:41:51,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d06c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:51, skipping insertion in model container [2019-11-07 04:41:51,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:51" (3/3) ... [2019-11-07 04:41:51,854 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-07 04:41:51,866 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:41:51,877 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-07 04:41:51,888 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-07 04:41:51,927 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:41:51,927 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:41:51,927 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:41:51,927 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:41:51,927 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:41:51,928 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:41:51,928 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:41:51,928 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:41:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states. [2019-11-07 04:41:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 04:41:51,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:51,985 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] [2019-11-07 04:41:51,986 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:51,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:51,992 INFO L82 PathProgramCache]: Analyzing trace with hash -939220714, now seen corresponding path program 1 times [2019-11-07 04:41:52,000 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:52,000 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88664966] [2019-11-07 04:41:52,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:52,523 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:52,524 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88664966] [2019-11-07 04:41:52,525 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:52,526 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:41:52,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101902106] [2019-11-07 04:41:52,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:41:52,535 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:52,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:41:52,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:52,552 INFO L87 Difference]: Start difference. First operand 417 states. Second operand 3 states. [2019-11-07 04:41:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:52,737 INFO L93 Difference]: Finished difference Result 620 states and 1089 transitions. [2019-11-07 04:41:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:41:52,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-07 04:41:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:52,766 INFO L225 Difference]: With dead ends: 620 [2019-11-07 04:41:52,766 INFO L226 Difference]: Without dead ends: 491 [2019-11-07 04:41:52,771 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:41:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-11-07 04:41:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 485. [2019-11-07 04:41:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-07 04:41:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 624 transitions. [2019-11-07 04:41:52,845 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 624 transitions. Word has length 52 [2019-11-07 04:41:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:52,846 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 624 transitions. [2019-11-07 04:41:52,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:41:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 624 transitions. [2019-11-07 04:41:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 04:41:52,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:52,851 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] [2019-11-07 04:41:52,851 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:52,852 INFO L82 PathProgramCache]: Analyzing trace with hash 9345795, now seen corresponding path program 1 times [2019-11-07 04:41:52,852 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:52,852 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423828479] [2019-11-07 04:41:52,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:53,016 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:53,016 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423828479] [2019-11-07 04:41:53,017 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:53,017 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:41:53,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035122621] [2019-11-07 04:41:53,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:41:53,019 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:41:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:53,020 INFO L87 Difference]: Start difference. First operand 485 states and 624 transitions. Second operand 3 states. [2019-11-07 04:41:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:53,087 INFO L93 Difference]: Finished difference Result 786 states and 1042 transitions. [2019-11-07 04:41:53,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:41:53,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-07 04:41:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:53,092 INFO L225 Difference]: With dead ends: 786 [2019-11-07 04:41:53,093 INFO L226 Difference]: Without dead ends: 616 [2019-11-07 04:41:53,098 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:41:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-07 04:41:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 610. [2019-11-07 04:41:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-11-07 04:41:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 797 transitions. [2019-11-07 04:41:53,194 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 797 transitions. Word has length 52 [2019-11-07 04:41:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:53,195 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 797 transitions. [2019-11-07 04:41:53,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:41:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 797 transitions. [2019-11-07 04:41:53,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 04:41:53,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:53,209 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] [2019-11-07 04:41:53,209 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:53,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:53,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1581802972, now seen corresponding path program 1 times [2019-11-07 04:41:53,210 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:53,210 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806838361] [2019-11-07 04:41:53,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:53,482 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:53,483 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806838361] [2019-11-07 04:41:53,483 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:53,483 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:41:53,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479828652] [2019-11-07 04:41:53,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:41:53,484 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:53,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:41:53,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:41:53,485 INFO L87 Difference]: Start difference. First operand 610 states and 797 transitions. Second operand 10 states. [2019-11-07 04:41:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:55,253 INFO L93 Difference]: Finished difference Result 1611 states and 2204 transitions. [2019-11-07 04:41:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 04:41:55,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-07 04:41:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:55,263 INFO L225 Difference]: With dead ends: 1611 [2019-11-07 04:41:55,263 INFO L226 Difference]: Without dead ends: 1521 [2019-11-07 04:41:55,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-11-07 04:41:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-11-07 04:41:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 621. [2019-11-07 04:41:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-11-07 04:41:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 811 transitions. [2019-11-07 04:41:55,319 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 811 transitions. Word has length 52 [2019-11-07 04:41:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:55,320 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 811 transitions. [2019-11-07 04:41:55,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:41:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 811 transitions. [2019-11-07 04:41:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:41:55,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:55,324 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] [2019-11-07 04:41:55,324 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash 666756999, now seen corresponding path program 1 times [2019-11-07 04:41:55,325 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:55,325 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141079014] [2019-11-07 04:41:55,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:55,427 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,427 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141079014] [2019-11-07 04:41:55,427 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:55,428 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:41:55,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508810043] [2019-11-07 04:41:55,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:41:55,428 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:55,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:41:55,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:41:55,431 INFO L87 Difference]: Start difference. First operand 621 states and 811 transitions. Second operand 3 states. [2019-11-07 04:41:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:55,527 INFO L93 Difference]: Finished difference Result 1096 states and 1460 transitions. [2019-11-07 04:41:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:41:55,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-07 04:41:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:55,532 INFO L225 Difference]: With dead ends: 1096 [2019-11-07 04:41:55,532 INFO L226 Difference]: Without dead ends: 867 [2019-11-07 04:41:55,533 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:41:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-11-07 04:41:55,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 860. [2019-11-07 04:41:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-11-07 04:41:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1131 transitions. [2019-11-07 04:41:55,582 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1131 transitions. Word has length 53 [2019-11-07 04:41:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:55,582 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1131 transitions. [2019-11-07 04:41:55,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:41:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1131 transitions. [2019-11-07 04:41:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:41:55,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:55,585 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] [2019-11-07 04:41:55,585 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:55,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash 560716068, now seen corresponding path program 1 times [2019-11-07 04:41:55,586 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:55,586 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601039351] [2019-11-07 04:41:55,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:55,742 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,742 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601039351] [2019-11-07 04:41:55,743 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:55,743 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:41:55,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343364341] [2019-11-07 04:41:55,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:41:55,745 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:55,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:41:55,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:41:55,746 INFO L87 Difference]: Start difference. First operand 860 states and 1131 transitions. Second operand 10 states. [2019-11-07 04:41:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:57,571 INFO L93 Difference]: Finished difference Result 1823 states and 2421 transitions. [2019-11-07 04:41:57,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 04:41:57,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-11-07 04:41:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:57,580 INFO L225 Difference]: With dead ends: 1823 [2019-11-07 04:41:57,580 INFO L226 Difference]: Without dead ends: 1684 [2019-11-07 04:41:57,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-11-07 04:41:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-11-07 04:41:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 860. [2019-11-07 04:41:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-11-07 04:41:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1131 transitions. [2019-11-07 04:41:57,651 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1131 transitions. Word has length 53 [2019-11-07 04:41:57,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:57,651 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1131 transitions. [2019-11-07 04:41:57,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:41:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1131 transitions. [2019-11-07 04:41:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:41:57,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:57,654 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] [2019-11-07 04:41:57,654 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1009485033, now seen corresponding path program 1 times [2019-11-07 04:41:57,655 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:57,655 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858378202] [2019-11-07 04:41:57,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:57,943 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:57,943 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858378202] [2019-11-07 04:41:57,944 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:57,944 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:41:57,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728888422] [2019-11-07 04:41:57,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:41:57,945 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:57,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:41:57,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:41:57,946 INFO L87 Difference]: Start difference. First operand 860 states and 1131 transitions. Second operand 12 states. [2019-11-07 04:42:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:01,420 INFO L93 Difference]: Finished difference Result 2593 states and 3482 transitions. [2019-11-07 04:42:01,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-07 04:42:01,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-07 04:42:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:01,435 INFO L225 Difference]: With dead ends: 2593 [2019-11-07 04:42:01,435 INFO L226 Difference]: Without dead ends: 2471 [2019-11-07 04:42:01,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-11-07 04:42:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-11-07 04:42:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 876. [2019-11-07 04:42:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-11-07 04:42:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1154 transitions. [2019-11-07 04:42:01,538 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1154 transitions. Word has length 53 [2019-11-07 04:42:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:01,542 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1154 transitions. [2019-11-07 04:42:01,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:42:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1154 transitions. [2019-11-07 04:42:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-07 04:42:01,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:01,545 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] [2019-11-07 04:42:01,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:01,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1713025086, now seen corresponding path program 1 times [2019-11-07 04:42:01,550 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:01,550 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122353686] [2019-11-07 04:42:01,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:01,751 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:01,752 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122353686] [2019-11-07 04:42:01,752 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:01,752 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:01,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975817620] [2019-11-07 04:42:01,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:01,753 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:01,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:01,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:01,754 INFO L87 Difference]: Start difference. First operand 876 states and 1154 transitions. Second operand 9 states. [2019-11-07 04:42:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:03,116 INFO L93 Difference]: Finished difference Result 3059 states and 4131 transitions. [2019-11-07 04:42:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:42:03,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-11-07 04:42:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:03,128 INFO L225 Difference]: With dead ends: 3059 [2019-11-07 04:42:03,128 INFO L226 Difference]: Without dead ends: 2491 [2019-11-07 04:42:03,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:42:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2019-11-07 04:42:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 1818. [2019-11-07 04:42:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1818 states. [2019-11-07 04:42:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2449 transitions. [2019-11-07 04:42:03,321 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2449 transitions. Word has length 53 [2019-11-07 04:42:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:03,322 INFO L462 AbstractCegarLoop]: Abstraction has 1818 states and 2449 transitions. [2019-11-07 04:42:03,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2449 transitions. [2019-11-07 04:42:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:03,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:03,326 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:03,326 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:03,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:03,327 INFO L82 PathProgramCache]: Analyzing trace with hash -9109944, now seen corresponding path program 1 times [2019-11-07 04:42:03,327 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:03,327 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223438542] [2019-11-07 04:42:03,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:03,452 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,453 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223438542] [2019-11-07 04:42:03,453 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:03,453 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:42:03,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053000645] [2019-11-07 04:42:03,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:42:03,454 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:03,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:42:03,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:42:03,454 INFO L87 Difference]: Start difference. First operand 1818 states and 2449 transitions. Second operand 7 states. [2019-11-07 04:42:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:04,792 INFO L93 Difference]: Finished difference Result 4552 states and 6282 transitions. [2019-11-07 04:42:04,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:42:04,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-07 04:42:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:04,812 INFO L225 Difference]: With dead ends: 4552 [2019-11-07 04:42:04,812 INFO L226 Difference]: Without dead ends: 4309 [2019-11-07 04:42:04,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:42:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2019-11-07 04:42:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 1819. [2019-11-07 04:42:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2019-11-07 04:42:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2451 transitions. [2019-11-07 04:42:05,101 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2451 transitions. Word has length 54 [2019-11-07 04:42:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:05,102 INFO L462 AbstractCegarLoop]: Abstraction has 1819 states and 2451 transitions. [2019-11-07 04:42:05,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:42:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2451 transitions. [2019-11-07 04:42:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:05,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:05,105 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:05,106 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:05,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash -655737991, now seen corresponding path program 1 times [2019-11-07 04:42:05,106 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:05,107 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773065930] [2019-11-07 04:42:05,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:05,262 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,262 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773065930] [2019-11-07 04:42:05,264 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:05,264 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:05,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107280981] [2019-11-07 04:42:05,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:05,265 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:05,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:05,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:05,266 INFO L87 Difference]: Start difference. First operand 1819 states and 2451 transitions. Second operand 9 states. [2019-11-07 04:42:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:06,886 INFO L93 Difference]: Finished difference Result 4073 states and 5514 transitions. [2019-11-07 04:42:06,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 04:42:06,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-07 04:42:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:06,900 INFO L225 Difference]: With dead ends: 4073 [2019-11-07 04:42:06,900 INFO L226 Difference]: Without dead ends: 3737 [2019-11-07 04:42:06,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:42:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2019-11-07 04:42:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 1834. [2019-11-07 04:42:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2019-11-07 04:42:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2473 transitions. [2019-11-07 04:42:07,176 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2473 transitions. Word has length 54 [2019-11-07 04:42:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:07,178 INFO L462 AbstractCegarLoop]: Abstraction has 1834 states and 2473 transitions. [2019-11-07 04:42:07,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2473 transitions. [2019-11-07 04:42:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:07,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:07,182 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:07,182 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash 756516257, now seen corresponding path program 1 times [2019-11-07 04:42:07,183 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:07,183 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611326907] [2019-11-07 04:42:07,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:07,287 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,288 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611326907] [2019-11-07 04:42:07,290 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:07,290 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:07,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454806280] [2019-11-07 04:42:07,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:07,291 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:07,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:07,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:07,293 INFO L87 Difference]: Start difference. First operand 1834 states and 2473 transitions. Second operand 6 states. [2019-11-07 04:42:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:07,911 INFO L93 Difference]: Finished difference Result 2951 states and 4007 transitions. [2019-11-07 04:42:07,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:07,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-07 04:42:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:07,920 INFO L225 Difference]: With dead ends: 2951 [2019-11-07 04:42:07,921 INFO L226 Difference]: Without dead ends: 1707 [2019-11-07 04:42:07,923 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:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-07 04:42:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1270. [2019-11-07 04:42:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-11-07 04:42:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1694 transitions. [2019-11-07 04:42:08,103 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1694 transitions. Word has length 54 [2019-11-07 04:42:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:08,104 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 1694 transitions. [2019-11-07 04:42:08,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1694 transitions. [2019-11-07 04:42:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:08,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:08,106 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:08,107 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:08,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:08,107 INFO L82 PathProgramCache]: Analyzing trace with hash -280556856, now seen corresponding path program 1 times [2019-11-07 04:42:08,107 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:08,108 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705779155] [2019-11-07 04:42:08,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:08,236 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,237 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705779155] [2019-11-07 04:42:08,237 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:08,237 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:42:08,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500815064] [2019-11-07 04:42:08,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:42:08,238 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:08,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:42:08,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:42:08,239 INFO L87 Difference]: Start difference. First operand 1270 states and 1694 transitions. Second operand 10 states. [2019-11-07 04:42:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:11,591 INFO L93 Difference]: Finished difference Result 5723 states and 7880 transitions. [2019-11-07 04:42:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-07 04:42:11,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-11-07 04:42:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:11,607 INFO L225 Difference]: With dead ends: 5723 [2019-11-07 04:42:11,607 INFO L226 Difference]: Without dead ends: 5403 [2019-11-07 04:42:11,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-11-07 04:42:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-11-07 04:42:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 1270. [2019-11-07 04:42:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-11-07 04:42:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1694 transitions. [2019-11-07 04:42:11,844 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1694 transitions. Word has length 54 [2019-11-07 04:42:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:11,844 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 1694 transitions. [2019-11-07 04:42:11,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:42:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1694 transitions. [2019-11-07 04:42:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:11,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:11,847 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:11,847 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:11,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1957398696, now seen corresponding path program 1 times [2019-11-07 04:42:11,848 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:11,848 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400820044] [2019-11-07 04:42:11,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:11,975 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:11,975 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400820044] [2019-11-07 04:42:11,976 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:11,976 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:11,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187314243] [2019-11-07 04:42:11,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:11,977 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:11,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:11,977 INFO L87 Difference]: Start difference. First operand 1270 states and 1694 transitions. Second operand 9 states. [2019-11-07 04:42:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:13,449 INFO L93 Difference]: Finished difference Result 5418 states and 7321 transitions. [2019-11-07 04:42:13,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:42:13,449 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-07 04:42:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:13,467 INFO L225 Difference]: With dead ends: 5418 [2019-11-07 04:42:13,468 INFO L226 Difference]: Without dead ends: 4390 [2019-11-07 04:42:13,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-07 04:42:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-11-07 04:42:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 3039. [2019-11-07 04:42:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3039 states. [2019-11-07 04:42:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4094 transitions. [2019-11-07 04:42:13,971 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4094 transitions. Word has length 54 [2019-11-07 04:42:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:13,971 INFO L462 AbstractCegarLoop]: Abstraction has 3039 states and 4094 transitions. [2019-11-07 04:42:13,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4094 transitions. [2019-11-07 04:42:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:13,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:13,976 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:13,976 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:13,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:13,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1389548947, now seen corresponding path program 1 times [2019-11-07 04:42:13,977 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:13,977 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626899013] [2019-11-07 04:42:13,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:14,086 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626899013] [2019-11-07 04:42:14,086 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:14,086 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:14,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144911600] [2019-11-07 04:42:14,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:14,087 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:14,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:14,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:14,088 INFO L87 Difference]: Start difference. First operand 3039 states and 4094 transitions. Second operand 9 states. [2019-11-07 04:42:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:19,583 INFO L93 Difference]: Finished difference Result 11909 states and 16000 transitions. [2019-11-07 04:42:19,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 04:42:19,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-11-07 04:42:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:19,648 INFO L225 Difference]: With dead ends: 11909 [2019-11-07 04:42:19,648 INFO L226 Difference]: Without dead ends: 10979 [2019-11-07 04:42:19,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:42:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10979 states. [2019-11-07 04:42:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10979 to 3053. [2019-11-07 04:42:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-11-07 04:42:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 4112 transitions. [2019-11-07 04:42:20,284 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 4112 transitions. Word has length 54 [2019-11-07 04:42:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:20,284 INFO L462 AbstractCegarLoop]: Abstraction has 3053 states and 4112 transitions. [2019-11-07 04:42:20,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 4112 transitions. [2019-11-07 04:42:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:20,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:20,288 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:20,289 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1368275445, now seen corresponding path program 1 times [2019-11-07 04:42:20,289 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:20,290 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144719369] [2019-11-07 04:42:20,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:20,387 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:20,388 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144719369] [2019-11-07 04:42:20,388 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:20,388 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:42:20,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626191937] [2019-11-07 04:42:20,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:42:20,389 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:20,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:42:20,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:42:20,389 INFO L87 Difference]: Start difference. First operand 3053 states and 4112 transitions. Second operand 7 states. [2019-11-07 04:42:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:23,317 INFO L93 Difference]: Finished difference Result 9397 states and 12860 transitions. [2019-11-07 04:42:23,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:42:23,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-07 04:42:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:23,337 INFO L225 Difference]: With dead ends: 9397 [2019-11-07 04:42:23,337 INFO L226 Difference]: Without dead ends: 8587 [2019-11-07 04:42:23,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-07 04:42:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2019-11-07 04:42:24,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 3053. [2019-11-07 04:42:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-11-07 04:42:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 4112 transitions. [2019-11-07 04:42:24,041 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 4112 transitions. Word has length 55 [2019-11-07 04:42:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:24,041 INFO L462 AbstractCegarLoop]: Abstraction has 3053 states and 4112 transitions. [2019-11-07 04:42:24,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:42:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 4112 transitions. [2019-11-07 04:42:24,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:24,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:24,059 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:24,064 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:24,064 INFO L82 PathProgramCache]: Analyzing trace with hash 700602732, now seen corresponding path program 1 times [2019-11-07 04:42:24,065 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:24,065 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615847916] [2019-11-07 04:42:24,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:24,224 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:24,224 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615847916] [2019-11-07 04:42:24,224 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:24,224 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:24,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13658973] [2019-11-07 04:42:24,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:24,225 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:24,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:24,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:24,226 INFO L87 Difference]: Start difference. First operand 3053 states and 4112 transitions. Second operand 6 states. [2019-11-07 04:42:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:25,644 INFO L93 Difference]: Finished difference Result 5337 states and 7221 transitions. [2019-11-07 04:42:25,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:25,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-07 04:42:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:25,651 INFO L225 Difference]: With dead ends: 5337 [2019-11-07 04:42:25,651 INFO L226 Difference]: Without dead ends: 3006 [2019-11-07 04:42:25,659 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:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states.