/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/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:13,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:13,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:13,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:13,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:13,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:13,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:13,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:13,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:13,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:13,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:13,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:13,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:13,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:13,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:13,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:13,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:13,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:13,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:13,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:13,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:13,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:13,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:13,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:13,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:13,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:13,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:13,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:13,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:13,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:13,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:13,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:13,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:13,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:13,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:13,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:13,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:13,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:13,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:13,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:13,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:13,295 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:48:13,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:13,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:13,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:13,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:13,317 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:13,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:13,317 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:13,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:13,318 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:13,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:13,319 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:13,319 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:13,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:13,320 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:13,320 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:13,320 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:13,320 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:13,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:13,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:13,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:13,321 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:13,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:13,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:13,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:13,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:13,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:13,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:13,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:13,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:13,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:13,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:13,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:13,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:13,609 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:13,609 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:13,610 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-2.c [2019-11-23 22:48:13,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe48672b5/3ff9fe87619f44fe8c050385920b931d/FLAG6dcb8bad4 [2019-11-23 22:48:14,224 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:14,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-2.c [2019-11-23 22:48:14,242 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe48672b5/3ff9fe87619f44fe8c050385920b931d/FLAG6dcb8bad4 [2019-11-23 22:48:14,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe48672b5/3ff9fe87619f44fe8c050385920b931d [2019-11-23 22:48:14,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:14,511 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:14,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:14,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:14,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:14,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:14" (1/1) ... [2019-11-23 22:48:14,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39236083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:14, skipping insertion in model container [2019-11-23 22:48:14,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:14" (1/1) ... [2019-11-23 22:48:14,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:14,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:14,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:14,862 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:15,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:15,061 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:15,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15 WrapperNode [2019-11-23 22:48:15,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:15,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:15,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:15,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:15,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... [2019-11-23 22:48:15,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... [2019-11-23 22:48:15,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:15,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:15,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:15,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:15,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... [2019-11-23 22:48:15,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... [2019-11-23 22:48:15,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... [2019-11-23 22:48:15,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... [2019-11-23 22:48:15,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... [2019-11-23 22:48:15,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... [2019-11-23 22:48:15,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... [2019-11-23 22:48:15,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:15,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:15,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:15,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:15,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:15,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:15,392 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:48:16,054 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-23 22:48:16,055 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-23 22:48:16,057 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:16,057 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 22:48:16,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:16 BoogieIcfgContainer [2019-11-23 22:48:16,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:16,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:16,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:16,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:16,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:14" (1/3) ... [2019-11-23 22:48:16,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a44a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:16, skipping insertion in model container [2019-11-23 22:48:16,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:15" (2/3) ... [2019-11-23 22:48:16,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a44a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:16, skipping insertion in model container [2019-11-23 22:48:16,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:16" (3/3) ... [2019-11-23 22:48:16,071 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-2.c [2019-11-23 22:48:16,081 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:16,092 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:48:16,103 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:48:16,143 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:16,143 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:16,143 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:16,144 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:16,144 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:16,144 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:16,144 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:16,144 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-11-23 22:48:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-23 22:48:16,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:16,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:16,175 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:16,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:16,182 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-11-23 22:48:16,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:16,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635430650] [2019-11-23 22:48:16,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:16,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635430650] [2019-11-23 22:48:16,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:16,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:16,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149622478] [2019-11-23 22:48:16,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:16,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:16,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:16,463 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-11-23 22:48:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:16,850 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-11-23 22:48:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:16,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-23 22:48:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:16,868 INFO L225 Difference]: With dead ends: 327 [2019-11-23 22:48:16,868 INFO L226 Difference]: Without dead ends: 174 [2019-11-23 22:48:16,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-23 22:48:16,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-11-23 22:48:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-23 22:48:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-11-23 22:48:16,932 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-11-23 22:48:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:16,933 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-11-23 22:48:16,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-11-23 22:48:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:48:16,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:16,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:16,937 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:16,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:16,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-11-23 22:48:16,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:16,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084375598] [2019-11-23 22:48:16,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:17,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084375598] [2019-11-23 22:48:17,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:17,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:17,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316549020] [2019-11-23 22:48:17,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:17,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:17,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,061 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-11-23 22:48:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:17,283 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-11-23 22:48:17,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:17,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-23 22:48:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:17,288 INFO L225 Difference]: With dead ends: 379 [2019-11-23 22:48:17,288 INFO L226 Difference]: Without dead ends: 215 [2019-11-23 22:48:17,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-23 22:48:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-11-23 22:48:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-23 22:48:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-11-23 22:48:17,336 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-11-23 22:48:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:17,336 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-11-23 22:48:17,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-11-23 22:48:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 22:48:17,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:17,342 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:17,347 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:17,348 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-11-23 22:48:17,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:17,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847020886] [2019-11-23 22:48:17,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:17,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847020886] [2019-11-23 22:48:17,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:17,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:17,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258832248] [2019-11-23 22:48:17,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:17,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:17,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,491 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-11-23 22:48:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:17,688 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-11-23 22:48:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:17,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 22:48:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:17,691 INFO L225 Difference]: With dead ends: 444 [2019-11-23 22:48:17,691 INFO L226 Difference]: Without dead ends: 241 [2019-11-23 22:48:17,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-23 22:48:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-11-23 22:48:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-23 22:48:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-11-23 22:48:17,711 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-11-23 22:48:17,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:17,711 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-11-23 22:48:17,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:17,711 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-11-23 22:48:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:48:17,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:17,715 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:17,715 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:17,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-11-23 22:48:17,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:17,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975162178] [2019-11-23 22:48:17,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:17,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975162178] [2019-11-23 22:48:17,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:17,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:17,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848701274] [2019-11-23 22:48:17,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:17,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:17,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:17,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,801 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-11-23 22:48:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:17,926 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-11-23 22:48:17,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:17,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:48:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:17,930 INFO L225 Difference]: With dead ends: 492 [2019-11-23 22:48:17,930 INFO L226 Difference]: Without dead ends: 258 [2019-11-23 22:48:17,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-23 22:48:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-11-23 22:48:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-23 22:48:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-11-23 22:48:17,961 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-11-23 22:48:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:17,961 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-11-23 22:48:17,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-11-23 22:48:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:48:17,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:17,968 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:17,968 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-11-23 22:48:17,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:17,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472888981] [2019-11-23 22:48:17,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:18,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472888981] [2019-11-23 22:48:18,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917733176] [2019-11-23 22:48:18,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,057 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-11-23 22:48:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:18,235 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-11-23 22:48:18,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:18,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 22:48:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:18,243 INFO L225 Difference]: With dead ends: 551 [2019-11-23 22:48:18,243 INFO L226 Difference]: Without dead ends: 302 [2019-11-23 22:48:18,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-23 22:48:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-23 22:48:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:48:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-11-23 22:48:18,260 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-11-23 22:48:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,261 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-11-23 22:48:18,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-11-23 22:48:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:48:18,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,264 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,264 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,264 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-11-23 22:48:18,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151582025] [2019-11-23 22:48:18,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:18,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151582025] [2019-11-23 22:48:18,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072960483] [2019-11-23 22:48:18,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,353 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-11-23 22:48:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:18,474 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-11-23 22:48:18,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:18,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:48:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:18,477 INFO L225 Difference]: With dead ends: 591 [2019-11-23 22:48:18,478 INFO L226 Difference]: Without dead ends: 300 [2019-11-23 22:48:18,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-23 22:48:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-23 22:48:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-23 22:48:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-11-23 22:48:18,492 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-11-23 22:48:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,492 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-11-23 22:48:18,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,493 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-11-23 22:48:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:48:18,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,494 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,494 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-11-23 22:48:18,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713546577] [2019-11-23 22:48:18,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:18,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713546577] [2019-11-23 22:48:18,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796023405] [2019-11-23 22:48:18,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,583 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-11-23 22:48:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:18,751 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-11-23 22:48:18,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:18,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-23 22:48:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:18,753 INFO L225 Difference]: With dead ends: 593 [2019-11-23 22:48:18,754 INFO L226 Difference]: Without dead ends: 300 [2019-11-23 22:48:18,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-23 22:48:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-11-23 22:48:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-23 22:48:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-11-23 22:48:18,767 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-11-23 22:48:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,767 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-11-23 22:48:18,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-11-23 22:48:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 22:48:18,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,769 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:18,770 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-11-23 22:48:18,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140726645] [2019-11-23 22:48:18,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-23 22:48:18,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140726645] [2019-11-23 22:48:18,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:18,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:18,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783701218] [2019-11-23 22:48:18,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:18,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:18,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,825 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-11-23 22:48:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:18,964 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-11-23 22:48:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:18,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-23 22:48:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:18,967 INFO L225 Difference]: With dead ends: 594 [2019-11-23 22:48:18,967 INFO L226 Difference]: Without dead ends: 305 [2019-11-23 22:48:18,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-23 22:48:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-11-23 22:48:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-23 22:48:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-11-23 22:48:18,982 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-11-23 22:48:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:18,983 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-11-23 22:48:18,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-11-23 22:48:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 22:48:18,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:18,986 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:18,987 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:18,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-11-23 22:48:18,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:18,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642319033] [2019-11-23 22:48:18,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:19,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642319033] [2019-11-23 22:48:19,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396919892] [2019-11-23 22:48:19,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,049 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-11-23 22:48:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,245 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-11-23 22:48:19,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 22:48:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,250 INFO L225 Difference]: With dead ends: 634 [2019-11-23 22:48:19,251 INFO L226 Difference]: Without dead ends: 336 [2019-11-23 22:48:19,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-23 22:48:19,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-23 22:48:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-23 22:48:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-11-23 22:48:19,269 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-11-23 22:48:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,269 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-11-23 22:48:19,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-11-23 22:48:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 22:48:19,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,271 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 22:48:19,272 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-11-23 22:48:19,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001474759] [2019-11-23 22:48:19,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:19,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001474759] [2019-11-23 22:48:19,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495769826] [2019-11-23 22:48:19,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,357 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-11-23 22:48:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,522 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-11-23 22:48:19,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-23 22:48:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,524 INFO L225 Difference]: With dead ends: 663 [2019-11-23 22:48:19,524 INFO L226 Difference]: Without dead ends: 336 [2019-11-23 22:48:19,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-23 22:48:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-11-23 22:48:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-23 22:48:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-11-23 22:48:19,544 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-11-23 22:48:19,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,546 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-11-23 22:48:19,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-11-23 22:48:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-23 22:48:19,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,549 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,549 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-11-23 22:48:19,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205378227] [2019-11-23 22:48:19,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:19,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205378227] [2019-11-23 22:48:19,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096656549] [2019-11-23 22:48:19,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,603 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-11-23 22:48:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,754 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-11-23 22:48:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-23 22:48:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,757 INFO L225 Difference]: With dead ends: 696 [2019-11-23 22:48:19,757 INFO L226 Difference]: Without dead ends: 369 [2019-11-23 22:48:19,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-23 22:48:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-23 22:48:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-23 22:48:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-11-23 22:48:19,771 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-11-23 22:48:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,771 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-11-23 22:48:19,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-11-23 22:48:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-23 22:48:19,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,773 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,774 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-11-23 22:48:19,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420854827] [2019-11-23 22:48:19,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-23 22:48:19,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420854827] [2019-11-23 22:48:19,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:19,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:19,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610605729] [2019-11-23 22:48:19,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:19,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:19,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,812 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-11-23 22:48:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:19,962 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-11-23 22:48:19,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:19,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-23 22:48:19,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:19,965 INFO L225 Difference]: With dead ends: 723 [2019-11-23 22:48:19,965 INFO L226 Difference]: Without dead ends: 369 [2019-11-23 22:48:19,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-23 22:48:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-11-23 22:48:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-23 22:48:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-11-23 22:48:19,981 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-11-23 22:48:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:19,981 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-11-23 22:48:19,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-11-23 22:48:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 22:48:19,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:19,983 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:19,983 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:19,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:19,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-11-23 22:48:19,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:19,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823856037] [2019-11-23 22:48:19,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:48:20,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823856037] [2019-11-23 22:48:20,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:20,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:20,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739399668] [2019-11-23 22:48:20,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:20,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:20,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:20,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,026 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-11-23 22:48:20,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,184 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-11-23 22:48:20,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-23 22:48:20,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,187 INFO L225 Difference]: With dead ends: 741 [2019-11-23 22:48:20,187 INFO L226 Difference]: Without dead ends: 387 [2019-11-23 22:48:20,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-23 22:48:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-23 22:48:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-23 22:48:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-11-23 22:48:20,203 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-11-23 22:48:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,203 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-11-23 22:48:20,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-11-23 22:48:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:48:20,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,205 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:20,205 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-11-23 22:48:20,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526915711] [2019-11-23 22:48:20,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-23 22:48:20,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526915711] [2019-11-23 22:48:20,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:20,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 22:48:20,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738273567] [2019-11-23 22:48:20,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:20,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:20,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:20,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,246 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-11-23 22:48:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:20,376 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-11-23 22:48:20,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:20,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 22:48:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:20,378 INFO L225 Difference]: With dead ends: 762 [2019-11-23 22:48:20,378 INFO L226 Difference]: Without dead ends: 387 [2019-11-23 22:48:20,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-11-23 22:48:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-11-23 22:48:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-23 22:48:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-11-23 22:48:20,392 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-11-23 22:48:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:20,392 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-11-23 22:48:20,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-11-23 22:48:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-23 22:48:20,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:20,394 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:20,394 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:20,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-11-23 22:48:20,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:20,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111643584] [2019-11-23 22:48:20,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:48:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-23 22:48:20,489 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-23 22:48:20,489 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-23 22:48:20,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:48:20 BoogieIcfgContainer [2019-11-23 22:48:20,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:48:20,591 INFO L168 Benchmark]: Toolchain (without parser) took 6078.97 ms. Allocated memory was 138.9 MB in the beginning and 298.8 MB in the end (delta: 159.9 MB). Free memory was 100.9 MB in the beginning and 170.6 MB in the end (delta: -69.7 MB). Peak memory consumption was 90.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:20,593 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 138.9 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 22:48:20,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.58 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 100.7 MB in the beginning and 176.5 MB in the end (delta: -75.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:20,597 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.34 ms. Allocated memory is still 200.8 MB. Free memory was 175.8 MB in the beginning and 172.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:20,602 INFO L168 Benchmark]: Boogie Preprocessor took 58.69 ms. Allocated memory is still 200.8 MB. Free memory was 172.9 MB in the beginning and 170.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:20,605 INFO L168 Benchmark]: RCFGBuilder took 860.79 ms. Allocated memory is still 200.8 MB. Free memory was 170.4 MB in the beginning and 118.5 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:20,607 INFO L168 Benchmark]: TraceAbstraction took 4525.71 ms. Allocated memory was 200.8 MB in the beginning and 298.8 MB in the end (delta: 98.0 MB). Free memory was 117.8 MB in the beginning and 170.6 MB in the end (delta: -52.8 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:48:20,614 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.47 ms. Allocated memory is still 138.9 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 550.58 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 100.7 MB in the beginning and 176.5 MB in the end (delta: -75.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.34 ms. Allocated memory is still 200.8 MB. Free memory was 175.8 MB in the beginning and 172.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.69 ms. Allocated memory is still 200.8 MB. Free memory was 172.9 MB in the beginning and 170.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 860.79 ms. Allocated memory is still 200.8 MB. Free memory was 170.4 MB in the beginning and 118.5 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4525.71 ms. Allocated memory was 200.8 MB in the beginning and 298.8 MB in the end (delta: 98.0 MB). Free memory was 117.8 MB in the beginning and 170.6 MB in the end (delta: -52.8 MB). Peak memory consumption was 45.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 607]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L612] int s ; [L613] int tmp ; [L617] 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 = __VERIFIER_nondet_int() ; [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 ; [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 TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND FALSE !(tmp___1 + 12288) [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 [L579] COND FALSE !(! s__s3__tmp__reuse_message) [L596] 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 [L293] COND FALSE !(ret <= 0) [L296] COND TRUE \read(s__hit) [L297] s__state = 8656 [L301] s__init_num = 0 [L579] COND FALSE !(! s__s3__tmp__reuse_message) [L596] 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 FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND TRUE s__state == 8656 [L490] s__session__cipher = s__s3__tmp__new_cipher [L491] COND FALSE !(! tmp___9) [L495] ret = __VERIFIER_nondet_int() [L496] COND TRUE blastFlag == 2 [L497] blastFlag = 3 [L499] COND FALSE !(ret <= 0) [L502] s__state = 8672 [L503] s__init_num = 0 [L504] COND FALSE !(! tmp___10) [L579] COND FALSE !(! s__s3__tmp__reuse_message) [L596] 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 FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND FALSE !(s__state == 8656) [L194] COND FALSE !(s__state == 8657) [L197] COND TRUE s__state == 8672 [L511] ret = __VERIFIER_nondet_int() [L512] COND TRUE blastFlag == 3 [L607] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.4s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1821 SDtfs, 2038 SDslu, 234 SDs, 0 SdLazy, 1321 SolverSat, 599 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=13, 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, 14 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 188237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 636/636 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...