/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_srvr_14.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:03:03,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:03:03,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:03:03,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:03:03,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:03:03,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:03:03,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:03:03,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:03:03,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:03:03,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:03:03,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:03:03,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:03:03,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:03:03,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:03:03,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:03:03,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:03:03,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:03:03,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:03:03,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:03:03,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:03:03,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:03:03,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:03:03,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:03:03,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:03:03,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:03:03,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:03:03,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:03:03,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:03:03,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:03:03,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:03:03,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:03:03,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:03:03,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:03:03,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:03:03,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:03:03,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:03:03,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:03:03,264 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:03:03,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:03:03,265 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:03:03,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:03:03,267 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:03:03,299 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:03:03,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:03:03,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:03:03,304 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:03:03,304 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:03:03,304 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:03:03,304 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:03:03,305 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:03:03,305 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:03:03,305 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:03:03,305 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:03:03,305 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:03:03,306 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:03:03,307 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:03:03,307 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:03:03,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:03:03,309 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:03:03,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:03:03,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:03:03,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:03:03,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:03:03,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:03:03,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:03:03,310 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:03:03,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:03:03,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:03:03,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:03:03,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:03:03,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:03:03,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:03:03,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:03:03,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:03:03,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:03:03,312 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:03:03,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:03:03,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:03:03,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:03:03,313 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:03:03,577 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:03:03,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:03:03,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:03:03,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:03:03,601 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:03:03,602 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-11-24 06:03:03,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493aa9ed8/7c73a9266d774b2d9be2f1333c90affa/FLAG0483b929b [2019-11-24 06:03:04,178 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:03:04,178 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_14.cil.c [2019-11-24 06:03:04,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493aa9ed8/7c73a9266d774b2d9be2f1333c90affa/FLAG0483b929b [2019-11-24 06:03:04,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493aa9ed8/7c73a9266d774b2d9be2f1333c90affa [2019-11-24 06:03:04,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:03:04,501 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:03:04,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:03:04,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:03:04,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:03:04,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:03:04" (1/1) ... [2019-11-24 06:03:04,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc13865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:04, skipping insertion in model container [2019-11-24 06:03:04,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:03:04" (1/1) ... [2019-11-24 06:03:04,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:03:04,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:03:05,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:03:05,116 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:03:05,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:03:05,183 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:03:05,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05 WrapperNode [2019-11-24 06:03:05,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:03:05,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:03:05,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:03:05,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:03:05,193 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:03:05" (1/1) ... [2019-11-24 06:03:05,203 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:03:05" (1/1) ... [2019-11-24 06:03:05,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:03:05,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:03:05,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:03:05,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:03:05,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05" (1/1) ... [2019-11-24 06:03:05,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05" (1/1) ... [2019-11-24 06:03:05,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05" (1/1) ... [2019-11-24 06:03:05,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05" (1/1) ... [2019-11-24 06:03:05,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05" (1/1) ... [2019-11-24 06:03:05,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05" (1/1) ... [2019-11-24 06:03:05,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05" (1/1) ... [2019-11-24 06:03:05,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:03:05,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:03:05,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:03:05,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:03:05,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05" (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:03:05,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:03:05,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:03:05,489 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 06:03:06,201 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-24 06:03:06,201 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-24 06:03:06,525 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:03:06,525 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-24 06:03:06,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:03:06 BoogieIcfgContainer [2019-11-24 06:03:06,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:03:06,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:03:06,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:03:06,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:03:06,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:03:04" (1/3) ... [2019-11-24 06:03:06,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecbb0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:03:06, skipping insertion in model container [2019-11-24 06:03:06,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:03:05" (2/3) ... [2019-11-24 06:03:06,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecbb0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:03:06, skipping insertion in model container [2019-11-24 06:03:06,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:03:06" (3/3) ... [2019-11-24 06:03:06,534 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-11-24 06:03:06,544 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:03:06,553 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 06:03:06,568 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 06:03:06,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:03:06,598 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:03:06,598 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:03:06,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:03:06,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:03:06,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:03:06,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:03:06,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:03:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states. [2019-11-24 06:03:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 06:03:06,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:06,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:06,631 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash 794022040, now seen corresponding path program 1 times [2019-11-24 06:03:06,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:06,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789835777] [2019-11-24 06:03:06,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:06,853 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:03:06,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789835777] [2019-11-24 06:03:06,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:06,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:03:06,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271070255] [2019-11-24 06:03:06,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:06,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:06,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:06,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:06,879 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 3 states. [2019-11-24 06:03:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:07,106 INFO L93 Difference]: Finished difference Result 249 states and 434 transitions. [2019-11-24 06:03:07,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:07,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 06:03:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:07,122 INFO L225 Difference]: With dead ends: 249 [2019-11-24 06:03:07,122 INFO L226 Difference]: Without dead ends: 133 [2019-11-24 06:03:07,126 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:03:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-24 06:03:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-11-24 06:03:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-24 06:03:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 193 transitions. [2019-11-24 06:03:07,175 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 193 transitions. Word has length 16 [2019-11-24 06:03:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:07,176 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 193 transitions. [2019-11-24 06:03:07,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 193 transitions. [2019-11-24 06:03:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 06:03:07,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:07,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:07,178 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash -781796348, now seen corresponding path program 1 times [2019-11-24 06:03:07,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:07,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445016531] [2019-11-24 06:03:07,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:07,289 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:03:07,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445016531] [2019-11-24 06:03:07,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:07,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:03:07,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424961927] [2019-11-24 06:03:07,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:03:07,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:07,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:03:07,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:03:07,295 INFO L87 Difference]: Start difference. First operand 129 states and 193 transitions. Second operand 4 states. [2019-11-24 06:03:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:07,528 INFO L93 Difference]: Finished difference Result 148 states and 217 transitions. [2019-11-24 06:03:07,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:03:07,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-24 06:03:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:07,531 INFO L225 Difference]: With dead ends: 148 [2019-11-24 06:03:07,533 INFO L226 Difference]: Without dead ends: 146 [2019-11-24 06:03:07,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:03:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-24 06:03:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2019-11-24 06:03:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-24 06:03:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 206 transitions. [2019-11-24 06:03:07,557 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 206 transitions. Word has length 21 [2019-11-24 06:03:07,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:07,558 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 206 transitions. [2019-11-24 06:03:07,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:03:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 206 transitions. [2019-11-24 06:03:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 06:03:07,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:07,560 INFO L410 BasicCegarLoop]: trace histogram [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:03:07,561 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:07,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:07,562 INFO L82 PathProgramCache]: Analyzing trace with hash 882232578, now seen corresponding path program 1 times [2019-11-24 06:03:07,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:07,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873321203] [2019-11-24 06:03:07,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:07,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:07,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873321203] [2019-11-24 06:03:07,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:07,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:03:07,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235590114] [2019-11-24 06:03:07,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:07,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:07,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:07,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:07,655 INFO L87 Difference]: Start difference. First operand 137 states and 206 transitions. Second operand 3 states. [2019-11-24 06:03:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:07,671 INFO L93 Difference]: Finished difference Result 272 states and 410 transitions. [2019-11-24 06:03:07,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:07,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-24 06:03:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:07,674 INFO L225 Difference]: With dead ends: 272 [2019-11-24 06:03:07,674 INFO L226 Difference]: Without dead ends: 137 [2019-11-24 06:03:07,676 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:03:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-24 06:03:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-24 06:03:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-24 06:03:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2019-11-24 06:03:07,692 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 30 [2019-11-24 06:03:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:07,693 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2019-11-24 06:03:07,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2019-11-24 06:03:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 06:03:07,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:07,695 INFO L410 BasicCegarLoop]: trace histogram [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:03:07,695 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash 123428686, now seen corresponding path program 1 times [2019-11-24 06:03:07,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:07,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260082498] [2019-11-24 06:03:07,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:07,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260082498] [2019-11-24 06:03:07,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:07,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:03:07,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897285547] [2019-11-24 06:03:07,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:07,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:07,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:07,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:07,764 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand 3 states. [2019-11-24 06:03:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:07,798 INFO L93 Difference]: Finished difference Result 277 states and 410 transitions. [2019-11-24 06:03:07,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:07,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 06:03:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:07,801 INFO L225 Difference]: With dead ends: 277 [2019-11-24 06:03:07,801 INFO L226 Difference]: Without dead ends: 142 [2019-11-24 06:03:07,804 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:03:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-24 06:03:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-11-24 06:03:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-24 06:03:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 205 transitions. [2019-11-24 06:03:07,825 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 205 transitions. Word has length 31 [2019-11-24 06:03:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:07,826 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 205 transitions. [2019-11-24 06:03:07,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 205 transitions. [2019-11-24 06:03:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 06:03:07,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:07,829 INFO L410 BasicCegarLoop]: trace histogram [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:03:07,829 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash 363836999, now seen corresponding path program 1 times [2019-11-24 06:03:07,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:07,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776747563] [2019-11-24 06:03:07,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:07,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776747563] [2019-11-24 06:03:07,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:07,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:03:07,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775486072] [2019-11-24 06:03:07,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:07,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:07,908 INFO L87 Difference]: Start difference. First operand 141 states and 205 transitions. Second operand 3 states. [2019-11-24 06:03:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:07,931 INFO L93 Difference]: Finished difference Result 410 states and 595 transitions. [2019-11-24 06:03:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:07,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 06:03:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:07,934 INFO L225 Difference]: With dead ends: 410 [2019-11-24 06:03:07,934 INFO L226 Difference]: Without dead ends: 271 [2019-11-24 06:03:07,936 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:03:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-24 06:03:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 264. [2019-11-24 06:03:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-24 06:03:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 383 transitions. [2019-11-24 06:03:07,962 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 383 transitions. Word has length 34 [2019-11-24 06:03:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:07,963 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 383 transitions. [2019-11-24 06:03:07,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 383 transitions. [2019-11-24 06:03:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 06:03:07,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:07,972 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:07,973 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:07,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:07,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1801467981, now seen corresponding path program 1 times [2019-11-24 06:03:07,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:07,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559549682] [2019-11-24 06:03:07,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:08,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559549682] [2019-11-24 06:03:08,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:08,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:03:08,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248840262] [2019-11-24 06:03:08,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:08,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:08,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:08,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:08,030 INFO L87 Difference]: Start difference. First operand 264 states and 383 transitions. Second operand 3 states. [2019-11-24 06:03:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:08,230 INFO L93 Difference]: Finished difference Result 635 states and 948 transitions. [2019-11-24 06:03:08,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:08,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 06:03:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:08,233 INFO L225 Difference]: With dead ends: 635 [2019-11-24 06:03:08,233 INFO L226 Difference]: Without dead ends: 349 [2019-11-24 06:03:08,234 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:03:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-11-24 06:03:08,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 341. [2019-11-24 06:03:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-11-24 06:03:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 484 transitions. [2019-11-24 06:03:08,248 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 484 transitions. Word has length 35 [2019-11-24 06:03:08,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:08,249 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 484 transitions. [2019-11-24 06:03:08,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 484 transitions. [2019-11-24 06:03:08,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 06:03:08,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:08,250 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:03:08,250 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:08,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:08,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1455217368, now seen corresponding path program 1 times [2019-11-24 06:03:08,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:08,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101268203] [2019-11-24 06:03:08,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:08,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101268203] [2019-11-24 06:03:08,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:08,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:03:08,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16907376] [2019-11-24 06:03:08,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:03:08,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:08,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:03:08,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:03:08,280 INFO L87 Difference]: Start difference. First operand 341 states and 484 transitions. Second operand 3 states. [2019-11-24 06:03:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:08,304 INFO L93 Difference]: Finished difference Result 1015 states and 1441 transitions. [2019-11-24 06:03:08,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:03:08,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 06:03:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:08,308 INFO L225 Difference]: With dead ends: 1015 [2019-11-24 06:03:08,308 INFO L226 Difference]: Without dead ends: 676 [2019-11-24 06:03:08,309 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:03:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-11-24 06:03:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 507. [2019-11-24 06:03:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-11-24 06:03:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 720 transitions. [2019-11-24 06:03:08,330 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 720 transitions. Word has length 38 [2019-11-24 06:03:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:08,331 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 720 transitions. [2019-11-24 06:03:08,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:03:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 720 transitions. [2019-11-24 06:03:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 06:03:08,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:08,332 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:03:08,332 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1554107373, now seen corresponding path program 1 times [2019-11-24 06:03:08,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:08,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925374687] [2019-11-24 06:03:08,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:03:08,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925374687] [2019-11-24 06:03:08,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:08,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:03:08,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842366634] [2019-11-24 06:03:08,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:03:08,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:03:08,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:03:08,368 INFO L87 Difference]: Start difference. First operand 507 states and 720 transitions. Second operand 4 states. [2019-11-24 06:03:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:08,547 INFO L93 Difference]: Finished difference Result 546 states and 764 transitions. [2019-11-24 06:03:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:03:08,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-24 06:03:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:08,552 INFO L225 Difference]: With dead ends: 546 [2019-11-24 06:03:08,552 INFO L226 Difference]: Without dead ends: 544 [2019-11-24 06:03:08,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:03:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-24 06:03:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 509. [2019-11-24 06:03:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-11-24 06:03:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 722 transitions. [2019-11-24 06:03:08,576 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 722 transitions. Word has length 39 [2019-11-24 06:03:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:08,579 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 722 transitions. [2019-11-24 06:03:08,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:03:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 722 transitions. [2019-11-24 06:03:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 06:03:08,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:08,582 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, 1] [2019-11-24 06:03:08,583 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:08,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:08,583 INFO L82 PathProgramCache]: Analyzing trace with hash -162981457, now seen corresponding path program 1 times [2019-11-24 06:03:08,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:08,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574272162] [2019-11-24 06:03:08,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:08,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:03:08,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574272162] [2019-11-24 06:03:08,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:08,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:03:08,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815461908] [2019-11-24 06:03:08,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:03:08,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:08,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:03:08,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:03:08,650 INFO L87 Difference]: Start difference. First operand 509 states and 722 transitions. Second operand 4 states. [2019-11-24 06:03:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:08,838 INFO L93 Difference]: Finished difference Result 542 states and 760 transitions. [2019-11-24 06:03:08,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:03:08,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-24 06:03:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:08,842 INFO L225 Difference]: With dead ends: 542 [2019-11-24 06:03:08,842 INFO L226 Difference]: Without dead ends: 540 [2019-11-24 06:03:08,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:03:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-24 06:03:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 509. [2019-11-24 06:03:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-11-24 06:03:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 722 transitions. [2019-11-24 06:03:08,863 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 722 transitions. Word has length 39 [2019-11-24 06:03:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:08,863 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 722 transitions. [2019-11-24 06:03:08,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:03:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 722 transitions. [2019-11-24 06:03:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 06:03:08,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:08,865 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:03:08,865 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:08,865 INFO L82 PathProgramCache]: Analyzing trace with hash -468869695, now seen corresponding path program 1 times [2019-11-24 06:03:08,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:08,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046731816] [2019-11-24 06:03:08,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:03:08,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046731816] [2019-11-24 06:03:08,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:08,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:03:08,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666285249] [2019-11-24 06:03:08,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:03:08,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:08,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:03:08,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:03:08,912 INFO L87 Difference]: Start difference. First operand 509 states and 722 transitions. Second operand 4 states. [2019-11-24 06:03:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:09,073 INFO L93 Difference]: Finished difference Result 566 states and 787 transitions. [2019-11-24 06:03:09,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:03:09,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-24 06:03:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:09,081 INFO L225 Difference]: With dead ends: 566 [2019-11-24 06:03:09,081 INFO L226 Difference]: Without dead ends: 564 [2019-11-24 06:03:09,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:03:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-11-24 06:03:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 523. [2019-11-24 06:03:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-24 06:03:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 739 transitions. [2019-11-24 06:03:09,101 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 739 transitions. Word has length 40 [2019-11-24 06:03:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:09,101 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 739 transitions. [2019-11-24 06:03:09,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:03:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 739 transitions. [2019-11-24 06:03:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 06:03:09,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:09,102 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, 1, 1, 1] [2019-11-24 06:03:09,102 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:09,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:09,103 INFO L82 PathProgramCache]: Analyzing trace with hash 183684865, now seen corresponding path program 1 times [2019-11-24 06:03:09,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:09,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263481126] [2019-11-24 06:03:09,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:03:09,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263481126] [2019-11-24 06:03:09,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:09,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:03:09,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094120022] [2019-11-24 06:03:09,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:03:09,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:09,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:03:09,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:03:09,131 INFO L87 Difference]: Start difference. First operand 523 states and 739 transitions. Second operand 4 states. [2019-11-24 06:03:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:09,302 INFO L93 Difference]: Finished difference Result 560 states and 781 transitions. [2019-11-24 06:03:09,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:03:09,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-24 06:03:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:09,305 INFO L225 Difference]: With dead ends: 560 [2019-11-24 06:03:09,306 INFO L226 Difference]: Without dead ends: 558 [2019-11-24 06:03:09,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:03:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-11-24 06:03:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 521. [2019-11-24 06:03:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-11-24 06:03:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 737 transitions. [2019-11-24 06:03:09,326 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 737 transitions. Word has length 40 [2019-11-24 06:03:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:09,326 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 737 transitions. [2019-11-24 06:03:09,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:03:09,326 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 737 transitions. [2019-11-24 06:03:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:03:09,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:09,327 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:03:09,328 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:09,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1117797508, now seen corresponding path program 1 times [2019-11-24 06:03:09,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:09,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100284134] [2019-11-24 06:03:09,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:03:09,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100284134] [2019-11-24 06:03:09,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:03:09,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:03:09,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113327538] [2019-11-24 06:03:09,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:03:09,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:09,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:03:09,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:03:09,377 INFO L87 Difference]: Start difference. First operand 521 states and 737 transitions. Second operand 4 states. [2019-11-24 06:03:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:09,561 INFO L93 Difference]: Finished difference Result 571 states and 794 transitions. [2019-11-24 06:03:09,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 06:03:09,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-24 06:03:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:09,564 INFO L225 Difference]: With dead ends: 571 [2019-11-24 06:03:09,565 INFO L226 Difference]: Without dead ends: 569 [2019-11-24 06:03:09,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:03:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-11-24 06:03:09,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 514. [2019-11-24 06:03:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-11-24 06:03:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 729 transitions. [2019-11-24 06:03:09,585 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 729 transitions. Word has length 42 [2019-11-24 06:03:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:09,585 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 729 transitions. [2019-11-24 06:03:09,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:03:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 729 transitions. [2019-11-24 06:03:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:03:09,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:09,587 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:03:09,587 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:09,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:09,587 INFO L82 PathProgramCache]: Analyzing trace with hash -263069471, now seen corresponding path program 1 times [2019-11-24 06:03:09,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:09,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74697172] [2019-11-24 06:03:09,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:03:09,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74697172] [2019-11-24 06:03:09,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101352185] [2019-11-24 06:03:09,640 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:03:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:03:09,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 06:03:09,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:03:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:03:09,753 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:03:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 06:03:09,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:03:09,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 10 [2019-11-24 06:03:09,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269237671] [2019-11-24 06:03:09,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:03:09,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:03:09,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:03:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-24 06:03:09,808 INFO L87 Difference]: Start difference. First operand 514 states and 729 transitions. Second operand 6 states. [2019-11-24 06:03:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:03:10,083 INFO L93 Difference]: Finished difference Result 735 states and 998 transitions. [2019-11-24 06:03:10,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 06:03:10,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-24 06:03:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:03:10,088 INFO L225 Difference]: With dead ends: 735 [2019-11-24 06:03:10,088 INFO L226 Difference]: Without dead ends: 733 [2019-11-24 06:03:10,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-24 06:03:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-11-24 06:03:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 518. [2019-11-24 06:03:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-24 06:03:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 736 transitions. [2019-11-24 06:03:10,123 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 736 transitions. Word has length 42 [2019-11-24 06:03:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:03:10,123 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 736 transitions. [2019-11-24 06:03:10,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:03:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 736 transitions. [2019-11-24 06:03:10,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 06:03:10,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:03:10,125 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] [2019-11-24 06:03:10,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:03:10,330 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:03:10,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:03:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash 861285924, now seen corresponding path program 1 times [2019-11-24 06:03:10,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:03:10,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566615099] [2019-11-24 06:03:10,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:03:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:03:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-24 06:03:10,432 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-24 06:03:10,432 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-24 06:03:10,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:03:10 BoogieIcfgContainer [2019-11-24 06:03:10,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:03:10,508 INFO L168 Benchmark]: Toolchain (without parser) took 6005.96 ms. Allocated memory was 144.7 MB in the beginning and 282.1 MB in the end (delta: 137.4 MB). Free memory was 102.1 MB in the beginning and 106.3 MB in the end (delta: -4.1 MB). Peak memory consumption was 133.2 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:10,509 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-24 06:03:10,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 682.21 ms. Allocated memory was 144.7 MB in the beginning and 205.0 MB in the end (delta: 60.3 MB). Free memory was 101.9 MB in the beginning and 179.2 MB in the end (delta: -77.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:10,510 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.52 ms. Allocated memory is still 205.0 MB. Free memory was 179.2 MB in the beginning and 176.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:10,511 INFO L168 Benchmark]: Boogie Preprocessor took 44.14 ms. Allocated memory is still 205.0 MB. Free memory was 176.4 MB in the beginning and 174.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:10,511 INFO L168 Benchmark]: RCFGBuilder took 1234.52 ms. Allocated memory was 205.0 MB in the beginning and 237.0 MB in the end (delta: 32.0 MB). Free memory was 173.6 MB in the beginning and 201.0 MB in the end (delta: -27.4 MB). Peak memory consumption was 89.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:10,512 INFO L168 Benchmark]: TraceAbstraction took 3977.88 ms. Allocated memory was 237.0 MB in the beginning and 282.1 MB in the end (delta: 45.1 MB). Free memory was 199.6 MB in the beginning and 106.3 MB in the end (delta: 93.3 MB). Peak memory consumption was 138.4 MB. Max. memory is 7.1 GB. [2019-11-24 06:03:10,516 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 682.21 ms. Allocated memory was 144.7 MB in the beginning and 205.0 MB in the end (delta: 60.3 MB). Free memory was 101.9 MB in the beginning and 179.2 MB in the end (delta: -77.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.52 ms. Allocated memory is still 205.0 MB. Free memory was 179.2 MB in the beginning and 176.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.14 ms. Allocated memory is still 205.0 MB. Free memory was 176.4 MB in the beginning and 174.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1234.52 ms. Allocated memory was 205.0 MB in the beginning and 237.0 MB in the end (delta: 32.0 MB). Free memory was 173.6 MB in the beginning and 201.0 MB in the end (delta: -27.4 MB). Peak memory consumption was 89.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3977.88 ms. Allocated memory was 237.0 MB in the beginning and 282.1 MB in the end (delta: 45.1 MB). Free memory was 199.6 MB in the beginning and 106.3 MB in the end (delta: 93.3 MB). Peak memory consumption was 138.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 640]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L645] int s ; [L646] int tmp ; [L650] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__s3__tmp__reuse_message = 0 [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND FALSE !(s__info_callback != 0) [L84] COND FALSE !(s__ctx__info_callback != 0) [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND FALSE !(state == 8496) [L614] COND FALSE !(\read(s__debug)) [L620] COND FALSE !(cb != 0) [L629] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND TRUE state == 8496 [L640] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 112 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.9s, OverallIterations: 14, TraceHistogramMax: 2, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1981 SDtfs, 1754 SDslu, 1463 SDs, 0 SdLazy, 1417 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 612 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 516 ConstructedInterpolants, 0 QuantifiedInterpolants, 39106 SizeOfPredicates, 3 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 130/148 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...