/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label31.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:35:01,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:35:01,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:35:01,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:35:01,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:35:01,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:35:01,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:35:01,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:35:01,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:35:01,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:35:01,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:35:01,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:35:01,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:35:01,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:35:01,968 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:35:01,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:35:01,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:35:01,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:35:01,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:35:01,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:35:01,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:35:01,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:35:01,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:35:01,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:35:01,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:35:01,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:35:01,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:35:01,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:35:01,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:35:01,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:35:01,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:35:02,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:35:02,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:35:02,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:35:02,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:35:02,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:35:02,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:35:02,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:35:02,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:35:02,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:35:02,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:35:02,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:35:02,027 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:35:02,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:35:02,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:35:02,029 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:35:02,030 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:35:02,030 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:35:02,030 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:35:02,030 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:35:02,030 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:35:02,031 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:35:02,032 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:35:02,032 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:35:02,032 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:35:02,033 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:35:02,033 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:35:02,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:35:02,034 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:35:02,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:35:02,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:35:02,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:35:02,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:35:02,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:35:02,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:35:02,036 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:35:02,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:35:02,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:35:02,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:35:02,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:35:02,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:35:02,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:35:02,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:35:02,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:35:02,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:35:02,039 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:35:02,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:35:02,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:35:02,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:35:02,040 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:35:02,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:35:02,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:35:02,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:35:02,352 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:35:02,353 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:35:02,353 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label31.c [2019-11-23 23:35:02,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ccdb717d/a388db4721e94b249d8669304a0fa8b3/FLAG15402ee9a [2019-11-23 23:35:03,014 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:35:03,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label31.c [2019-11-23 23:35:03,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ccdb717d/a388db4721e94b249d8669304a0fa8b3/FLAG15402ee9a [2019-11-23 23:35:03,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ccdb717d/a388db4721e94b249d8669304a0fa8b3 [2019-11-23 23:35:03,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:35:03,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:35:03,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:03,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:35:03,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:35:03,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:03" (1/1) ... [2019-11-23 23:35:03,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b35c066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:03, skipping insertion in model container [2019-11-23 23:35:03,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:35:03" (1/1) ... [2019-11-23 23:35:03,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:35:03,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:35:04,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:04,095 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:35:04,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:35:04,373 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:35:04,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04 WrapperNode [2019-11-23 23:35:04,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:35:04,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:04,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:35:04,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:35:04,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (1/1) ... [2019-11-23 23:35:04,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (1/1) ... [2019-11-23 23:35:04,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:35:04,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:35:04,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:35:04,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:35:04,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (1/1) ... [2019-11-23 23:35:04,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (1/1) ... [2019-11-23 23:35:04,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (1/1) ... [2019-11-23 23:35:04,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (1/1) ... [2019-11-23 23:35:04,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (1/1) ... [2019-11-23 23:35:04,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (1/1) ... [2019-11-23 23:35:04,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (1/1) ... [2019-11-23 23:35:04,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:35:04,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:35:04,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:35:04,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:35:04,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (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-23 23:35:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:35:04,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:35:07,919 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:35:07,919 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:35:07,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:07 BoogieIcfgContainer [2019-11-23 23:35:07,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:35:07,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:35:07,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:35:07,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:35:07,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:35:03" (1/3) ... [2019-11-23 23:35:07,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483a062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:07, skipping insertion in model container [2019-11-23 23:35:07,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:35:04" (2/3) ... [2019-11-23 23:35:07,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483a062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:35:07, skipping insertion in model container [2019-11-23 23:35:07,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:35:07" (3/3) ... [2019-11-23 23:35:07,930 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label31.c [2019-11-23 23:35:07,941 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:35:07,950 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:35:07,961 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:35:07,996 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:35:07,997 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:35:07,997 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:35:07,997 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:35:07,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:35:07,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:35:07,997 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:35:07,997 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:35:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-23 23:35:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:35:08,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:08,042 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:08,042 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1467462635, now seen corresponding path program 1 times [2019-11-23 23:35:08,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:08,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92673527] [2019-11-23 23:35:08,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:08,809 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-23 23:35:08,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92673527] [2019-11-23 23:35:08,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:08,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:08,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32989515] [2019-11-23 23:35:08,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:08,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:08,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:08,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:08,838 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-23 23:35:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:10,404 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-11-23 23:35:10,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:10,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 23:35:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:10,429 INFO L225 Difference]: With dead ends: 585 [2019-11-23 23:35:10,429 INFO L226 Difference]: Without dead ends: 432 [2019-11-23 23:35:10,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-11-23 23:35:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-11-23 23:35:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-23 23:35:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 521 transitions. [2019-11-23 23:35:10,498 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 521 transitions. Word has length 143 [2019-11-23 23:35:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:10,499 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 521 transitions. [2019-11-23 23:35:10,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 521 transitions. [2019-11-23 23:35:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 23:35:10,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:10,503 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:10,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:10,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1977889612, now seen corresponding path program 1 times [2019-11-23 23:35:10,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:10,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858862907] [2019-11-23 23:35:10,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:10,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858862907] [2019-11-23 23:35:10,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:10,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:10,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431384361] [2019-11-23 23:35:10,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:10,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:10,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:10,598 INFO L87 Difference]: Start difference. First operand 289 states and 521 transitions. Second operand 3 states. [2019-11-23 23:35:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:11,552 INFO L93 Difference]: Finished difference Result 863 states and 1560 transitions. [2019-11-23 23:35:11,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:11,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 23:35:11,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:11,558 INFO L225 Difference]: With dead ends: 863 [2019-11-23 23:35:11,558 INFO L226 Difference]: Without dead ends: 575 [2019-11-23 23:35:11,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 23:35:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-11-23 23:35:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-11-23 23:35:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-11-23 23:35:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1015 transitions. [2019-11-23 23:35:11,600 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1015 transitions. Word has length 151 [2019-11-23 23:35:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:11,601 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1015 transitions. [2019-11-23 23:35:11,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1015 transitions. [2019-11-23 23:35:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 23:35:11,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:11,607 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:11,607 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:11,608 INFO L82 PathProgramCache]: Analyzing trace with hash -119325203, now seen corresponding path program 1 times [2019-11-23 23:35:11,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:11,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680941954] [2019-11-23 23:35:11,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:11,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680941954] [2019-11-23 23:35:11,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:11,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:11,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761696300] [2019-11-23 23:35:11,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:11,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:11,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:11,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:11,686 INFO L87 Difference]: Start difference. First operand 575 states and 1015 transitions. Second operand 4 states. [2019-11-23 23:35:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:13,108 INFO L93 Difference]: Finished difference Result 2293 states and 4055 transitions. [2019-11-23 23:35:13,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:13,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-23 23:35:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:13,121 INFO L225 Difference]: With dead ends: 2293 [2019-11-23 23:35:13,121 INFO L226 Difference]: Without dead ends: 1719 [2019-11-23 23:35:13,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-23 23:35:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1147. [2019-11-23 23:35:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-11-23 23:35:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1880 transitions. [2019-11-23 23:35:13,196 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1880 transitions. Word has length 152 [2019-11-23 23:35:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:13,198 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1880 transitions. [2019-11-23 23:35:13,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1880 transitions. [2019-11-23 23:35:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 23:35:13,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:13,206 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:13,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash 351567857, now seen corresponding path program 1 times [2019-11-23 23:35:13,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:13,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835988592] [2019-11-23 23:35:13,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:13,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835988592] [2019-11-23 23:35:13,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:13,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:13,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730647290] [2019-11-23 23:35:13,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:13,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:13,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:13,465 INFO L87 Difference]: Start difference. First operand 1147 states and 1880 transitions. Second operand 4 states. [2019-11-23 23:35:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:14,908 INFO L93 Difference]: Finished difference Result 4581 states and 7515 transitions. [2019-11-23 23:35:14,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:14,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-23 23:35:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:14,926 INFO L225 Difference]: With dead ends: 4581 [2019-11-23 23:35:14,927 INFO L226 Difference]: Without dead ends: 3435 [2019-11-23 23:35:14,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-11-23 23:35:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2019-11-23 23:35:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-11-23 23:35:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5021 transitions. [2019-11-23 23:35:15,011 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5021 transitions. Word has length 158 [2019-11-23 23:35:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:15,012 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5021 transitions. [2019-11-23 23:35:15,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5021 transitions. [2019-11-23 23:35:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-23 23:35:15,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:15,021 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:15,021 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:15,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1925408778, now seen corresponding path program 1 times [2019-11-23 23:35:15,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:15,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813149142] [2019-11-23 23:35:15,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:15,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813149142] [2019-11-23 23:35:15,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:15,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:35:15,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857861944] [2019-11-23 23:35:15,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:15,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:15,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:15,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:15,204 INFO L87 Difference]: Start difference. First operand 3435 states and 5021 transitions. Second operand 3 states. [2019-11-23 23:35:16,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:16,088 INFO L93 Difference]: Finished difference Result 8013 states and 11565 transitions. [2019-11-23 23:35:16,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:16,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-23 23:35:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:16,109 INFO L225 Difference]: With dead ends: 8013 [2019-11-23 23:35:16,110 INFO L226 Difference]: Without dead ends: 4579 [2019-11-23 23:35:16,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 23:35:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-11-23 23:35:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4579. [2019-11-23 23:35:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2019-11-23 23:35:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 6383 transitions. [2019-11-23 23:35:16,202 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 6383 transitions. Word has length 184 [2019-11-23 23:35:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:16,202 INFO L462 AbstractCegarLoop]: Abstraction has 4579 states and 6383 transitions. [2019-11-23 23:35:16,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 6383 transitions. [2019-11-23 23:35:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-23 23:35:16,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:16,213 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:16,213 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:16,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:16,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2078801831, now seen corresponding path program 1 times [2019-11-23 23:35:16,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:16,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405211189] [2019-11-23 23:35:16,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:16,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405211189] [2019-11-23 23:35:16,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615523317] [2019-11-23 23:35:16,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:16,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:35:16,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:16,744 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:16,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:16,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:16,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099959152] [2019-11-23 23:35:16,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:16,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:16,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:16,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:16,811 INFO L87 Difference]: Start difference. First operand 4579 states and 6383 transitions. Second operand 3 states. [2019-11-23 23:35:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:17,734 INFO L93 Difference]: Finished difference Result 13018 states and 18270 transitions. [2019-11-23 23:35:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:17,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-11-23 23:35:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:17,772 INFO L225 Difference]: With dead ends: 13018 [2019-11-23 23:35:17,772 INFO L226 Difference]: Without dead ends: 8440 [2019-11-23 23:35:17,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8440 states. [2019-11-23 23:35:17,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8440 to 7296. [2019-11-23 23:35:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2019-11-23 23:35:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 10392 transitions. [2019-11-23 23:35:17,954 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 10392 transitions. Word has length 191 [2019-11-23 23:35:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:17,954 INFO L462 AbstractCegarLoop]: Abstraction has 7296 states and 10392 transitions. [2019-11-23 23:35:17,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 10392 transitions. [2019-11-23 23:35:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-23 23:35:17,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:17,973 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:18,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:18,178 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash 2057951480, now seen corresponding path program 1 times [2019-11-23 23:35:18,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:18,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501933680] [2019-11-23 23:35:18,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:18,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501933680] [2019-11-23 23:35:18,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:18,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:18,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241494163] [2019-11-23 23:35:18,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:18,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:18,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:18,463 INFO L87 Difference]: Start difference. First operand 7296 states and 10392 transitions. Second operand 4 states. [2019-11-23 23:35:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:19,972 INFO L93 Difference]: Finished difference Result 17022 states and 23936 transitions. [2019-11-23 23:35:19,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:19,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-11-23 23:35:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:20,007 INFO L225 Difference]: With dead ends: 17022 [2019-11-23 23:35:20,007 INFO L226 Difference]: Without dead ends: 9727 [2019-11-23 23:35:20,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9727 states. [2019-11-23 23:35:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9727 to 8011. [2019-11-23 23:35:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2019-11-23 23:35:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 11069 transitions. [2019-11-23 23:35:20,159 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 11069 transitions. Word has length 206 [2019-11-23 23:35:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:20,160 INFO L462 AbstractCegarLoop]: Abstraction has 8011 states and 11069 transitions. [2019-11-23 23:35:20,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 11069 transitions. [2019-11-23 23:35:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-23 23:35:20,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:20,176 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:20,177 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:20,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:20,177 INFO L82 PathProgramCache]: Analyzing trace with hash 139274080, now seen corresponding path program 1 times [2019-11-23 23:35:20,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:20,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121541644] [2019-11-23 23:35:20,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-23 23:35:20,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121541644] [2019-11-23 23:35:20,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:20,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:20,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37903329] [2019-11-23 23:35:20,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:35:20,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:35:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:20,350 INFO L87 Difference]: Start difference. First operand 8011 states and 11069 transitions. Second operand 4 states. [2019-11-23 23:35:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:21,713 INFO L93 Difference]: Finished difference Result 28033 states and 38368 transitions. [2019-11-23 23:35:21,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:21,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-23 23:35:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:21,749 INFO L225 Difference]: With dead ends: 28033 [2019-11-23 23:35:21,749 INFO L226 Difference]: Without dead ends: 20023 [2019-11-23 23:35:21,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:35:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20023 states. [2019-11-23 23:35:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20023 to 13302. [2019-11-23 23:35:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13302 states. [2019-11-23 23:35:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13302 states to 13302 states and 17491 transitions. [2019-11-23 23:35:21,984 INFO L78 Accepts]: Start accepts. Automaton has 13302 states and 17491 transitions. Word has length 208 [2019-11-23 23:35:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:21,984 INFO L462 AbstractCegarLoop]: Abstraction has 13302 states and 17491 transitions. [2019-11-23 23:35:21,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:35:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 13302 states and 17491 transitions. [2019-11-23 23:35:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-23 23:35:22,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:22,014 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:22,014 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash -904017325, now seen corresponding path program 1 times [2019-11-23 23:35:22,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:22,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674433111] [2019-11-23 23:35:22,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:35:22,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674433111] [2019-11-23 23:35:22,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:22,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:22,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480716199] [2019-11-23 23:35:22,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:35:22,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:22,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:35:22,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:22,498 INFO L87 Difference]: Start difference. First operand 13302 states and 17491 transitions. Second operand 5 states. [2019-11-23 23:35:23,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:23,659 INFO L93 Difference]: Finished difference Result 35614 states and 46275 transitions. [2019-11-23 23:35:23,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:35:23,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2019-11-23 23:35:23,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:23,701 INFO L225 Difference]: With dead ends: 35614 [2019-11-23 23:35:23,701 INFO L226 Difference]: Without dead ends: 22313 [2019-11-23 23:35:23,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:23,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22313 states. [2019-11-23 23:35:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22313 to 20595. [2019-11-23 23:35:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20595 states. [2019-11-23 23:35:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20595 states to 20595 states and 26487 transitions. [2019-11-23 23:35:24,184 INFO L78 Accepts]: Start accepts. Automaton has 20595 states and 26487 transitions. Word has length 292 [2019-11-23 23:35:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:24,185 INFO L462 AbstractCegarLoop]: Abstraction has 20595 states and 26487 transitions. [2019-11-23 23:35:24,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:35:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 20595 states and 26487 transitions. [2019-11-23 23:35:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-23 23:35:24,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:24,233 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:24,233 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:24,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:24,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1973960670, now seen corresponding path program 1 times [2019-11-23 23:35:24,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:24,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649114121] [2019-11-23 23:35:24,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-23 23:35:24,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649114121] [2019-11-23 23:35:24,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728294413] [2019-11-23 23:35:24,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:24,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:35:24,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:24,858 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:24,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:35:25,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-11-23 23:35:25,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31452598] [2019-11-23 23:35:25,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:25,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:25,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:25,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:25,003 INFO L87 Difference]: Start difference. First operand 20595 states and 26487 transitions. Second operand 3 states. [2019-11-23 23:35:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:26,531 INFO L93 Difference]: Finished difference Result 45479 states and 58436 transitions. [2019-11-23 23:35:26,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:26,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-23 23:35:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:26,568 INFO L225 Difference]: With dead ends: 45479 [2019-11-23 23:35:26,569 INFO L226 Difference]: Without dead ends: 24885 [2019-11-23 23:35:26,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 597 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:35:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24885 states. [2019-11-23 23:35:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24885 to 22740. [2019-11-23 23:35:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22740 states. [2019-11-23 23:35:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22740 states to 22740 states and 27767 transitions. [2019-11-23 23:35:26,924 INFO L78 Accepts]: Start accepts. Automaton has 22740 states and 27767 transitions. Word has length 300 [2019-11-23 23:35:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:26,924 INFO L462 AbstractCegarLoop]: Abstraction has 22740 states and 27767 transitions. [2019-11-23 23:35:26,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 22740 states and 27767 transitions. [2019-11-23 23:35:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-23 23:35:26,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:26,959 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:27,171 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:27,172 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:27,173 INFO L82 PathProgramCache]: Analyzing trace with hash 666467757, now seen corresponding path program 1 times [2019-11-23 23:35:27,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:27,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467233899] [2019-11-23 23:35:27,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:35:27,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467233899] [2019-11-23 23:35:27,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:27,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:27,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588618064] [2019-11-23 23:35:27,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:27,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:27,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:27,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:27,581 INFO L87 Difference]: Start difference. First operand 22740 states and 27767 transitions. Second operand 3 states. [2019-11-23 23:35:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:28,640 INFO L93 Difference]: Finished difference Result 50341 states and 61388 transitions. [2019-11-23 23:35:28,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:28,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-11-23 23:35:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:28,675 INFO L225 Difference]: With dead ends: 50341 [2019-11-23 23:35:28,675 INFO L226 Difference]: Without dead ends: 27602 [2019-11-23 23:35:28,694 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-23 23:35:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27602 states. [2019-11-23 23:35:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27602 to 27602. [2019-11-23 23:35:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27602 states. [2019-11-23 23:35:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27602 states to 27602 states and 32722 transitions. [2019-11-23 23:35:29,109 INFO L78 Accepts]: Start accepts. Automaton has 27602 states and 32722 transitions. Word has length 348 [2019-11-23 23:35:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:29,110 INFO L462 AbstractCegarLoop]: Abstraction has 27602 states and 32722 transitions. [2019-11-23 23:35:29,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 27602 states and 32722 transitions. [2019-11-23 23:35:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-11-23 23:35:29,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:29,144 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:35:29,144 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:29,144 INFO L82 PathProgramCache]: Analyzing trace with hash -415164222, now seen corresponding path program 1 times [2019-11-23 23:35:29,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:29,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945699751] [2019-11-23 23:35:29,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-11-23 23:35:29,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945699751] [2019-11-23 23:35:29,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:29,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:35:29,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929225149] [2019-11-23 23:35:29,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 23:35:29,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:29,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 23:35:29,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:29,575 INFO L87 Difference]: Start difference. First operand 27602 states and 32722 transitions. Second operand 5 states. [2019-11-23 23:35:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:31,579 INFO L93 Difference]: Finished difference Result 111694 states and 131680 transitions. [2019-11-23 23:35:31,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:35:31,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 354 [2019-11-23 23:35:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:31,653 INFO L225 Difference]: With dead ends: 111694 [2019-11-23 23:35:31,653 INFO L226 Difference]: Without dead ends: 84093 [2019-11-23 23:35:31,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:35:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84093 states. [2019-11-23 23:35:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84093 to 82800. [2019-11-23 23:35:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82800 states. [2019-11-23 23:35:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82800 states to 82800 states and 97468 transitions. [2019-11-23 23:35:32,846 INFO L78 Accepts]: Start accepts. Automaton has 82800 states and 97468 transitions. Word has length 354 [2019-11-23 23:35:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:32,847 INFO L462 AbstractCegarLoop]: Abstraction has 82800 states and 97468 transitions. [2019-11-23 23:35:32,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 23:35:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 82800 states and 97468 transitions. [2019-11-23 23:35:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-23 23:35:32,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:32,869 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 23:35:32,870 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:32,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:32,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1746320556, now seen corresponding path program 1 times [2019-11-23 23:35:32,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:32,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433367515] [2019-11-23 23:35:32,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:33,049 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-23 23:35:33,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433367515] [2019-11-23 23:35:33,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:35:33,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:35:33,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92001514] [2019-11-23 23:35:33,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:35:33,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:35:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:35:33,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:35:33,052 INFO L87 Difference]: Start difference. First operand 82800 states and 97468 transitions. Second operand 3 states. [2019-11-23 23:35:35,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:35:35,299 INFO L93 Difference]: Finished difference Result 167315 states and 196656 transitions. [2019-11-23 23:35:35,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:35:35,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-11-23 23:35:35,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:35:35,379 INFO L225 Difference]: With dead ends: 167315 [2019-11-23 23:35:35,379 INFO L226 Difference]: Without dead ends: 84516 [2019-11-23 23:35:35,417 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-23 23:35:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84516 states. [2019-11-23 23:35:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84516 to 79368. [2019-11-23 23:35:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79368 states. [2019-11-23 23:35:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79368 states to 79368 states and 91144 transitions. [2019-11-23 23:35:36,541 INFO L78 Accepts]: Start accepts. Automaton has 79368 states and 91144 transitions. Word has length 375 [2019-11-23 23:35:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:35:36,542 INFO L462 AbstractCegarLoop]: Abstraction has 79368 states and 91144 transitions. [2019-11-23 23:35:36,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:35:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 79368 states and 91144 transitions. [2019-11-23 23:35:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-11-23 23:35:36,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:35:36,560 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-23 23:35:36,560 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:35:36,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:35:36,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2037095444, now seen corresponding path program 1 times [2019-11-23 23:35:36,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:35:36,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291135543] [2019-11-23 23:35:36,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:35:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 337 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:37,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291135543] [2019-11-23 23:35:37,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551489962] [2019-11-23 23:35:37,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:35:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:35:37,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 23:35:37,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:35:37,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:35:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 236 proven. 115 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:37,404 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:35:37,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 23:35:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 236 proven. 115 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:35:37,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1215107784] [2019-11-23 23:35:37,600 INFO L159 IcfgInterpreter]: Started Sifa with 145 locations of interest [2019-11-23 23:35:37,600 INFO L166 IcfgInterpreter]: Building call graph [2019-11-23 23:35:37,607 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-23 23:35:37,614 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-23 23:35:37,615 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-23 23:36:03,617 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-23 23:36:03,636 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-23 23:36:03,687 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-23 23:36:12,938 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-23 23:36:15,247 WARN L192 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 231 DAG size of output: 203 [2019-11-23 23:36:17,577 WARN L192 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 232 DAG size of output: 206 [2019-11-23 23:36:20,057 WARN L192 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 234 DAG size of output: 204 [2019-11-23 23:36:20,509 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-11-23 23:36:22,137 WARN L192 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 172 [2019-11-23 23:36:24,185 WARN L192 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 195 DAG size of output: 169