./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cbaf330d05771d2fa394e866f733d32f572a82c3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.24-cad4683 [2019-10-22 11:26:10,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:10,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:10,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:10,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:10,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:10,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:10,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:10,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:10,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:10,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:10,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:10,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:10,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:10,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:10,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:10,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:10,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:10,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:10,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:10,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:10,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:10,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:10,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:10,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:10,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:10,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:10,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:10,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:10,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:10,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:10,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:10,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:10,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:10,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:10,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:10,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:10,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:10,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:10,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:10,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:10,543 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:10,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:10,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:10,565 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:10,565 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:10,566 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:10,566 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:10,566 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:10,566 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:10,566 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:10,566 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:10,567 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:10,567 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:10,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:10,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:10,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:10,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:10,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:10,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:10,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:10,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:10,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:10,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:10,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:10,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:10,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:10,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:10,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:10,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:10,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:10,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:10,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:10,572 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:10,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:10,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:10,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:10,572 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan 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 -> Taipan 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 -> cbaf330d05771d2fa394e866f733d32f572a82c3 [2019-10-22 11:26:10,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:10,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:10,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:10,627 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:10,627 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:10,628 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c [2019-10-22 11:26:10,677 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/data/d0cddac2b/1c4560fe5bf74e1c9ae85cbc37dda612/FLAG359ea9b63 [2019-10-22 11:26:11,077 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:11,078 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/sv-benchmarks/c/ssh-simplified/s3_srvr_2.cil-2.c [2019-10-22 11:26:11,086 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/data/d0cddac2b/1c4560fe5bf74e1c9ae85cbc37dda612/FLAG359ea9b63 [2019-10-22 11:26:11,099 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/data/d0cddac2b/1c4560fe5bf74e1c9ae85cbc37dda612 [2019-10-22 11:26:11,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:11,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:11,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:11,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:11,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:11,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@260e0eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11, skipping insertion in model container [2019-10-22 11:26:11,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,121 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:11,163 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:11,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:11,430 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:11,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:11,506 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:11,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11 WrapperNode [2019-10-22 11:26:11,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:11,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:11,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:11,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:11,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:11,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:11,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:11,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:11,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... [2019-10-22 11:26:11,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:11,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:11,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:11,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:11,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/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-10-22 11:26:11,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:11,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:11,880 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:26:12,446 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 11:26:12,447 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 11:26:12,448 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:12,448 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:26:12,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:12 BoogieIcfgContainer [2019-10-22 11:26:12,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:12,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:12,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:12,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:12,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:11" (1/3) ... [2019-10-22 11:26:12,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0ff608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:12, skipping insertion in model container [2019-10-22 11:26:12,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:11" (2/3) ... [2019-10-22 11:26:12,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0ff608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:12, skipping insertion in model container [2019-10-22 11:26:12,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:12" (3/3) ... [2019-10-22 11:26:12,456 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-2.c [2019-10-22 11:26:12,465 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:12,472 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:26:12,482 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:26:12,500 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:12,500 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:12,501 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:12,501 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:12,501 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:12,501 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:12,501 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:12,501 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-10-22 11:26:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:26:12,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:12,522 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:12,523 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:12,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash -91605785, now seen corresponding path program 1 times [2019-10-22 11:26:12,536 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:12,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845371681] [2019-10-22 11:26:12,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:12,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:12,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845371681] [2019-10-22 11:26:12,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:12,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:12,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006308111] [2019-10-22 11:26:12,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:12,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:12,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:12,742 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-10-22 11:26:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:12,994 INFO L93 Difference]: Finished difference Result 327 states and 563 transitions. [2019-10-22 11:26:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:12,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-22 11:26:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,009 INFO L225 Difference]: With dead ends: 327 [2019-10-22 11:26:13,009 INFO L226 Difference]: Without dead ends: 174 [2019-10-22 11:26:13,015 INFO L600 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-10-22 11:26:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-22 11:26:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2019-10-22 11:26:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-22 11:26:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 274 transitions. [2019-10-22 11:26:13,074 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 274 transitions. Word has length 43 [2019-10-22 11:26:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,075 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 274 transitions. [2019-10-22 11:26:13,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 274 transitions. [2019-10-22 11:26:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:26:13,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,079 INFO L380 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-10-22 11:26:13,080 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:13,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1448033262, now seen corresponding path program 1 times [2019-10-22 11:26:13,080 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185111606] [2019-10-22 11:26:13,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:13,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185111606] [2019-10-22 11:26:13,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:13,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905900558] [2019-10-22 11:26:13,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:13,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:13,170 INFO L87 Difference]: Start difference. First operand 169 states and 274 transitions. Second operand 3 states. [2019-10-22 11:26:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,355 INFO L93 Difference]: Finished difference Result 379 states and 623 transitions. [2019-10-22 11:26:13,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:13,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 11:26:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,357 INFO L225 Difference]: With dead ends: 379 [2019-10-22 11:26:13,358 INFO L226 Difference]: Without dead ends: 215 [2019-10-22 11:26:13,359 INFO L600 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-10-22 11:26:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-22 11:26:13,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-10-22 11:26:13,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-22 11:26:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 351 transitions. [2019-10-22 11:26:13,375 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 351 transitions. Word has length 44 [2019-10-22 11:26:13,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,376 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 351 transitions. [2019-10-22 11:26:13,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 351 transitions. [2019-10-22 11:26:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 11:26:13,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,382 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:13,382 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:13,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,382 INFO L82 PathProgramCache]: Analyzing trace with hash -442897790, now seen corresponding path program 1 times [2019-10-22 11:26:13,383 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186587810] [2019-10-22 11:26:13,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:13,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186587810] [2019-10-22 11:26:13,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:13,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223516088] [2019-10-22 11:26:13,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:13,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:13,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:13,470 INFO L87 Difference]: Start difference. First operand 210 states and 351 transitions. Second operand 3 states. [2019-10-22 11:26:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,649 INFO L93 Difference]: Finished difference Result 444 states and 749 transitions. [2019-10-22 11:26:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:13,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-22 11:26:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,652 INFO L225 Difference]: With dead ends: 444 [2019-10-22 11:26:13,652 INFO L226 Difference]: Without dead ends: 241 [2019-10-22 11:26:13,653 INFO L600 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-10-22 11:26:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-22 11:26:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-10-22 11:26:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-22 11:26:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-10-22 11:26:13,668 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 71 [2019-10-22 11:26:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,668 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-10-22 11:26:13,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-10-22 11:26:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 11:26:13,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,671 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:13,671 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:13,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2002519192, now seen corresponding path program 1 times [2019-10-22 11:26:13,672 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477797943] [2019-10-22 11:26:13,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,673 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:26:13,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477797943] [2019-10-22 11:26:13,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:13,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:13,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356780011] [2019-10-22 11:26:13,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:13,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:13,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:13,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:13,757 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-10-22 11:26:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:13,892 INFO L93 Difference]: Finished difference Result 492 states and 831 transitions. [2019-10-22 11:26:13,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:13,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 11:26:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:13,894 INFO L225 Difference]: With dead ends: 492 [2019-10-22 11:26:13,895 INFO L226 Difference]: Without dead ends: 258 [2019-10-22 11:26:13,896 INFO L600 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-10-22 11:26:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-22 11:26:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-22 11:26:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-22 11:26:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 430 transitions. [2019-10-22 11:26:13,913 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 430 transitions. Word has length 83 [2019-10-22 11:26:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:13,913 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 430 transitions. [2019-10-22 11:26:13,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 430 transitions. [2019-10-22 11:26:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 11:26:13,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:13,916 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:13,916 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1780613796, now seen corresponding path program 1 times [2019-10-22 11:26:13,917 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:13,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116307755] [2019-10-22 11:26:13,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,921 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:13,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:14,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116307755] [2019-10-22 11:26:14,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:14,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967087558] [2019-10-22 11:26:14,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:14,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:14,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:14,011 INFO L87 Difference]: Start difference. First operand 256 states and 430 transitions. Second operand 3 states. [2019-10-22 11:26:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,174 INFO L93 Difference]: Finished difference Result 551 states and 930 transitions. [2019-10-22 11:26:14,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:14,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 11:26:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,176 INFO L225 Difference]: With dead ends: 551 [2019-10-22 11:26:14,176 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 11:26:14,177 INFO L600 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-10-22 11:26:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 11:26:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-10-22 11:26:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-22 11:26:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 504 transitions. [2019-10-22 11:26:14,199 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 504 transitions. Word has length 83 [2019-10-22 11:26:14,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,205 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 504 transitions. [2019-10-22 11:26:14,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 504 transitions. [2019-10-22 11:26:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:26:14,207 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,207 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,209 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash -923139676, now seen corresponding path program 1 times [2019-10-22 11:26:14,209 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894667854] [2019-10-22 11:26:14,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,210 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:26:14,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894667854] [2019-10-22 11:26:14,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:14,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314727348] [2019-10-22 11:26:14,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:14,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:14,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:14,251 INFO L87 Difference]: Start difference. First operand 298 states and 504 transitions. Second operand 3 states. [2019-10-22 11:26:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,370 INFO L93 Difference]: Finished difference Result 591 states and 999 transitions. [2019-10-22 11:26:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:14,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 11:26:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,371 INFO L225 Difference]: With dead ends: 591 [2019-10-22 11:26:14,372 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 11:26:14,372 INFO L600 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-10-22 11:26:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 11:26:14,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-22 11:26:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-22 11:26:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 500 transitions. [2019-10-22 11:26:14,381 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 500 transitions. Word has length 84 [2019-10-22 11:26:14,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,381 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 500 transitions. [2019-10-22 11:26:14,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 500 transitions. [2019-10-22 11:26:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:26:14,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,383 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,383 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:14,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1119050571, now seen corresponding path program 1 times [2019-10-22 11:26:14,383 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593304207] [2019-10-22 11:26:14,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:14,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593304207] [2019-10-22 11:26:14,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:14,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220200219] [2019-10-22 11:26:14,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:14,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:14,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:14,432 INFO L87 Difference]: Start difference. First operand 298 states and 500 transitions. Second operand 3 states. [2019-10-22 11:26:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,576 INFO L93 Difference]: Finished difference Result 593 states and 994 transitions. [2019-10-22 11:26:14,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:14,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 11:26:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,578 INFO L225 Difference]: With dead ends: 593 [2019-10-22 11:26:14,578 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 11:26:14,578 INFO L600 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-10-22 11:26:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 11:26:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2019-10-22 11:26:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-10-22 11:26:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 495 transitions. [2019-10-22 11:26:14,587 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 495 transitions. Word has length 84 [2019-10-22 11:26:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,587 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 495 transitions. [2019-10-22 11:26:14,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 495 transitions. [2019-10-22 11:26:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-22 11:26:14,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,589 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,589 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1891855493, now seen corresponding path program 1 times [2019-10-22 11:26:14,589 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495719353] [2019-10-22 11:26:14,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-22 11:26:14,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495719353] [2019-10-22 11:26:14,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:14,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036922506] [2019-10-22 11:26:14,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:14,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:14,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:14,620 INFO L87 Difference]: Start difference. First operand 296 states and 495 transitions. Second operand 3 states. [2019-10-22 11:26:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,730 INFO L93 Difference]: Finished difference Result 594 states and 991 transitions. [2019-10-22 11:26:14,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:14,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-22 11:26:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,732 INFO L225 Difference]: With dead ends: 594 [2019-10-22 11:26:14,732 INFO L226 Difference]: Without dead ends: 305 [2019-10-22 11:26:14,733 INFO L600 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-10-22 11:26:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-22 11:26:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2019-10-22 11:26:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-22 11:26:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 501 transitions. [2019-10-22 11:26:14,743 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 501 transitions. Word has length 96 [2019-10-22 11:26:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,743 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 501 transitions. [2019-10-22 11:26:14,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 501 transitions. [2019-10-22 11:26:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 11:26:14,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,744 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,744 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1633491035, now seen corresponding path program 1 times [2019-10-22 11:26:14,745 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061101841] [2019-10-22 11:26:14,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,745 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:26:14,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061101841] [2019-10-22 11:26:14,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:14,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918688679] [2019-10-22 11:26:14,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:14,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:14,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:14,777 INFO L87 Difference]: Start difference. First operand 305 states and 501 transitions. Second operand 3 states. [2019-10-22 11:26:14,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:14,896 INFO L93 Difference]: Finished difference Result 634 states and 1044 transitions. [2019-10-22 11:26:14,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:14,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-22 11:26:14,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:14,898 INFO L225 Difference]: With dead ends: 634 [2019-10-22 11:26:14,898 INFO L226 Difference]: Without dead ends: 336 [2019-10-22 11:26:14,899 INFO L600 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-10-22 11:26:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-22 11:26:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-10-22 11:26:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-22 11:26:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 548 transitions. [2019-10-22 11:26:14,908 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 548 transitions. Word has length 97 [2019-10-22 11:26:14,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:14,908 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 548 transitions. [2019-10-22 11:26:14,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 548 transitions. [2019-10-22 11:26:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-22 11:26:14,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:14,909 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:14,909 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:14,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:14,910 INFO L82 PathProgramCache]: Analyzing trace with hash -839203641, now seen corresponding path program 1 times [2019-10-22 11:26:14,910 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:14,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558408376] [2019-10-22 11:26:14,910 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:14,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:26:14,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558408376] [2019-10-22 11:26:14,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:14,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:14,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239140571] [2019-10-22 11:26:14,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:14,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:14,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:14,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:14,940 INFO L87 Difference]: Start difference. First operand 334 states and 548 transitions. Second operand 3 states. [2019-10-22 11:26:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:15,075 INFO L93 Difference]: Finished difference Result 663 states and 1087 transitions. [2019-10-22 11:26:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:15,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-22 11:26:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:15,077 INFO L225 Difference]: With dead ends: 663 [2019-10-22 11:26:15,077 INFO L226 Difference]: Without dead ends: 336 [2019-10-22 11:26:15,078 INFO L600 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-10-22 11:26:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-22 11:26:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-10-22 11:26:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-22 11:26:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 544 transitions. [2019-10-22 11:26:15,086 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 544 transitions. Word has length 98 [2019-10-22 11:26:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:15,087 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 544 transitions. [2019-10-22 11:26:15,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 544 transitions. [2019-10-22 11:26:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 11:26:15,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:15,088 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:15,088 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:15,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2015586581, now seen corresponding path program 1 times [2019-10-22 11:26:15,089 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:15,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636663034] [2019-10-22 11:26:15,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:26:15,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636663034] [2019-10-22 11:26:15,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:15,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:15,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372434817] [2019-10-22 11:26:15,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:15,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:15,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:15,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:15,117 INFO L87 Difference]: Start difference. First operand 334 states and 544 transitions. Second operand 3 states. [2019-10-22 11:26:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:15,238 INFO L93 Difference]: Finished difference Result 696 states and 1137 transitions. [2019-10-22 11:26:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:15,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 11:26:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:15,240 INFO L225 Difference]: With dead ends: 696 [2019-10-22 11:26:15,240 INFO L226 Difference]: Without dead ends: 369 [2019-10-22 11:26:15,240 INFO L600 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-10-22 11:26:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-22 11:26:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-10-22 11:26:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-22 11:26:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 586 transitions. [2019-10-22 11:26:15,251 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 586 transitions. Word has length 99 [2019-10-22 11:26:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:15,251 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 586 transitions. [2019-10-22 11:26:15,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 586 transitions. [2019-10-22 11:26:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 11:26:15,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:15,252 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:15,253 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash -598706249, now seen corresponding path program 1 times [2019-10-22 11:26:15,253 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:15,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816553145] [2019-10-22 11:26:15,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:26:15,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816553145] [2019-10-22 11:26:15,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:15,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:15,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229863633] [2019-10-22 11:26:15,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:15,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:15,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:15,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:15,283 INFO L87 Difference]: Start difference. First operand 361 states and 586 transitions. Second operand 3 states. [2019-10-22 11:26:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:15,410 INFO L93 Difference]: Finished difference Result 723 states and 1174 transitions. [2019-10-22 11:26:15,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:15,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 11:26:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:15,412 INFO L225 Difference]: With dead ends: 723 [2019-10-22 11:26:15,412 INFO L226 Difference]: Without dead ends: 369 [2019-10-22 11:26:15,412 INFO L600 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-10-22 11:26:15,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-22 11:26:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2019-10-22 11:26:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-10-22 11:26:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 581 transitions. [2019-10-22 11:26:15,423 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 581 transitions. Word has length 100 [2019-10-22 11:26:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:15,423 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 581 transitions. [2019-10-22 11:26:15,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 581 transitions. [2019-10-22 11:26:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 11:26:15,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:15,425 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:15,425 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:15,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731612, now seen corresponding path program 1 times [2019-10-22 11:26:15,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:15,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238799226] [2019-10-22 11:26:15,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:15,457 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 11:26:15,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238799226] [2019-10-22 11:26:15,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:15,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:15,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881322] [2019-10-22 11:26:15,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:15,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:15,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:15,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:15,461 INFO L87 Difference]: Start difference. First operand 361 states and 581 transitions. Second operand 3 states. [2019-10-22 11:26:15,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:15,571 INFO L93 Difference]: Finished difference Result 741 states and 1194 transitions. [2019-10-22 11:26:15,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:15,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 11:26:15,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:15,573 INFO L225 Difference]: With dead ends: 741 [2019-10-22 11:26:15,573 INFO L226 Difference]: Without dead ends: 387 [2019-10-22 11:26:15,573 INFO L600 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-10-22 11:26:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-10-22 11:26:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-10-22 11:26:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-22 11:26:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 610 transitions. [2019-10-22 11:26:15,586 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 610 transitions. Word has length 104 [2019-10-22 11:26:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:15,587 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 610 transitions. [2019-10-22 11:26:15,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 610 transitions. [2019-10-22 11:26:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 11:26:15,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:15,588 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:15,588 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:15,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1883634640, now seen corresponding path program 1 times [2019-10-22 11:26:15,589 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:15,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881476729] [2019-10-22 11:26:15,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 11:26:15,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881476729] [2019-10-22 11:26:15,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:15,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:15,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726885134] [2019-10-22 11:26:15,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:15,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:15,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:15,617 INFO L87 Difference]: Start difference. First operand 382 states and 610 transitions. Second operand 3 states. [2019-10-22 11:26:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:15,730 INFO L93 Difference]: Finished difference Result 762 states and 1217 transitions. [2019-10-22 11:26:15,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:15,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 11:26:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:15,732 INFO L225 Difference]: With dead ends: 762 [2019-10-22 11:26:15,732 INFO L226 Difference]: Without dead ends: 387 [2019-10-22 11:26:15,733 INFO L600 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-10-22 11:26:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-10-22 11:26:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2019-10-22 11:26:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-22 11:26:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 604 transitions. [2019-10-22 11:26:15,744 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 604 transitions. Word has length 105 [2019-10-22 11:26:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:15,744 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 604 transitions. [2019-10-22 11:26:15,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 604 transitions. [2019-10-22 11:26:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-22 11:26:15,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:15,746 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:15,746 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:15,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:15,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1006288068, now seen corresponding path program 1 times [2019-10-22 11:26:15,746 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:15,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138541472] [2019-10-22 11:26:15,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,746 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:15,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:26:15,838 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:26:15,839 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:26:15,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:26:15 BoogieIcfgContainer [2019-10-22 11:26:15,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:26:15,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:26:15,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:26:15,897 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:26:15,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:12" (3/4) ... [2019-10-22 11:26:15,900 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:26:16,004 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_10a2248f-cb1f-4933-9ff8-1641e5576810/bin/utaipan/witness.graphml [2019-10-22 11:26:16,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:26:16,006 INFO L168 Benchmark]: Toolchain (without parser) took 4902.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 945.9 MB in the beginning and 910.6 MB in the end (delta: 35.3 MB). Peak memory consumption was 223.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,006 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:16,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,006 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.45 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-10-22 11:26:16,007 INFO L168 Benchmark]: Boogie Preprocessor took 30.55 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,007 INFO L168 Benchmark]: RCFGBuilder took 864.46 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,007 INFO L168 Benchmark]: TraceAbstraction took 3446.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 925.1 MB in the end (delta: 140.1 MB). Peak memory consumption was 191.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,007 INFO L168 Benchmark]: Witness Printer took 107.20 ms. Allocated memory is still 1.2 GB. Free memory was 925.1 MB in the beginning and 910.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:16,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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -180.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.45 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. * Boogie Preprocessor took 30.55 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 864.46 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3446.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 925.1 MB in the end (delta: 140.1 MB). Peak memory consumption was 191.0 MB. Max. memory is 11.5 GB. * Witness Printer took 107.20 ms. Allocated memory is still 1.2 GB. Free memory was 925.1 MB in the beginning and 910.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 608]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L613] int s ; [L614] int tmp ; [L618] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L580] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L294] COND FALSE !(ret <= 0) [L297] COND TRUE \read(s__hit) [L298] s__state = 8656 [L302] s__init_num = 0 [L580] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND FALSE !(s__state == 8576) [L171] COND FALSE !(s__state == 8577) [L174] COND FALSE !(s__state == 8592) [L177] COND FALSE !(s__state == 8593) [L180] COND FALSE !(s__state == 8608) [L183] COND FALSE !(s__state == 8609) [L186] COND FALSE !(s__state == 8640) [L189] COND FALSE !(s__state == 8641) [L192] COND TRUE s__state == 8656 [L491] s__session__cipher = s__s3__tmp__new_cipher [L492] COND FALSE !(! tmp___9) [L496] ret = __VERIFIER_nondet_int() [L497] COND TRUE blastFlag == 2 [L498] blastFlag = 3 [L500] COND FALSE !(ret <= 0) [L503] s__state = 8672 [L504] s__init_num = 0 [L505] COND FALSE !(! tmp___10) [L580] COND FALSE !(! s__s3__tmp__reuse_message) [L597] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND FALSE !(s__state == 8560) [L162] COND FALSE !(s__state == 8561) [L165] COND FALSE !(s__state == 8448) [L168] COND FALSE !(s__state == 8576) [L171] COND FALSE !(s__state == 8577) [L174] COND FALSE !(s__state == 8592) [L177] COND FALSE !(s__state == 8593) [L180] COND FALSE !(s__state == 8608) [L183] COND FALSE !(s__state == 8609) [L186] COND FALSE !(s__state == 8640) [L189] COND FALSE !(s__state == 8641) [L192] COND FALSE !(s__state == 8656) [L195] COND FALSE !(s__state == 8657) [L198] COND TRUE s__state == 8672 [L512] ret = __VERIFIER_nondet_int() [L513] COND TRUE blastFlag == 3 [L608] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.3s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1821 SDtfs, 2038 SDslu, 234 SDs, 0 SdLazy, 1321 SolverSat, 599 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1177 ConstructedInterpolants, 0 QuantifiedInterpolants, 188237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 636/636 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...