/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/ssh-simplified/s3_clnt_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:01:15,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:01:15,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:01:15,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:01:15,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:01:15,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:01:15,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:01:15,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:01:15,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:01:15,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:01:15,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:01:15,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:01:15,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:01:15,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:01:15,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:01:15,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:01:15,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:01:15,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:01:15,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:01:15,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:01:15,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:01:15,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:01:15,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:01:15,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:01:15,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:01:15,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:01:15,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:01:15,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:01:15,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:01:15,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:01:15,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:01:15,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:01:15,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:01:15,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:01:15,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:01:15,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:01:15,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:01:15,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:01:15,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:01:15,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:01:15,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:01:15,107 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-24 06:01:15,142 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:01:15,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:01:15,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:01:15,145 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:01:15,145 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:01:15,145 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:01:15,145 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:01:15,145 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:01:15,146 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:01:15,146 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:01:15,146 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:01:15,146 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:01:15,146 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:01:15,146 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:01:15,147 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:01:15,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:01:15,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:01:15,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:01:15,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:01:15,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:01:15,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:01:15,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:01:15,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:01:15,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:01:15,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:01:15,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:01:15,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:01:15,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:01:15,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:01:15,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:01:15,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:01:15,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:01:15,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:01:15,151 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:01:15,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:01:15,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:01:15,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:01:15,152 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:01:15,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:01:15,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:01:15,441 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:01:15,443 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:01:15,443 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:01:15,444 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-24 06:01:15,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d38690b37/d36e37e4f0094841a7a679c3cd659b66/FLAGe523c79c5 [2019-11-24 06:01:16,003 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:01:16,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-24 06:01:16,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d38690b37/d36e37e4f0094841a7a679c3cd659b66/FLAGe523c79c5 [2019-11-24 06:01:16,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d38690b37/d36e37e4f0094841a7a679c3cd659b66 [2019-11-24 06:01:16,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:01:16,354 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:01:16,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:01:16,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:01:16,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:01:16,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffca4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16, skipping insertion in model container [2019-11-24 06:01:16,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:01:16,426 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:01:16,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:01:16,667 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:01:16,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:01:16,841 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:01:16,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16 WrapperNode [2019-11-24 06:01:16,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:01:16,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:01:16,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:01:16,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:01:16,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:01:16,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:01:16,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:01:16,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:01:16,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (1/1) ... [2019-11-24 06:01:16,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:01:16,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:01:16,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:01:16,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:01:16,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (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-24 06:01:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:01:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:01:17,116 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 06:01:17,686 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-24 06:01:17,686 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-24 06:01:18,022 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:01:18,022 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-24 06:01:18,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:01:18 BoogieIcfgContainer [2019-11-24 06:01:18,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:01:18,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:01:18,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:01:18,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:01:18,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:01:16" (1/3) ... [2019-11-24 06:01:18,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49da50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:01:18, skipping insertion in model container [2019-11-24 06:01:18,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:01:16" (2/3) ... [2019-11-24 06:01:18,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49da50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:01:18, skipping insertion in model container [2019-11-24 06:01:18,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:01:18" (3/3) ... [2019-11-24 06:01:18,034 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-11-24 06:01:18,047 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:01:18,056 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:01:18,071 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:01:18,101 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:01:18,102 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:01:18,102 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:01:18,102 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:01:18,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:01:18,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:01:18,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:01:18,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:01:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2019-11-24 06:01:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 06:01:18,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:18,135 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:01:18,136 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1123590087, now seen corresponding path program 1 times [2019-11-24 06:01:18,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:18,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136675320] [2019-11-24 06:01:18,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:18,408 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-24 06:01:18,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136675320] [2019-11-24 06:01:18,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:18,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:18,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849537625] [2019-11-24 06:01:18,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:18,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:18,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:18,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:18,433 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 3 states. [2019-11-24 06:01:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:18,682 INFO L93 Difference]: Finished difference Result 196 states and 338 transitions. [2019-11-24 06:01:18,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:18,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 06:01:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:18,702 INFO L225 Difference]: With dead ends: 196 [2019-11-24 06:01:18,702 INFO L226 Difference]: Without dead ends: 107 [2019-11-24 06:01:18,706 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-24 06:01:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-24 06:01:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2019-11-24 06:01:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-24 06:01:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2019-11-24 06:01:18,771 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 19 [2019-11-24 06:01:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:18,772 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2019-11-24 06:01:18,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2019-11-24 06:01:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 06:01:18,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:18,775 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] [2019-11-24 06:01:18,777 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:18,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:18,778 INFO L82 PathProgramCache]: Analyzing trace with hash 466928169, now seen corresponding path program 1 times [2019-11-24 06:01:18,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:18,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166126937] [2019-11-24 06:01:18,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:18,873 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-24 06:01:18,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166126937] [2019-11-24 06:01:18,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:18,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:18,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753588312] [2019-11-24 06:01:18,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:18,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:18,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:18,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:18,878 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand 3 states. [2019-11-24 06:01:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:19,044 INFO L93 Difference]: Finished difference Result 230 states and 354 transitions. [2019-11-24 06:01:19,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:19,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 06:01:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:19,046 INFO L225 Difference]: With dead ends: 230 [2019-11-24 06:01:19,046 INFO L226 Difference]: Without dead ends: 129 [2019-11-24 06:01:19,048 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-24 06:01:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-24 06:01:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2019-11-24 06:01:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-24 06:01:19,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 194 transitions. [2019-11-24 06:01:19,061 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 194 transitions. Word has length 20 [2019-11-24 06:01:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:19,061 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 194 transitions. [2019-11-24 06:01:19,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 194 transitions. [2019-11-24 06:01:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 06:01:19,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:19,065 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:01:19,065 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:19,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:19,065 INFO L82 PathProgramCache]: Analyzing trace with hash 272569858, now seen corresponding path program 1 times [2019-11-24 06:01:19,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:19,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856381042] [2019-11-24 06:01:19,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:01:19,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856381042] [2019-11-24 06:01:19,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:19,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:19,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225181683] [2019-11-24 06:01:19,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:19,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:19,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:19,115 INFO L87 Difference]: Start difference. First operand 124 states and 194 transitions. Second operand 3 states. [2019-11-24 06:01:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:19,257 INFO L93 Difference]: Finished difference Result 268 states and 423 transitions. [2019-11-24 06:01:19,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:19,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 06:01:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:19,259 INFO L225 Difference]: With dead ends: 268 [2019-11-24 06:01:19,260 INFO L226 Difference]: Without dead ends: 145 [2019-11-24 06:01:19,261 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-24 06:01:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-24 06:01:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-11-24 06:01:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-24 06:01:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 226 transitions. [2019-11-24 06:01:19,274 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 226 transitions. Word has length 37 [2019-11-24 06:01:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:19,275 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 226 transitions. [2019-11-24 06:01:19,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 226 transitions. [2019-11-24 06:01:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 06:01:19,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:19,277 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:01:19,278 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash 851148932, now seen corresponding path program 1 times [2019-11-24 06:01:19,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:19,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165755230] [2019-11-24 06:01:19,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:01:19,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165755230] [2019-11-24 06:01:19,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:19,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:19,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132215232] [2019-11-24 06:01:19,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:19,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:19,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:19,333 INFO L87 Difference]: Start difference. First operand 143 states and 226 transitions. Second operand 3 states. [2019-11-24 06:01:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:19,496 INFO L93 Difference]: Finished difference Result 287 states and 453 transitions. [2019-11-24 06:01:19,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:19,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 06:01:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:19,500 INFO L225 Difference]: With dead ends: 287 [2019-11-24 06:01:19,500 INFO L226 Difference]: Without dead ends: 145 [2019-11-24 06:01:19,504 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-24 06:01:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-24 06:01:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-11-24 06:01:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-24 06:01:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 224 transitions. [2019-11-24 06:01:19,531 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 224 transitions. Word has length 38 [2019-11-24 06:01:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:19,531 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 224 transitions. [2019-11-24 06:01:19,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 224 transitions. [2019-11-24 06:01:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 06:01:19,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:19,534 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:01:19,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1278580093, now seen corresponding path program 1 times [2019-11-24 06:01:19,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:19,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880088484] [2019-11-24 06:01:19,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-24 06:01:19,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880088484] [2019-11-24 06:01:19,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:19,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:19,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484346258] [2019-11-24 06:01:19,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:19,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:19,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:19,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:19,615 INFO L87 Difference]: Start difference. First operand 143 states and 224 transitions. Second operand 3 states. [2019-11-24 06:01:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:19,747 INFO L93 Difference]: Finished difference Result 305 states and 481 transitions. [2019-11-24 06:01:19,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:19,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-24 06:01:19,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:19,749 INFO L225 Difference]: With dead ends: 305 [2019-11-24 06:01:19,749 INFO L226 Difference]: Without dead ends: 163 [2019-11-24 06:01:19,750 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-24 06:01:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-24 06:01:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2019-11-24 06:01:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-24 06:01:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2019-11-24 06:01:19,760 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 251 transitions. Word has length 52 [2019-11-24 06:01:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:19,760 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-24 06:01:19,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 251 transitions. [2019-11-24 06:01:19,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 06:01:19,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:19,763 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:01:19,763 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:19,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:19,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1282404837, now seen corresponding path program 1 times [2019-11-24 06:01:19,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:19,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617549128] [2019-11-24 06:01:19,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-24 06:01:19,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617549128] [2019-11-24 06:01:19,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:19,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:19,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171207061] [2019-11-24 06:01:19,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:19,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:19,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:19,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:19,811 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. Second operand 3 states. [2019-11-24 06:01:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:19,943 INFO L93 Difference]: Finished difference Result 322 states and 505 transitions. [2019-11-24 06:01:19,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:19,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 06:01:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:19,946 INFO L225 Difference]: With dead ends: 322 [2019-11-24 06:01:19,947 INFO L226 Difference]: Without dead ends: 163 [2019-11-24 06:01:19,948 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-24 06:01:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-24 06:01:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2019-11-24 06:01:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-24 06:01:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2019-11-24 06:01:19,961 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 53 [2019-11-24 06:01:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:19,963 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2019-11-24 06:01:19,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2019-11-24 06:01:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 06:01:19,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:19,975 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:01:19,975 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:19,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1411520012, now seen corresponding path program 1 times [2019-11-24 06:01:19,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:19,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139961800] [2019-11-24 06:01:19,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:01:20,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139961800] [2019-11-24 06:01:20,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:20,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:20,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505582825] [2019-11-24 06:01:20,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:20,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:20,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:20,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:20,021 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand 3 states. [2019-11-24 06:01:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:20,184 INFO L93 Difference]: Finished difference Result 358 states and 562 transitions. [2019-11-24 06:01:20,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:20,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-24 06:01:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:20,186 INFO L225 Difference]: With dead ends: 358 [2019-11-24 06:01:20,187 INFO L226 Difference]: Without dead ends: 198 [2019-11-24 06:01:20,187 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-24 06:01:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-24 06:01:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-11-24 06:01:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-24 06:01:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 313 transitions. [2019-11-24 06:01:20,196 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 313 transitions. Word has length 56 [2019-11-24 06:01:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:20,196 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 313 transitions. [2019-11-24 06:01:20,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:20,197 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 313 transitions. [2019-11-24 06:01:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 06:01:20,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:20,198 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:01:20,198 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:20,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1247813702, now seen corresponding path program 1 times [2019-11-24 06:01:20,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:20,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323786225] [2019-11-24 06:01:20,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-24 06:01:20,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323786225] [2019-11-24 06:01:20,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:20,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:20,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956314177] [2019-11-24 06:01:20,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:20,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:20,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:20,235 INFO L87 Difference]: Start difference. First operand 198 states and 313 transitions. Second operand 3 states. [2019-11-24 06:01:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:20,365 INFO L93 Difference]: Finished difference Result 412 states and 653 transitions. [2019-11-24 06:01:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:20,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-24 06:01:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:20,367 INFO L225 Difference]: With dead ends: 412 [2019-11-24 06:01:20,367 INFO L226 Difference]: Without dead ends: 215 [2019-11-24 06:01:20,368 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-24 06:01:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-24 06:01:20,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-11-24 06:01:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-24 06:01:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 334 transitions. [2019-11-24 06:01:20,377 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 334 transitions. Word has length 65 [2019-11-24 06:01:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:20,377 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 334 transitions. [2019-11-24 06:01:20,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2019-11-24 06:01:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-24 06:01:20,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:20,379 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:01:20,379 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1665420164, now seen corresponding path program 1 times [2019-11-24 06:01:20,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:20,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488473638] [2019-11-24 06:01:20,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-24 06:01:20,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488473638] [2019-11-24 06:01:20,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:20,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:20,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736450210] [2019-11-24 06:01:20,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:20,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:20,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:20,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:20,431 INFO L87 Difference]: Start difference. First operand 213 states and 334 transitions. Second operand 3 states. [2019-11-24 06:01:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:20,546 INFO L93 Difference]: Finished difference Result 427 states and 669 transitions. [2019-11-24 06:01:20,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:20,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-24 06:01:20,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:20,548 INFO L225 Difference]: With dead ends: 427 [2019-11-24 06:01:20,549 INFO L226 Difference]: Without dead ends: 215 [2019-11-24 06:01:20,549 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-24 06:01:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-24 06:01:20,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-11-24 06:01:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-24 06:01:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 329 transitions. [2019-11-24 06:01:20,558 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 329 transitions. Word has length 66 [2019-11-24 06:01:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:20,558 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 329 transitions. [2019-11-24 06:01:20,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 329 transitions. [2019-11-24 06:01:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-24 06:01:20,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:20,560 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:01:20,560 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:20,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash 45416203, now seen corresponding path program 1 times [2019-11-24 06:01:20,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:20,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546789691] [2019-11-24 06:01:20,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-24 06:01:20,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546789691] [2019-11-24 06:01:20,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:20,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:20,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809861665] [2019-11-24 06:01:20,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:20,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:20,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:20,611 INFO L87 Difference]: Start difference. First operand 213 states and 329 transitions. Second operand 3 states. [2019-11-24 06:01:20,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:20,724 INFO L93 Difference]: Finished difference Result 440 states and 681 transitions. [2019-11-24 06:01:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:20,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-11-24 06:01:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:20,728 INFO L225 Difference]: With dead ends: 440 [2019-11-24 06:01:20,728 INFO L226 Difference]: Without dead ends: 228 [2019-11-24 06:01:20,729 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-24 06:01:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-24 06:01:20,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2019-11-24 06:01:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-24 06:01:20,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 345 transitions. [2019-11-24 06:01:20,738 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 345 transitions. Word has length 76 [2019-11-24 06:01:20,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:20,738 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 345 transitions. [2019-11-24 06:01:20,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 345 transitions. [2019-11-24 06:01:20,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-24 06:01:20,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:20,740 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:01:20,740 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:20,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:20,740 INFO L82 PathProgramCache]: Analyzing trace with hash -983653271, now seen corresponding path program 1 times [2019-11-24 06:01:20,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:20,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404666337] [2019-11-24 06:01:20,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-24 06:01:20,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404666337] [2019-11-24 06:01:20,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:01:20,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:01:20,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414569269] [2019-11-24 06:01:20,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:01:20,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:20,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:01:20,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:01:20,782 INFO L87 Difference]: Start difference. First operand 226 states and 345 transitions. Second operand 3 states. [2019-11-24 06:01:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:01:20,901 INFO L93 Difference]: Finished difference Result 453 states and 691 transitions. [2019-11-24 06:01:20,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:01:20,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-24 06:01:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:01:20,903 INFO L225 Difference]: With dead ends: 453 [2019-11-24 06:01:20,903 INFO L226 Difference]: Without dead ends: 228 [2019-11-24 06:01:20,904 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-24 06:01:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-24 06:01:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2019-11-24 06:01:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-24 06:01:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 339 transitions. [2019-11-24 06:01:20,914 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 339 transitions. Word has length 77 [2019-11-24 06:01:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:01:20,914 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 339 transitions. [2019-11-24 06:01:20,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:01:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 339 transitions. [2019-11-24 06:01:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-24 06:01:20,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:01:20,915 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-24 06:01:20,916 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:01:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:01:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1784395978, now seen corresponding path program 1 times [2019-11-24 06:01:20,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:01:20,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642516610] [2019-11-24 06:01:20,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:01:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-24 06:01:21,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642516610] [2019-11-24 06:01:21,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475944538] [2019-11-24 06:01:21,059 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-24 06:01:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:01:21,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-24 06:01:21,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:01:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-24 06:01:21,167 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:01:21,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 06:01:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-24 06:01:21,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [916525234] [2019-11-24 06:01:21,298 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2019-11-24 06:01:21,298 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 06:01:21,305 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 06:01:21,312 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 06:01:21,313 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 06:01:22,952 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 180 [2019-11-24 06:01:24,167 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 195 [2019-11-24 06:01:25,396 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 205 [2019-11-24 06:01:26,082 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 06:01:28,285 WARN L192 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 200 DAG size of output: 149 [2019-11-24 06:01:30,364 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 175 DAG size of output: 142 [2019-11-24 06:01:30,578 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-24 06:01:30,797 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-24 06:01:31,014 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-11-24 06:01:31,291 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-11-24 06:01:33,265 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 196 DAG size of output: 141 [2019-11-24 06:01:35,233 WARN L192 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 197 DAG size of output: 142 [2019-11-24 06:01:37,665 WARN L192 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 178 DAG size of output: 133 [2019-11-24 06:01:38,779 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 88 [2019-11-24 06:01:39,405 WARN L192 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 91 [2019-11-24 06:01:42,136 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 190 DAG size of output: 126 [2019-11-24 06:01:42,972 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 90 [2019-11-24 06:01:43,529 WARN L192 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 93 [2019-11-24 06:01:45,701 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 183 DAG size of output: 118 [2019-11-24 06:01:46,642 WARN L192 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 94 [2019-11-24 06:01:47,454 WARN L192 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 101 [2019-11-24 06:01:49,805 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 188 DAG size of output: 114 [2019-11-24 06:01:50,832 WARN L192 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 101 [2019-11-24 06:01:51,626 WARN L192 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 102 [2019-11-24 06:01:52,121 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 99 [2019-11-24 06:01:54,478 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 192 DAG size of output: 111 [2019-11-24 06:01:55,644 WARN L192 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 102 [2019-11-24 06:01:56,911 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 193 DAG size of output: 103 [2019-11-24 06:01:56,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 06:01:56,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [5, 4, 3] total 32 [2019-11-24 06:01:56,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777715960] [2019-11-24 06:01:56,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-24 06:01:56,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:01:56,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-24 06:01:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2019-11-24 06:01:56,917 INFO L87 Difference]: Start difference. First operand 226 states and 339 transitions. Second operand 26 states. [2019-11-24 06:01:59,194 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 160 DAG size of output: 138 [2019-11-24 06:02:01,591 WARN L192 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 104 [2019-11-24 06:02:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:02,239 INFO L93 Difference]: Finished difference Result 570 states and 856 transitions. [2019-11-24 06:02:02,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-24 06:02:02,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2019-11-24 06:02:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:02,243 INFO L225 Difference]: With dead ends: 570 [2019-11-24 06:02:02,243 INFO L226 Difference]: Without dead ends: 344 [2019-11-24 06:02:02,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 194 SyntacticMatches, 33 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 32.6s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2019-11-24 06:02:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-11-24 06:02:02,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 339. [2019-11-24 06:02:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-11-24 06:02:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 462 transitions. [2019-11-24 06:02:02,262 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 462 transitions. Word has length 85 [2019-11-24 06:02:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:02,263 INFO L462 AbstractCegarLoop]: Abstraction has 339 states and 462 transitions. [2019-11-24 06:02:02,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-24 06:02:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 462 transitions. [2019-11-24 06:02:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-24 06:02:02,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:02,264 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-24 06:02:02,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:02:02,472 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:02,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:02,473 INFO L82 PathProgramCache]: Analyzing trace with hash 117726847, now seen corresponding path program 1 times [2019-11-24 06:02:02,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:02,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825600294] [2019-11-24 06:02:02,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:02:02,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825600294] [2019-11-24 06:02:02,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388036258] [2019-11-24 06:02:02,548 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-24 06:02:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:02,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-24 06:02:02,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:02:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:02:02,630 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:02:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-24 06:02:02,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2035132970] [2019-11-24 06:02:02,693 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2019-11-24 06:02:02,694 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 06:02:02,694 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 06:02:02,695 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 06:02:02,695 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 06:02:05,252 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 201 [2019-11-24 06:02:05,357 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 201 [2019-11-24 06:02:05,462 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2019-11-24 06:02:05,569 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 201 [2019-11-24 06:02:06,338 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 06:02:08,362 WARN L192 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 200 DAG size of output: 150 [2019-11-24 06:02:10,241 WARN L192 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 175 DAG size of output: 145 [2019-11-24 06:02:10,434 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-24 06:02:10,647 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-24 06:02:10,864 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-11-24 06:02:11,143 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-11-24 06:02:13,097 WARN L192 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 195 DAG size of output: 143 [2019-11-24 06:02:15,067 WARN L192 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 196 DAG size of output: 144 [2019-11-24 06:02:17,501 WARN L192 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 178 DAG size of output: 136 [2019-11-24 06:02:18,622 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 85 [2019-11-24 06:02:19,285 WARN L192 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 91 [2019-11-24 06:02:22,034 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 190 DAG size of output: 129 [2019-11-24 06:02:22,839 WARN L192 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 87 [2019-11-24 06:02:23,380 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 93 [2019-11-24 06:02:25,369 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 185 DAG size of output: 127 [2019-11-24 06:02:26,239 WARN L192 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 93 [2019-11-24 06:02:26,988 WARN L192 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 103 [2019-11-24 06:02:27,725 WARN L192 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 102 [2019-11-24 06:02:29,911 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 190 DAG size of output: 123 [2019-11-24 06:02:30,857 WARN L192 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 99 [2019-11-24 06:02:31,621 WARN L192 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 103 [2019-11-24 06:02:32,129 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 98 [2019-11-24 06:02:35,212 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 197 DAG size of output: 117 [2019-11-24 06:02:36,339 WARN L192 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 101 [2019-11-24 06:02:37,240 WARN L192 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 102 [2019-11-24 06:02:37,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 06:02:37,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [6, 6, 3] total 33 [2019-11-24 06:02:37,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514569545] [2019-11-24 06:02:37,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-24 06:02:37,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:37,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-24 06:02:37,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2019-11-24 06:02:37,245 INFO L87 Difference]: Start difference. First operand 339 states and 462 transitions. Second operand 27 states. [2019-11-24 06:02:40,573 WARN L192 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 102 [2019-11-24 06:02:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:41,304 INFO L93 Difference]: Finished difference Result 802 states and 1085 transitions. [2019-11-24 06:02:41,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-24 06:02:41,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 86 [2019-11-24 06:02:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:41,308 INFO L225 Difference]: With dead ends: 802 [2019-11-24 06:02:41,308 INFO L226 Difference]: Without dead ends: 470 [2019-11-24 06:02:41,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 193 SyntacticMatches, 37 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2019-11-24 06:02:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-11-24 06:02:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 389. [2019-11-24 06:02:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-24 06:02:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 517 transitions. [2019-11-24 06:02:41,334 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 517 transitions. Word has length 86 [2019-11-24 06:02:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:41,334 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 517 transitions. [2019-11-24 06:02:41,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-24 06:02:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 517 transitions. [2019-11-24 06:02:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-24 06:02:41,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:41,336 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-11-24 06:02:41,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:02:41,542 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash 962102983, now seen corresponding path program 1 times [2019-11-24 06:02:41,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:41,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318515066] [2019-11-24 06:02:41,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:41,599 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-24 06:02:41,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318515066] [2019-11-24 06:02:41,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:41,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:02:41,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156130694] [2019-11-24 06:02:41,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:41,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:41,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:41,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:41,601 INFO L87 Difference]: Start difference. First operand 389 states and 517 transitions. Second operand 3 states. [2019-11-24 06:02:41,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:41,636 INFO L93 Difference]: Finished difference Result 954 states and 1304 transitions. [2019-11-24 06:02:41,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:41,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-24 06:02:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:41,642 INFO L225 Difference]: With dead ends: 954 [2019-11-24 06:02:41,642 INFO L226 Difference]: Without dead ends: 620 [2019-11-24 06:02:41,643 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-24 06:02:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-11-24 06:02:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 618. [2019-11-24 06:02:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-11-24 06:02:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 837 transitions. [2019-11-24 06:02:41,676 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 837 transitions. Word has length 88 [2019-11-24 06:02:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:41,677 INFO L462 AbstractCegarLoop]: Abstraction has 618 states and 837 transitions. [2019-11-24 06:02:41,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 837 transitions. [2019-11-24 06:02:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-24 06:02:41,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:41,679 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-11-24 06:02:41,679 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:41,679 INFO L82 PathProgramCache]: Analyzing trace with hash 382958829, now seen corresponding path program 1 times [2019-11-24 06:02:41,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:41,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606266362] [2019-11-24 06:02:41,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-24 06:02:41,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606266362] [2019-11-24 06:02:41,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:02:41,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:02:41,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650497011] [2019-11-24 06:02:41,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:02:41,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:02:41,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:02:41,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:02:41,714 INFO L87 Difference]: Start difference. First operand 618 states and 837 transitions. Second operand 3 states. [2019-11-24 06:02:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:02:41,742 INFO L93 Difference]: Finished difference Result 851 states and 1178 transitions. [2019-11-24 06:02:41,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:02:41,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-24 06:02:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:02:41,745 INFO L225 Difference]: With dead ends: 851 [2019-11-24 06:02:41,745 INFO L226 Difference]: Without dead ends: 587 [2019-11-24 06:02:41,746 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-24 06:02:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-11-24 06:02:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 583. [2019-11-24 06:02:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-11-24 06:02:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 794 transitions. [2019-11-24 06:02:41,776 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 794 transitions. Word has length 92 [2019-11-24 06:02:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:02:41,776 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 794 transitions. [2019-11-24 06:02:41,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:02:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 794 transitions. [2019-11-24 06:02:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-24 06:02:41,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:02:41,778 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-11-24 06:02:41,778 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:02:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:02:41,779 INFO L82 PathProgramCache]: Analyzing trace with hash 600804473, now seen corresponding path program 2 times [2019-11-24 06:02:41,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:02:41,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090726561] [2019-11-24 06:02:41,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:02:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:02:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-24 06:02:41,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090726561] [2019-11-24 06:02:41,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872582851] [2019-11-24 06:02:41,840 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-24 06:02:41,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-24 06:02:41,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-24 06:02:41,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-24 06:02:41,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:02:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-24 06:02:41,930 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:02:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-24 06:02:41,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [25966202] [2019-11-24 06:02:41,993 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2019-11-24 06:02:41,993 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 06:02:41,994 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 06:02:41,994 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 06:02:41,994 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 06:02:43,212 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 188 [2019-11-24 06:02:44,389 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 195 [2019-11-24 06:02:44,500 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 194 [2019-11-24 06:02:44,654 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 179 [2019-11-24 06:02:44,773 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 179 [2019-11-24 06:02:44,884 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2019-11-24 06:02:45,413 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 212