./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.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_1.cil-1.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 33e9ff70181f23aec46a4e91eec467338569fa5a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:03,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:03,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:03,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:03,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:03,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:03,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:03,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:03,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:03,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:03,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:03,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:03,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:03,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:03,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:03,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:03,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:03,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:03,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:03,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:03,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:03,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:03,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:03,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:03,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:03,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:03,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:03,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:03,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:03,374 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:03,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:03,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:03,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:03,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:03,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:03,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:03,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:03,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:03,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:03,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:03,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:03,384 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:03,411 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:03,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:03,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:03,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:03,414 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:03,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:03,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:03,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:03,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:03,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:03,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:03,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:03,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:03,418 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:03,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:03,418 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:03,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:03,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:03,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:03,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:03,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:03,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:03,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:03,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:03,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:03,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:03,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:03,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:03,422 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:03,422 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 -> 33e9ff70181f23aec46a4e91eec467338569fa5a [2019-11-28 15:40:03,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:03,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:03,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:03,729 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:03,730 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:03,730 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c [2019-11-28 15:40:03,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30988956/75ce6d6ce5ba4f608213f4e819762736/FLAGf7bf597ca [2019-11-28 15:40:04,298 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:04,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c [2019-11-28 15:40:04,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30988956/75ce6d6ce5ba4f608213f4e819762736/FLAGf7bf597ca [2019-11-28 15:40:04,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30988956/75ce6d6ce5ba4f608213f4e819762736 [2019-11-28 15:40:04,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:04,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:04,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:04,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:04,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:04,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:04" (1/1) ... [2019-11-28 15:40:04,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36afd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:04, skipping insertion in model container [2019-11-28 15:40:04,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:04" (1/1) ... [2019-11-28 15:40:04,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:04,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:05,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:05,065 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:05,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:05,141 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:05,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:05 WrapperNode [2019-11-28 15:40:05,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:05,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:05,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:05,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:05,151 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:05" (1/1) ... [2019-11-28 15:40:05,159 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:05" (1/1) ... [2019-11-28 15:40:05,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:05,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:05,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:05,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:05,210 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:05" (1/1) ... [2019-11-28 15:40:05,211 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:05" (1/1) ... [2019-11-28 15:40:05,214 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:05" (1/1) ... [2019-11-28 15:40:05,214 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:05" (1/1) ... [2019-11-28 15:40:05,222 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:05" (1/1) ... [2019-11-28 15:40:05,232 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:05" (1/1) ... [2019-11-28 15:40:05,235 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:05" (1/1) ... [2019-11-28 15:40:05,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:05,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:05,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:05,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:05,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:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:05,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:05,419 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:40:06,039 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 15:40:06,040 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 15:40:06,041 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:06,042 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:40:06,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:06 BoogieIcfgContainer [2019-11-28 15:40:06,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:06,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:06,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:06,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:06,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:04" (1/3) ... [2019-11-28 15:40:06,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461293e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:06, skipping insertion in model container [2019-11-28 15:40:06,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:05" (2/3) ... [2019-11-28 15:40:06,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461293e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:06, skipping insertion in model container [2019-11-28 15:40:06,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:06" (3/3) ... [2019-11-28 15:40:06,054 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-1.c [2019-11-28 15:40:06,065 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:06,073 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:06,086 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:06,130 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:06,130 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:06,132 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:06,133 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:06,133 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:06,133 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:06,133 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:06,134 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-11-28 15:40:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 15:40:06,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:06,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:06,179 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126500, now seen corresponding path program 1 times [2019-11-28 15:40:06,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:06,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069001977] [2019-11-28 15:40:06,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:06,491 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:06,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069001977] [2019-11-28 15:40:06,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:06,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:06,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223105731] [2019-11-28 15:40:06,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:06,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:06,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:06,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:06,518 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-11-28 15:40:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:06,875 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-11-28 15:40:06,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:06,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 15:40:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:06,902 INFO L225 Difference]: With dead ends: 332 [2019-11-28 15:40:06,902 INFO L226 Difference]: Without dead ends: 177 [2019-11-28 15:40:06,906 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:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-28 15:40:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-11-28 15:40:06,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-28 15:40:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-11-28 15:40:06,968 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-11-28 15:40:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:06,969 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-11-28 15:40:06,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-11-28 15:40:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 15:40:06,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:06,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:06,973 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:06,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296701, now seen corresponding path program 1 times [2019-11-28 15:40:06,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:06,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174128653] [2019-11-28 15:40:06,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:07,072 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:07,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174128653] [2019-11-28 15:40:07,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:07,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:07,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094986730] [2019-11-28 15:40:07,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:07,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:07,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:07,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:07,078 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-11-28 15:40:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:07,362 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-11-28 15:40:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:07,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-28 15:40:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:07,366 INFO L225 Difference]: With dead ends: 384 [2019-11-28 15:40:07,366 INFO L226 Difference]: Without dead ends: 218 [2019-11-28 15:40:07,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-11-28 15:40:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-11-28 15:40:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-28 15:40:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-11-28 15:40:07,405 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-11-28 15:40:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:07,406 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-11-28 15:40:07,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-11-28 15:40:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-28 15:40:07,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:07,419 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:07,419 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:07,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:07,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1767942993, now seen corresponding path program 1 times [2019-11-28 15:40:07,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:07,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963001718] [2019-11-28 15:40:07,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:07,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963001718] [2019-11-28 15:40:07,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:07,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:07,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842553411] [2019-11-28 15:40:07,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:07,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:07,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:07,546 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-11-28 15:40:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:07,757 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-11-28 15:40:07,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:07,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-28 15:40:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:07,761 INFO L225 Difference]: With dead ends: 448 [2019-11-28 15:40:07,761 INFO L226 Difference]: Without dead ends: 243 [2019-11-28 15:40:07,763 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:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-28 15:40:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-28 15:40:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-28 15:40:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-11-28 15:40:07,794 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-11-28 15:40:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:07,796 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-11-28 15:40:07,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-11-28 15:40:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:40:07,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:07,802 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:07,803 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:07,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:07,804 INFO L82 PathProgramCache]: Analyzing trace with hash -409474745, now seen corresponding path program 1 times [2019-11-28 15:40:07,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:07,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254386552] [2019-11-28 15:40:07,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:07,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254386552] [2019-11-28 15:40:07,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:07,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:07,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820871626] [2019-11-28 15:40:07,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:07,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:07,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:07,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:07,909 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-11-28 15:40:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:08,115 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-11-28 15:40:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:08,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:40:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:08,120 INFO L225 Difference]: With dead ends: 525 [2019-11-28 15:40:08,120 INFO L226 Difference]: Without dead ends: 289 [2019-11-28 15:40:08,121 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:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-28 15:40:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-11-28 15:40:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-28 15:40:08,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-11-28 15:40:08,147 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-11-28 15:40:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:08,148 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-11-28 15:40:08,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:08,148 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-11-28 15:40:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-28 15:40:08,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:08,150 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:08,151 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:08,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:08,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1510819865, now seen corresponding path program 1 times [2019-11-28 15:40:08,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:08,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006396780] [2019-11-28 15:40:08,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:08,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006396780] [2019-11-28 15:40:08,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:08,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:08,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835242443] [2019-11-28 15:40:08,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:08,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:08,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:08,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:08,214 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-11-28 15:40:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:08,362 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-11-28 15:40:08,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:08,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-28 15:40:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:08,365 INFO L225 Difference]: With dead ends: 580 [2019-11-28 15:40:08,365 INFO L226 Difference]: Without dead ends: 302 [2019-11-28 15:40:08,366 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:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-28 15:40:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-28 15:40:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-28 15:40:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-11-28 15:40:08,381 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-11-28 15:40:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:08,381 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-11-28 15:40:08,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-11-28 15:40:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-28 15:40:08,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:08,384 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:08,384 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:08,385 INFO L82 PathProgramCache]: Analyzing trace with hash 556901760, now seen corresponding path program 1 times [2019-11-28 15:40:08,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:08,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196611349] [2019-11-28 15:40:08,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:08,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196611349] [2019-11-28 15:40:08,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:08,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:08,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983478151] [2019-11-28 15:40:08,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:08,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:08,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:08,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:08,484 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-11-28 15:40:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:08,677 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-11-28 15:40:08,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:08,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-28 15:40:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:08,682 INFO L225 Difference]: With dead ends: 597 [2019-11-28 15:40:08,683 INFO L226 Difference]: Without dead ends: 302 [2019-11-28 15:40:08,684 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:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-28 15:40:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-11-28 15:40:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-28 15:40:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-11-28 15:40:08,696 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-11-28 15:40:08,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:08,696 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-11-28 15:40:08,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-11-28 15:40:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-28 15:40:08,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:08,698 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:08,699 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:08,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 134586867, now seen corresponding path program 1 times [2019-11-28 15:40:08,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:08,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680052915] [2019-11-28 15:40:08,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:08,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680052915] [2019-11-28 15:40:08,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:08,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:08,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569327344] [2019-11-28 15:40:08,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:08,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:08,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:08,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:08,750 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-11-28 15:40:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:08,900 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-11-28 15:40:08,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:08,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-28 15:40:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:08,903 INFO L225 Difference]: With dead ends: 591 [2019-11-28 15:40:08,903 INFO L226 Difference]: Without dead ends: 300 [2019-11-28 15:40:08,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:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-28 15:40:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-11-28 15:40:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-28 15:40:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-11-28 15:40:08,914 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-11-28 15:40:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:08,915 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-11-28 15:40:08,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-11-28 15:40:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 15:40:08,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:08,917 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:08,917 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:08,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1345174066, now seen corresponding path program 1 times [2019-11-28 15:40:08,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:08,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470864999] [2019-11-28 15:40:08,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-28 15:40:08,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470864999] [2019-11-28 15:40:08,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:08,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:08,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883422990] [2019-11-28 15:40:08,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:08,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:08,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:08,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:08,988 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-11-28 15:40:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:09,138 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-11-28 15:40:09,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:09,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 15:40:09,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:09,141 INFO L225 Difference]: With dead ends: 598 [2019-11-28 15:40:09,141 INFO L226 Difference]: Without dead ends: 307 [2019-11-28 15:40:09,142 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:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-28 15:40:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-11-28 15:40:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-11-28 15:40:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-11-28 15:40:09,154 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-11-28 15:40:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:09,154 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-11-28 15:40:09,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-11-28 15:40:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 15:40:09,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:09,156 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:09,157 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash 414047818, now seen corresponding path program 1 times [2019-11-28 15:40:09,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:09,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78729472] [2019-11-28 15:40:09,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:09,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78729472] [2019-11-28 15:40:09,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:09,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:09,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153989107] [2019-11-28 15:40:09,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:09,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:09,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:09,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:09,248 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-11-28 15:40:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:09,391 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-11-28 15:40:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:09,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 15:40:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:09,394 INFO L225 Difference]: With dead ends: 638 [2019-11-28 15:40:09,394 INFO L226 Difference]: Without dead ends: 338 [2019-11-28 15:40:09,395 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:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-28 15:40:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-28 15:40:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-28 15:40:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-11-28 15:40:09,407 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-11-28 15:40:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:09,407 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-11-28 15:40:09,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-11-28 15:40:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 15:40:09,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:09,409 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:09,409 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash -728621130, now seen corresponding path program 1 times [2019-11-28 15:40:09,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:09,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57017972] [2019-11-28 15:40:09,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:09,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57017972] [2019-11-28 15:40:09,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:09,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:09,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928740607] [2019-11-28 15:40:09,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:09,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:09,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:09,447 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-11-28 15:40:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:09,595 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-11-28 15:40:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:09,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-28 15:40:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:09,597 INFO L225 Difference]: With dead ends: 667 [2019-11-28 15:40:09,598 INFO L226 Difference]: Without dead ends: 338 [2019-11-28 15:40:09,598 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:09,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-28 15:40:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-11-28 15:40:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-28 15:40:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-11-28 15:40:09,611 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-11-28 15:40:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:09,611 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-11-28 15:40:09,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-11-28 15:40:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-28 15:40:09,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:09,613 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:09,613 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1946943846, now seen corresponding path program 1 times [2019-11-28 15:40:09,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:09,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456431642] [2019-11-28 15:40:09,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:09,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456431642] [2019-11-28 15:40:09,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:09,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:09,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495318028] [2019-11-28 15:40:09,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:09,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:09,660 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-11-28 15:40:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:09,833 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-11-28 15:40:09,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:09,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-28 15:40:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:09,836 INFO L225 Difference]: With dead ends: 700 [2019-11-28 15:40:09,836 INFO L226 Difference]: Without dead ends: 371 [2019-11-28 15:40:09,837 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:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-28 15:40:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-28 15:40:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-28 15:40:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-11-28 15:40:09,852 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-11-28 15:40:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:09,852 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-11-28 15:40:09,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-11-28 15:40:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-28 15:40:09,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:09,854 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:09,855 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1829577626, now seen corresponding path program 1 times [2019-11-28 15:40:09,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:09,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609771819] [2019-11-28 15:40:09,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,907 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 15:40:09,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609771819] [2019-11-28 15:40:09,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:09,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:09,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847489801] [2019-11-28 15:40:09,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:09,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:09,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:09,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:09,909 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-11-28 15:40:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:10,070 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-11-28 15:40:10,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:10,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-28 15:40:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:10,073 INFO L225 Difference]: With dead ends: 727 [2019-11-28 15:40:10,073 INFO L226 Difference]: Without dead ends: 371 [2019-11-28 15:40:10,074 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:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-11-28 15:40:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-11-28 15:40:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-28 15:40:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-11-28 15:40:10,091 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-11-28 15:40:10,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:10,091 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-11-28 15:40:10,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-11-28 15:40:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 15:40:10,093 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:10,094 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:10,094 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash -932592104, now seen corresponding path program 1 times [2019-11-28 15:40:10,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:10,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364681465] [2019-11-28 15:40:10,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:40:10,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364681465] [2019-11-28 15:40:10,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:10,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:10,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528753810] [2019-11-28 15:40:10,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:10,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:10,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:10,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:10,148 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-11-28 15:40:10,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:10,347 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-11-28 15:40:10,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:10,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-28 15:40:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:10,350 INFO L225 Difference]: With dead ends: 744 [2019-11-28 15:40:10,350 INFO L226 Difference]: Without dead ends: 388 [2019-11-28 15:40:10,351 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:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-28 15:40:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-28 15:40:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-28 15:40:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-11-28 15:40:10,367 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-11-28 15:40:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:10,367 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-11-28 15:40:10,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-11-28 15:40:10,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-28 15:40:10,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:10,369 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:10,369 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:10,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:10,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1760203780, now seen corresponding path program 1 times [2019-11-28 15:40:10,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:10,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117537053] [2019-11-28 15:40:10,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:10,403 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-28 15:40:10,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117537053] [2019-11-28 15:40:10,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:10,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:10,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251437779] [2019-11-28 15:40:10,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:10,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:10,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:10,405 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-11-28 15:40:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:10,541 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-11-28 15:40:10,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:10,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-28 15:40:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:10,544 INFO L225 Difference]: With dead ends: 765 [2019-11-28 15:40:10,544 INFO L226 Difference]: Without dead ends: 388 [2019-11-28 15:40:10,545 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:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-28 15:40:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-11-28 15:40:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-28 15:40:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-11-28 15:40:10,559 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-11-28 15:40:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:10,559 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-11-28 15:40:10,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-11-28 15:40:10,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 15:40:10,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:10,561 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:10,562 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:10,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:10,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2108241292, now seen corresponding path program 1 times [2019-11-28 15:40:10,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:10,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9013094] [2019-11-28 15:40:10,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 15:40:10,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9013094] [2019-11-28 15:40:10,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:10,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:10,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362711414] [2019-11-28 15:40:10,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:10,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:10,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:10,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:10,613 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-11-28 15:40:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:10,663 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-11-28 15:40:10,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:10,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-28 15:40:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:10,668 INFO L225 Difference]: With dead ends: 1092 [2019-11-28 15:40:10,668 INFO L226 Difference]: Without dead ends: 715 [2019-11-28 15:40:10,669 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:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-11-28 15:40:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-11-28 15:40:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-28 15:40:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-11-28 15:40:10,697 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-11-28 15:40:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:10,697 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-11-28 15:40:10,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-11-28 15:40:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-28 15:40:10,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:10,700 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:10,700 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash -58853450, now seen corresponding path program 1 times [2019-11-28 15:40:10,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:10,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278866607] [2019-11-28 15:40:10,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:10,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:40:10,821 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:40:10,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:10 BoogieIcfgContainer [2019-11-28 15:40:10,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:10,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:10,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:10,900 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:10,901 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:06" (3/4) ... [2019-11-28 15:40:10,903 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:40:11,004 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:11,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:11,007 INFO L168 Benchmark]: Toolchain (without parser) took 6355.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -235.5 MB). Peak memory consumption was 107.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:11,007 INFO L168 Benchmark]: CDTParser took 0.77 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:11,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:11,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.60 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:11,008 INFO L168 Benchmark]: Boogie Preprocessor took 40.18 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:11,009 INFO L168 Benchmark]: RCFGBuilder took 803.67 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: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:11,009 INFO L168 Benchmark]: TraceAbstraction took 4853.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.4 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:11,010 INFO L168 Benchmark]: Witness Printer took 105.11 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:11,012 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.77 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 489.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.60 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.18 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 803.67 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: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4853.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 197.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.4 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * Witness Printer took 105.11 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 611]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L616] int s ; [L617] int tmp ; [L621] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf = __VERIFIER_nondet_int() ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp = __VERIFIER_nondet_long() ; [L45] int cb ; [L46] long num1 ; [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 ; [L55] int tmp___4 ; [L56] int tmp___5 ; [L57] int tmp___6 ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 ; [L61] int tmp___10 ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L73] s__state = initial_state [L74] blastFlag = 0 [L75] 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 [L268] s__shutdown = 0 [L269] ret = __VERIFIER_nondet_int() [L270] COND TRUE blastFlag == 0 [L271] blastFlag = 1 [L273] COND FALSE !(ret <= 0) [L276] got_new_session = 1 [L277] s__state = 8496 [L278] s__init_num = 0 [L583] COND FALSE !(! s__s3__tmp__reuse_message) [L600] 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 [L282] ret = __VERIFIER_nondet_int() [L283] COND TRUE blastFlag == 1 [L284] blastFlag = 2 [L286] COND FALSE !(ret <= 0) [L289] COND TRUE \read(s__hit) [L290] s__state = 8656 [L294] s__init_num = 0 [L583] COND FALSE !(! s__s3__tmp__reuse_message) [L600] 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 FALSE !(s__state == 8528) [L148] COND FALSE !(s__state == 8529) [L151] COND FALSE !(s__state == 8544) [L154] COND FALSE !(s__state == 8545) [L157] COND FALSE !(s__state == 8560) [L160] COND FALSE !(s__state == 8561) [L163] COND FALSE !(s__state == 8448) [L166] COND FALSE !(s__state == 8576) [L169] COND FALSE !(s__state == 8577) [L172] COND FALSE !(s__state == 8592) [L175] COND FALSE !(s__state == 8593) [L178] COND FALSE !(s__state == 8608) [L181] COND FALSE !(s__state == 8609) [L184] COND FALSE !(s__state == 8640) [L187] COND FALSE !(s__state == 8641) [L190] COND TRUE s__state == 8656 [L488] s__session__cipher = s__s3__tmp__new_cipher [L489] tmp___9 = __VERIFIER_nondet_int() [L490] COND FALSE !(! tmp___9) [L494] ret = __VERIFIER_nondet_int() [L495] COND TRUE blastFlag == 2 [L496] blastFlag = 3 [L498] COND FALSE !(ret <= 0) [L501] s__state = 8672 [L502] s__init_num = 0 [L503] tmp___10 = __VERIFIER_nondet_int() [L504] COND FALSE !(! tmp___10) [L583] COND FALSE !(! s__s3__tmp__reuse_message) [L600] 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 FALSE !(s__state == 8528) [L148] COND FALSE !(s__state == 8529) [L151] COND FALSE !(s__state == 8544) [L154] COND FALSE !(s__state == 8545) [L157] COND FALSE !(s__state == 8560) [L160] COND FALSE !(s__state == 8561) [L163] COND FALSE !(s__state == 8448) [L166] COND FALSE !(s__state == 8576) [L169] COND FALSE !(s__state == 8577) [L172] COND FALSE !(s__state == 8592) [L175] COND FALSE !(s__state == 8593) [L178] COND FALSE !(s__state == 8608) [L181] COND FALSE !(s__state == 8609) [L184] COND FALSE !(s__state == 8640) [L187] COND FALSE !(s__state == 8641) [L190] COND FALSE !(s__state == 8656) [L193] COND FALSE !(s__state == 8657) [L196] COND TRUE s__state == 8672 [L511] ret = __VERIFIER_nondet_int() [L512] COND FALSE !(blastFlag == 4) [L515] COND TRUE blastFlag == 3 [L611] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.6s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2210 SDtfs, 2216 SDslu, 420 SDs, 0 SdLazy, 1340 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1456 NumberOfCodeBlocks, 1456 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1320 ConstructedInterpolants, 0 QuantifiedInterpolants, 218070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 736/736 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...