./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4ba7a359047c30b647e3fae146392c1b2eaa08f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:40:10,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:10,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:10,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:10,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:10,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:10,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:10,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:10,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:10,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:10,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:10,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:10,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:10,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:10,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:10,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:10,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:10,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:10,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:10,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:10,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:10,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:10,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:10,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:10,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:10,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:10,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:10,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:10,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:10,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:10,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:10,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:10,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:10,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:10,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:10,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:10,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:10,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:10,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:10,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:10,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:10,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:40:10,263 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:10,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:10,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:10,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:10,269 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:10,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:10,272 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:10,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:10,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:10,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:10,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:10,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:10,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:10,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:10,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:10,275 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:10,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:10,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:10,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:10,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:10,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:10,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:10,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:10,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:10,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:10,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:10,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:10,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:10,279 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:10,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4ba7a359047c30b647e3fae146392c1b2eaa08f [2019-11-28 15:40:10,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:10,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:10,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:10,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:10,634 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:10,635 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-11-28 15:40:10,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ea3b065/2aa957593f034bf796ef08975217a5b1/FLAG766c322d3 [2019-11-28 15:40:11,157 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:11,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-11-28 15:40:11,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ea3b065/2aa957593f034bf796ef08975217a5b1/FLAG766c322d3 [2019-11-28 15:40:11,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ea3b065/2aa957593f034bf796ef08975217a5b1 [2019-11-28 15:40:11,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:11,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:11,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:11,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:11,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:11,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:11" (1/1) ... [2019-11-28 15:40:11,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381b270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:11, skipping insertion in model container [2019-11-28 15:40:11,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:11" (1/1) ... [2019-11-28 15:40:11,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:11,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:12,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:12,030 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:12,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:12,100 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:12,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12 WrapperNode [2019-11-28 15:40:12,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:12,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:12,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:12,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:12,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (1/1) ... [2019-11-28 15:40:12,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (1/1) ... [2019-11-28 15:40:12,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:12,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:12,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:12,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:12,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (1/1) ... [2019-11-28 15:40:12,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (1/1) ... [2019-11-28 15:40:12,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (1/1) ... [2019-11-28 15:40:12,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (1/1) ... [2019-11-28 15:40:12,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (1/1) ... [2019-11-28 15:40:12,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (1/1) ... [2019-11-28 15:40:12,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (1/1) ... [2019-11-28 15:40:12,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:12,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:12,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:12,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:12,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (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-28 15:40:12,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:12,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:12,434 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:40:13,112 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 15:40:13,113 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 15:40:13,114 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:13,114 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:40:13,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:13 BoogieIcfgContainer [2019-11-28 15:40:13,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:13,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:13,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:13,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:13,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:11" (1/3) ... [2019-11-28 15:40:13,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b165801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:13, skipping insertion in model container [2019-11-28 15:40:13,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (2/3) ... [2019-11-28 15:40:13,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b165801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:13, skipping insertion in model container [2019-11-28 15:40:13,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:13" (3/3) ... [2019-11-28 15:40:13,124 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2019-11-28 15:40:13,134 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:13,142 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:13,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:13,181 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:13,181 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:13,182 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:13,182 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:13,182 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:13,182 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:13,182 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:13,183 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-28 15:40:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:13,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,211 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] [2019-11-28 15:40:13,211 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1440243157, now seen corresponding path program 1 times [2019-11-28 15:40:13,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735128269] [2019-11-28 15:40:13,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,494 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-28 15:40:13,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735128269] [2019-11-28 15:40:13,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:13,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928926658] [2019-11-28 15:40:13,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,529 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-28 15:40:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,859 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2019-11-28 15:40:13,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,883 INFO L225 Difference]: With dead ends: 324 [2019-11-28 15:40:13,883 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 15:40:13,890 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-28 15:40:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 15:40:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-11-28 15:40:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-28 15:40:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-11-28 15:40:13,942 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 25 [2019-11-28 15:40:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,943 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-11-28 15:40:13,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-11-28 15:40:13,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:13,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,945 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] [2019-11-28 15:40:13,946 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1818183234, now seen corresponding path program 1 times [2019-11-28 15:40:13,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409287723] [2019-11-28 15:40:13,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,003 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-28 15:40:14,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409287723] [2019-11-28 15:40:14,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089357363] [2019-11-28 15:40:14,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,009 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 3 states. [2019-11-28 15:40:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,220 INFO L93 Difference]: Finished difference Result 329 states and 518 transitions. [2019-11-28 15:40:14,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:14,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,223 INFO L225 Difference]: With dead ends: 329 [2019-11-28 15:40:14,223 INFO L226 Difference]: Without dead ends: 179 [2019-11-28 15:40:14,224 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-28 15:40:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-28 15:40:14,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-11-28 15:40:14,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-28 15:40:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2019-11-28 15:40:14,241 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 26 [2019-11-28 15:40:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,242 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2019-11-28 15:40:14,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-11-28 15:40:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:14,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,244 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] [2019-11-28 15:40:14,244 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1920661961, now seen corresponding path program 1 times [2019-11-28 15:40:14,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961341988] [2019-11-28 15:40:14,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,296 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-28 15:40:14,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961341988] [2019-11-28 15:40:14,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703543253] [2019-11-28 15:40:14,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,299 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 3 states. [2019-11-28 15:40:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,480 INFO L93 Difference]: Finished difference Result 359 states and 559 transitions. [2019-11-28 15:40:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,483 INFO L225 Difference]: With dead ends: 359 [2019-11-28 15:40:14,483 INFO L226 Difference]: Without dead ends: 187 [2019-11-28 15:40:14,485 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-28 15:40:14,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-28 15:40:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-11-28 15:40:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-28 15:40:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-11-28 15:40:14,500 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 26 [2019-11-28 15:40:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,501 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-28 15:40:14,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2019-11-28 15:40:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:14,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,503 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] [2019-11-28 15:40:14,503 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,504 INFO L82 PathProgramCache]: Analyzing trace with hash -304150793, now seen corresponding path program 1 times [2019-11-28 15:40:14,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201739759] [2019-11-28 15:40:14,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,553 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-28 15:40:14,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201739759] [2019-11-28 15:40:14,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039328872] [2019-11-28 15:40:14,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,556 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand 3 states. [2019-11-28 15:40:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,739 INFO L93 Difference]: Finished difference Result 364 states and 569 transitions. [2019-11-28 15:40:14,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,743 INFO L225 Difference]: With dead ends: 364 [2019-11-28 15:40:14,744 INFO L226 Difference]: Without dead ends: 186 [2019-11-28 15:40:14,753 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-28 15:40:14,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-28 15:40:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-28 15:40:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:40:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2019-11-28 15:40:14,786 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 26 [2019-11-28 15:40:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,789 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2019-11-28 15:40:14,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2019-11-28 15:40:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:14,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,794 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] [2019-11-28 15:40:14,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347919, now seen corresponding path program 1 times [2019-11-28 15:40:14,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634733598] [2019-11-28 15:40:14,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,865 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-28 15:40:14,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634733598] [2019-11-28 15:40:14,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654846021] [2019-11-28 15:40:14,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,867 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2019-11-28 15:40:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,027 INFO L93 Difference]: Finished difference Result 375 states and 581 transitions. [2019-11-28 15:40:15,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:40:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,030 INFO L225 Difference]: With dead ends: 375 [2019-11-28 15:40:15,030 INFO L226 Difference]: Without dead ends: 196 [2019-11-28 15:40:15,031 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-28 15:40:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-28 15:40:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-28 15:40:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:40:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2019-11-28 15:40:15,044 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 27 [2019-11-28 15:40:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,045 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2019-11-28 15:40:15,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2019-11-28 15:40:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 15:40:15,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,047 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] [2019-11-28 15:40:15,047 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1768037659, now seen corresponding path program 1 times [2019-11-28 15:40:15,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906468279] [2019-11-28 15:40:15,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,082 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-28 15:40:15,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906468279] [2019-11-28 15:40:15,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47419858] [2019-11-28 15:40:15,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,085 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2019-11-28 15:40:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,252 INFO L93 Difference]: Finished difference Result 375 states and 577 transitions. [2019-11-28 15:40:15,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 15:40:15,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,255 INFO L225 Difference]: With dead ends: 375 [2019-11-28 15:40:15,255 INFO L226 Difference]: Without dead ends: 196 [2019-11-28 15:40:15,256 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-28 15:40:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-28 15:40:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-28 15:40:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:40:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2019-11-28 15:40:15,277 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 28 [2019-11-28 15:40:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,277 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2019-11-28 15:40:15,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2019-11-28 15:40:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:40:15,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,279 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] [2019-11-28 15:40:15,279 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1213962132, now seen corresponding path program 1 times [2019-11-28 15:40:15,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869824165] [2019-11-28 15:40:15,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,341 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-28 15:40:15,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869824165] [2019-11-28 15:40:15,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27725778] [2019-11-28 15:40:15,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,345 INFO L87 Difference]: Start difference. First operand 186 states and 286 transitions. Second operand 3 states. [2019-11-28 15:40:15,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,495 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2019-11-28 15:40:15,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 15:40:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,498 INFO L225 Difference]: With dead ends: 375 [2019-11-28 15:40:15,499 INFO L226 Difference]: Without dead ends: 196 [2019-11-28 15:40:15,499 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-28 15:40:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-28 15:40:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-28 15:40:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:40:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 284 transitions. [2019-11-28 15:40:15,509 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 284 transitions. Word has length 29 [2019-11-28 15:40:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,509 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 284 transitions. [2019-11-28 15:40:15,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 284 transitions. [2019-11-28 15:40:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:40:15,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,511 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] [2019-11-28 15:40:15,511 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1639645429, now seen corresponding path program 1 times [2019-11-28 15:40:15,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496738158] [2019-11-28 15:40:15,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,555 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-28 15:40:15,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496738158] [2019-11-28 15:40:15,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:15,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670362260] [2019-11-28 15:40:15,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:15,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:15,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:15,557 INFO L87 Difference]: Start difference. First operand 186 states and 284 transitions. Second operand 4 states. [2019-11-28 15:40:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,846 INFO L93 Difference]: Finished difference Result 571 states and 870 transitions. [2019-11-28 15:40:15,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:15,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-28 15:40:15,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,849 INFO L225 Difference]: With dead ends: 571 [2019-11-28 15:40:15,849 INFO L226 Difference]: Without dead ends: 392 [2019-11-28 15:40:15,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-28 15:40:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2019-11-28 15:40:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-28 15:40:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2019-11-28 15:40:15,867 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 29 [2019-11-28 15:40:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,867 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2019-11-28 15:40:15,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2019-11-28 15:40:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 15:40:15,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,868 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] [2019-11-28 15:40:15,869 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash -356314719, now seen corresponding path program 1 times [2019-11-28 15:40:15,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769422365] [2019-11-28 15:40:15,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,927 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-28 15:40:15,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769422365] [2019-11-28 15:40:15,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911783521] [2019-11-28 15:40:15,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,930 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand 3 states. [2019-11-28 15:40:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,098 INFO L93 Difference]: Finished difference Result 780 states and 1196 transitions. [2019-11-28 15:40:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 15:40:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,102 INFO L225 Difference]: With dead ends: 780 [2019-11-28 15:40:16,102 INFO L226 Difference]: Without dead ends: 431 [2019-11-28 15:40:16,103 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-28 15:40:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-28 15:40:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-11-28 15:40:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-28 15:40:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 629 transitions. [2019-11-28 15:40:16,122 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 629 transitions. Word has length 32 [2019-11-28 15:40:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,123 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 629 transitions. [2019-11-28 15:40:16,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 629 transitions. [2019-11-28 15:40:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 15:40:16,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,124 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] [2019-11-28 15:40:16,124 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 863724629, now seen corresponding path program 1 times [2019-11-28 15:40:16,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15646810] [2019-11-28 15:40:16,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,180 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-28 15:40:16,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15646810] [2019-11-28 15:40:16,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861990640] [2019-11-28 15:40:16,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,182 INFO L87 Difference]: Start difference. First operand 411 states and 629 transitions. Second operand 3 states. [2019-11-28 15:40:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,359 INFO L93 Difference]: Finished difference Result 857 states and 1320 transitions. [2019-11-28 15:40:16,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 15:40:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,364 INFO L225 Difference]: With dead ends: 857 [2019-11-28 15:40:16,364 INFO L226 Difference]: Without dead ends: 453 [2019-11-28 15:40:16,365 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-28 15:40:16,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-28 15:40:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 433. [2019-11-28 15:40:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-28 15:40:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2019-11-28 15:40:16,393 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 33 [2019-11-28 15:40:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,395 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2019-11-28 15:40:16,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2019-11-28 15:40:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 15:40:16,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,396 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] [2019-11-28 15:40:16,396 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131601, now seen corresponding path program 1 times [2019-11-28 15:40:16,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393616747] [2019-11-28 15:40:16,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:16,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393616747] [2019-11-28 15:40:16,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646825451] [2019-11-28 15:40:16,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,454 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand 3 states. [2019-11-28 15:40:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,648 INFO L93 Difference]: Finished difference Result 924 states and 1432 transitions. [2019-11-28 15:40:16,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 15:40:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,653 INFO L225 Difference]: With dead ends: 924 [2019-11-28 15:40:16,653 INFO L226 Difference]: Without dead ends: 498 [2019-11-28 15:40:16,655 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-28 15:40:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-28 15:40:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2019-11-28 15:40:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-28 15:40:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2019-11-28 15:40:16,685 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 39 [2019-11-28 15:40:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,686 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2019-11-28 15:40:16,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2019-11-28 15:40:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 15:40:16,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,688 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] [2019-11-28 15:40:16,688 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430936, now seen corresponding path program 1 times [2019-11-28 15:40:16,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077553250] [2019-11-28 15:40:16,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,730 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-28 15:40:16,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077553250] [2019-11-28 15:40:16,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314930357] [2019-11-28 15:40:16,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,733 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand 3 states. [2019-11-28 15:40:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,952 INFO L93 Difference]: Finished difference Result 991 states and 1544 transitions. [2019-11-28 15:40:16,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-28 15:40:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,958 INFO L225 Difference]: With dead ends: 991 [2019-11-28 15:40:16,958 INFO L226 Difference]: Without dead ends: 510 [2019-11-28 15:40:16,959 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-28 15:40:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-28 15:40:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 500. [2019-11-28 15:40:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-28 15:40:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 781 transitions. [2019-11-28 15:40:16,982 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 781 transitions. Word has length 40 [2019-11-28 15:40:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,982 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 781 transitions. [2019-11-28 15:40:16,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 781 transitions. [2019-11-28 15:40:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 15:40:16,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,984 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:16,985 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1491732218, now seen corresponding path program 1 times [2019-11-28 15:40:16,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930864716] [2019-11-28 15:40:16,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:17,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930864716] [2019-11-28 15:40:17,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526522096] [2019-11-28 15:40:17,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,053 INFO L87 Difference]: Start difference. First operand 500 states and 781 transitions. Second operand 3 states. [2019-11-28 15:40:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,204 INFO L93 Difference]: Finished difference Result 1007 states and 1574 transitions. [2019-11-28 15:40:17,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-28 15:40:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,208 INFO L225 Difference]: With dead ends: 1007 [2019-11-28 15:40:17,208 INFO L226 Difference]: Without dead ends: 514 [2019-11-28 15:40:17,209 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-28 15:40:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-28 15:40:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-11-28 15:40:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-28 15:40:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 777 transitions. [2019-11-28 15:40:17,230 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 777 transitions. Word has length 60 [2019-11-28 15:40:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,230 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 777 transitions. [2019-11-28 15:40:17,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 777 transitions. [2019-11-28 15:40:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 15:40:17,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,232 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:17,233 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash -892846741, now seen corresponding path program 1 times [2019-11-28 15:40:17,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055497382] [2019-11-28 15:40:17,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 15:40:17,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055497382] [2019-11-28 15:40:17,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465119417] [2019-11-28 15:40:17,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,268 INFO L87 Difference]: Start difference. First operand 500 states and 777 transitions. Second operand 3 states. [2019-11-28 15:40:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,411 INFO L93 Difference]: Finished difference Result 1035 states and 1604 transitions. [2019-11-28 15:40:17,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-28 15:40:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,415 INFO L225 Difference]: With dead ends: 1035 [2019-11-28 15:40:17,415 INFO L226 Difference]: Without dead ends: 542 [2019-11-28 15:40:17,417 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-28 15:40:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-28 15:40:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2019-11-28 15:40:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-28 15:40:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2019-11-28 15:40:17,442 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 61 [2019-11-28 15:40:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,443 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2019-11-28 15:40:17,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2019-11-28 15:40:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-28 15:40:17,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,445 INFO L410 BasicCegarLoop]: trace histogram [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-28 15:40:17,445 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,446 INFO L82 PathProgramCache]: Analyzing trace with hash 27094997, now seen corresponding path program 1 times [2019-11-28 15:40:17,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035748320] [2019-11-28 15:40:17,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:17,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035748320] [2019-11-28 15:40:17,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374801427] [2019-11-28 15:40:17,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,497 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand 3 states. [2019-11-28 15:40:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,669 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2019-11-28 15:40:17,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-28 15:40:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,673 INFO L225 Difference]: With dead ends: 1095 [2019-11-28 15:40:17,673 INFO L226 Difference]: Without dead ends: 570 [2019-11-28 15:40:17,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-28 15:40:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-11-28 15:40:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-28 15:40:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 873 transitions. [2019-11-28 15:40:17,705 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 873 transitions. Word has length 61 [2019-11-28 15:40:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,706 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 873 transitions. [2019-11-28 15:40:17,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 873 transitions. [2019-11-28 15:40:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-28 15:40:17,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,708 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,708 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1141694985, now seen corresponding path program 1 times [2019-11-28 15:40:17,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343473560] [2019-11-28 15:40:17,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 15:40:17,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343473560] [2019-11-28 15:40:17,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793174016] [2019-11-28 15:40:17,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,757 INFO L87 Difference]: Start difference. First operand 570 states and 873 transitions. Second operand 3 states. [2019-11-28 15:40:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,991 INFO L93 Difference]: Finished difference Result 1143 states and 1749 transitions. [2019-11-28 15:40:17,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-28 15:40:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,996 INFO L225 Difference]: With dead ends: 1143 [2019-11-28 15:40:17,997 INFO L226 Difference]: Without dead ends: 580 [2019-11-28 15:40:17,998 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-28 15:40:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-28 15:40:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2019-11-28 15:40:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-28 15:40:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 868 transitions. [2019-11-28 15:40:18,027 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 868 transitions. Word has length 62 [2019-11-28 15:40:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,028 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 868 transitions. [2019-11-28 15:40:18,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 868 transitions. [2019-11-28 15:40:18,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 15:40:18,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,031 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1688729156, now seen corresponding path program 1 times [2019-11-28 15:40:18,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779585308] [2019-11-28 15:40:18,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:18,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779585308] [2019-11-28 15:40:18,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747478497] [2019-11-28 15:40:18,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,070 INFO L87 Difference]: Start difference. First operand 570 states and 868 transitions. Second operand 3 states. [2019-11-28 15:40:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,236 INFO L93 Difference]: Finished difference Result 1180 states and 1793 transitions. [2019-11-28 15:40:18,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 15:40:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,240 INFO L225 Difference]: With dead ends: 1180 [2019-11-28 15:40:18,240 INFO L226 Difference]: Without dead ends: 617 [2019-11-28 15:40:18,241 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-28 15:40:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-28 15:40:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-28 15:40:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-28 15:40:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2019-11-28 15:40:18,265 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 73 [2019-11-28 15:40:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,265 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2019-11-28 15:40:18,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2019-11-28 15:40:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 15:40:18,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,267 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -628849429, now seen corresponding path program 1 times [2019-11-28 15:40:18,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334986386] [2019-11-28 15:40:18,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,299 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:18,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334986386] [2019-11-28 15:40:18,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302662017] [2019-11-28 15:40:18,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,307 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand 3 states. [2019-11-28 15:40:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,477 INFO L93 Difference]: Finished difference Result 1223 states and 1851 transitions. [2019-11-28 15:40:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-28 15:40:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,481 INFO L225 Difference]: With dead ends: 1223 [2019-11-28 15:40:18,481 INFO L226 Difference]: Without dead ends: 617 [2019-11-28 15:40:18,482 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-28 15:40:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-28 15:40:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-28 15:40:18,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-28 15:40:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 926 transitions. [2019-11-28 15:40:18,503 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 926 transitions. Word has length 74 [2019-11-28 15:40:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,504 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 926 transitions. [2019-11-28 15:40:18,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 926 transitions. [2019-11-28 15:40:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-28 15:40:18,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,506 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,506 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1361446465, now seen corresponding path program 1 times [2019-11-28 15:40:18,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211706753] [2019-11-28 15:40:18,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-28 15:40:18,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211706753] [2019-11-28 15:40:18,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418581514] [2019-11-28 15:40:18,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,543 INFO L87 Difference]: Start difference. First operand 613 states and 926 transitions. Second operand 3 states. [2019-11-28 15:40:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,679 INFO L93 Difference]: Finished difference Result 1255 states and 1894 transitions. [2019-11-28 15:40:18,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-28 15:40:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,683 INFO L225 Difference]: With dead ends: 1255 [2019-11-28 15:40:18,683 INFO L226 Difference]: Without dead ends: 649 [2019-11-28 15:40:18,685 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-28 15:40:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-28 15:40:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-28 15:40:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-28 15:40:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 960 transitions. [2019-11-28 15:40:18,707 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 960 transitions. Word has length 83 [2019-11-28 15:40:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,708 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 960 transitions. [2019-11-28 15:40:18,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 960 transitions. [2019-11-28 15:40:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:40:18,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,710 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,710 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1716915501, now seen corresponding path program 1 times [2019-11-28 15:40:18,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140152404] [2019-11-28 15:40:18,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-28 15:40:18,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140152404] [2019-11-28 15:40:18,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655393162] [2019-11-28 15:40:18,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,738 INFO L87 Difference]: Start difference. First operand 641 states and 960 transitions. Second operand 3 states. [2019-11-28 15:40:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,896 INFO L93 Difference]: Finished difference Result 1283 states and 1921 transitions. [2019-11-28 15:40:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:40:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,902 INFO L225 Difference]: With dead ends: 1283 [2019-11-28 15:40:18,902 INFO L226 Difference]: Without dead ends: 649 [2019-11-28 15:40:18,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-28 15:40:18,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-28 15:40:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-28 15:40:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2019-11-28 15:40:18,939 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 84 [2019-11-28 15:40:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,939 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2019-11-28 15:40:18,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,940 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2019-11-28 15:40:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-28 15:40:18,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,943 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1450581597, now seen corresponding path program 1 times [2019-11-28 15:40:18,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740595422] [2019-11-28 15:40:18,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-28 15:40:18,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740595422] [2019-11-28 15:40:18,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110234790] [2019-11-28 15:40:18,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,987 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2019-11-28 15:40:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:19,217 INFO L93 Difference]: Finished difference Result 1315 states and 1948 transitions. [2019-11-28 15:40:19,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:19,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-28 15:40:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:19,223 INFO L225 Difference]: With dead ends: 1315 [2019-11-28 15:40:19,224 INFO L226 Difference]: Without dead ends: 681 [2019-11-28 15:40:19,225 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-28 15:40:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-28 15:40:19,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-28 15:40:19,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-28 15:40:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 997 transitions. [2019-11-28 15:40:19,262 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 997 transitions. Word has length 88 [2019-11-28 15:40:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:19,263 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 997 transitions. [2019-11-28 15:40:19,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 997 transitions. [2019-11-28 15:40:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 15:40:19,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:19,266 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] [2019-11-28 15:40:19,266 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:19,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:19,267 INFO L82 PathProgramCache]: Analyzing trace with hash -398439497, now seen corresponding path program 1 times [2019-11-28 15:40:19,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:19,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617201335] [2019-11-28 15:40:19,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-28 15:40:19,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617201335] [2019-11-28 15:40:19,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:19,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:19,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915169456] [2019-11-28 15:40:19,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:19,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,309 INFO L87 Difference]: Start difference. First operand 677 states and 997 transitions. Second operand 3 states. [2019-11-28 15:40:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:19,540 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2019-11-28 15:40:19,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:19,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-28 15:40:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:19,546 INFO L225 Difference]: With dead ends: 1351 [2019-11-28 15:40:19,546 INFO L226 Difference]: Without dead ends: 681 [2019-11-28 15:40:19,548 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-28 15:40:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-28 15:40:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-28 15:40:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-28 15:40:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 992 transitions. [2019-11-28 15:40:19,586 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 992 transitions. Word has length 89 [2019-11-28 15:40:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:19,586 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 992 transitions. [2019-11-28 15:40:19,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 992 transitions. [2019-11-28 15:40:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 15:40:19,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:19,590 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:19,591 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:19,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:19,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1868895208, now seen corresponding path program 1 times [2019-11-28 15:40:19,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:19,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349180218] [2019-11-28 15:40:19,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-28 15:40:19,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349180218] [2019-11-28 15:40:19,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:19,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:19,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549073017] [2019-11-28 15:40:19,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:19,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:19,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,668 INFO L87 Difference]: Start difference. First operand 677 states and 992 transitions. Second operand 3 states. [2019-11-28 15:40:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:19,752 INFO L93 Difference]: Finished difference Result 2003 states and 2928 transitions. [2019-11-28 15:40:19,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:19,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-28 15:40:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:19,762 INFO L225 Difference]: With dead ends: 2003 [2019-11-28 15:40:19,762 INFO L226 Difference]: Without dead ends: 1333 [2019-11-28 15:40:19,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-11-28 15:40:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 679. [2019-11-28 15:40:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-11-28 15:40:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 994 transitions. [2019-11-28 15:40:19,823 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 994 transitions. Word has length 100 [2019-11-28 15:40:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:19,823 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 994 transitions. [2019-11-28 15:40:19,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 994 transitions. [2019-11-28 15:40:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 15:40:19,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:19,827 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:19,828 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash 589031530, now seen corresponding path program 1 times [2019-11-28 15:40:19,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:19,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710878759] [2019-11-28 15:40:19,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-28 15:40:19,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710878759] [2019-11-28 15:40:19,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:19,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:19,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969418344] [2019-11-28 15:40:19,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:19,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,917 INFO L87 Difference]: Start difference. First operand 679 states and 994 transitions. Second operand 3 states. [2019-11-28 15:40:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:19,987 INFO L93 Difference]: Finished difference Result 1362 states and 1992 transitions. [2019-11-28 15:40:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:19,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-28 15:40:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:19,994 INFO L225 Difference]: With dead ends: 1362 [2019-11-28 15:40:19,994 INFO L226 Difference]: Without dead ends: 690 [2019-11-28 15:40:20,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-28 15:40:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 677. [2019-11-28 15:40:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-28 15:40:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 987 transitions. [2019-11-28 15:40:20,084 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 987 transitions. Word has length 100 [2019-11-28 15:40:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:20,085 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 987 transitions. [2019-11-28 15:40:20,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 987 transitions. [2019-11-28 15:40:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-28 15:40:20,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:20,089 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:20,089 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash 303396910, now seen corresponding path program 1 times [2019-11-28 15:40:20,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:20,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385240820] [2019-11-28 15:40:20,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 15:40:20,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385240820] [2019-11-28 15:40:20,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:20,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:20,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087888367] [2019-11-28 15:40:20,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:20,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:20,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:20,171 INFO L87 Difference]: Start difference. First operand 677 states and 987 transitions. Second operand 3 states. [2019-11-28 15:40:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:20,278 INFO L93 Difference]: Finished difference Result 2017 states and 2939 transitions. [2019-11-28 15:40:20,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:20,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-28 15:40:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:20,286 INFO L225 Difference]: With dead ends: 2017 [2019-11-28 15:40:20,286 INFO L226 Difference]: Without dead ends: 1347 [2019-11-28 15:40:20,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-11-28 15:40:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2019-11-28 15:40:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-11-28 15:40:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1950 transitions. [2019-11-28 15:40:20,344 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1950 transitions. Word has length 101 [2019-11-28 15:40:20,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:20,345 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1950 transitions. [2019-11-28 15:40:20,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1950 transitions. [2019-11-28 15:40:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-28 15:40:20,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:20,348 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:20,349 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:20,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:20,349 INFO L82 PathProgramCache]: Analyzing trace with hash -283409104, now seen corresponding path program 1 times [2019-11-28 15:40:20,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:20,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551273521] [2019-11-28 15:40:20,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:20,481 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:40:20,481 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:40:20,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:20 BoogieIcfgContainer [2019-11-28 15:40:20,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:20,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:20,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:20,609 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:20,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:13" (3/4) ... [2019-11-28 15:40:20,613 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:40:20,791 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:20,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:20,794 INFO L168 Benchmark]: Toolchain (without parser) took 9249.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -231.7 MB). Peak memory consumption was 86.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,794 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:20,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,796 INFO L168 Benchmark]: Boogie Preprocessor took 37.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:20,796 INFO L168 Benchmark]: RCFGBuilder took 875.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,797 INFO L168 Benchmark]: TraceAbstraction took 7491.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 192.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -155.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,797 INFO L168 Benchmark]: Witness Printer took 182.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,800 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.82 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 875.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7491.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 192.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -155.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Witness Printer took 182.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 642]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L647] int s ; [L648] int tmp ; [L652] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength ; [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 = __VERIFIER_nondet_int() ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__state = initial_state [L73] blastFlag = 0 [L74] tmp = __VERIFIER_nondet_int() [L75] Time = tmp [L76] cb = 0 [L77] ret = -1 [L78] skip = 0 [L79] got_new_session = 0 [L80] COND TRUE s__info_callback != 0 [L81] cb = s__info_callback [L87] s__in_handshake ++ [L88] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(s__cert == 0) [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND TRUE s__state == 8464 [L270] s__shutdown = 0 [L271] ret = __VERIFIER_nondet_int() [L272] COND TRUE blastFlag == 0 [L273] blastFlag = 1 [L275] COND FALSE !(ret <= 0) [L278] got_new_session = 1 [L279] s__state = 8496 [L280] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND TRUE s__state == 8496 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L288] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 8512 [L296] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND TRUE s__state == 8512 [L301] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L302] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L303] COND TRUE __cil_tmp56 + 256UL [L304] skip = 1 [L315] s__state = 8528 [L316] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND TRUE s__state == 8528 [L320] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L321] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L323] __cil_tmp57 = (unsigned long )s__options [L324] COND TRUE __cil_tmp57 + 2097152UL [L325] s__s3__tmp__use_rsa_tmp = 1 [L330] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L357] ret = __VERIFIER_nondet_int() [L358] COND FALSE !(blastFlag == 6) [L361] COND FALSE !(ret <= 0) [L378] s__state = 8544 [L379] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND TRUE ! s__s3__tmp__reuse_message [L601] COND TRUE ! skip [L602] COND TRUE state == 8528 [L603] COND TRUE s__state == 8544 [L604] COND TRUE tmp___7 != 1024 [L605] COND TRUE tmp___7 != 512 [L606] COND TRUE __cil_tmp58 != 4294967294 [L607] COND TRUE l != 4294967266 [L642] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.3s, OverallIterations: 26, TraceHistogramMax: 4, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4244 SDtfs, 4375 SDslu, 1279 SDs, 0 SdLazy, 2053 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 179497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 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...