./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.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_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/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 2373f3a3f8dbd9f18e573cbc80f9fee8c78900dc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:22:37,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:38,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:38,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:38,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:38,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:38,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:38,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:38,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:38,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:38,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:38,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:38,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:38,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:38,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:38,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:38,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:38,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:38,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:38,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:38,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:38,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:38,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:38,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:38,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:38,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:38,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:38,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:38,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:38,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:38,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:38,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:38,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:38,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:38,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:38,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:38,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:38,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:38,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:38,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:38,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:38,054 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:38,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:38,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:38,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:38,072 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:38,072 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:38,072 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:38,072 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:38,072 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:38,072 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:38,073 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:38,073 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:38,073 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:38,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:38,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:38,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:38,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:38,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:38,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:38,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:38,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:38,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:38,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:38,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:38,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:38,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:38,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:38,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:38,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:38,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:38,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:38,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:38,079 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:38,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:38,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:38,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:38,080 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_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/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 -> 2373f3a3f8dbd9f18e573cbc80f9fee8c78900dc [2019-10-22 11:22:38,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:38,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:38,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:38,126 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:38,127 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:38,127 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-2.c [2019-10-22 11:22:38,176 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/data/3840c1027/baca124dc48644818821ba2018be1751/FLAG238a986e0 [2019-10-22 11:22:38,584 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:38,584 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-2.c [2019-10-22 11:22:38,606 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/data/3840c1027/baca124dc48644818821ba2018be1751/FLAG238a986e0 [2019-10-22 11:22:38,620 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/data/3840c1027/baca124dc48644818821ba2018be1751 [2019-10-22 11:22:38,622 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:38,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:38,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:38,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:38,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:38,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:38" (1/1) ... [2019-10-22 11:22:38,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4246f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:38, skipping insertion in model container [2019-10-22 11:22:38,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:38" (1/1) ... [2019-10-22 11:22:38,638 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:38,671 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:38,951 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:38,956 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:39,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:39,039 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:39,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39 WrapperNode [2019-10-22 11:22:39,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:39,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:39,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:39,040 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:39,048 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:22:39" (1/1) ... [2019-10-22 11:22:39,057 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:22:39" (1/1) ... [2019-10-22 11:22:39,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:39,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:39,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:39,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:39,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39" (1/1) ... [2019-10-22 11:22:39,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39" (1/1) ... [2019-10-22 11:22:39,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39" (1/1) ... [2019-10-22 11:22:39,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39" (1/1) ... [2019-10-22 11:22:39,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39" (1/1) ... [2019-10-22 11:22:39,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39" (1/1) ... [2019-10-22 11:22:39,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39" (1/1) ... [2019-10-22 11:22:39,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:39,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:39,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:39,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:39,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/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:22:39,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:39,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:39,360 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 11:22:39,925 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 11:22:39,926 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 11:22:39,930 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:39,930 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:22:39,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:39 BoogieIcfgContainer [2019-10-22 11:22:39,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:39,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:39,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:39,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:39,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:38" (1/3) ... [2019-10-22 11:22:39,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773f489c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:39, skipping insertion in model container [2019-10-22 11:22:39,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:39" (2/3) ... [2019-10-22 11:22:39,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773f489c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:39, skipping insertion in model container [2019-10-22 11:22:39,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:39" (3/3) ... [2019-10-22 11:22:39,939 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-2.c [2019-10-22 11:22:39,948 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:39,955 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:22:39,965 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:22:39,987 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:39,987 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:39,987 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:39,988 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:39,988 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:39,988 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:39,988 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:39,988 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-10-22 11:22:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:22:40,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:40,010 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] [2019-10-22 11:22:40,012 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:40,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-10-22 11:22:40,026 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:40,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530181156] [2019-10-22 11:22:40,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:40,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:40,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:40,202 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:22:40,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530181156] [2019-10-22 11:22:40,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:40,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:40,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93293778] [2019-10-22 11:22:40,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:40,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:40,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:40,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:40,228 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-10-22 11:22:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:40,428 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-10-22 11:22:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:40,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 11:22:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:40,442 INFO L225 Difference]: With dead ends: 251 [2019-10-22 11:22:40,442 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 11:22:40,445 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:22:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 11:22:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-10-22 11:22:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 11:22:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-10-22 11:22:40,492 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-10-22 11:22:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:40,492 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-10-22 11:22:40,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-10-22 11:22:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:22:40,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:40,494 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:40,494 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:40,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:40,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-10-22 11:22:40,495 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:40,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36121343] [2019-10-22 11:22:40,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:40,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:40,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:40,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36121343] [2019-10-22 11:22:40,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:40,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:40,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966434095] [2019-10-22 11:22:40,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:40,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:40,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:40,559 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-10-22 11:22:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:40,745 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-10-22 11:22:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:40,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:22:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:40,747 INFO L225 Difference]: With dead ends: 237 [2019-10-22 11:22:40,747 INFO L226 Difference]: Without dead ends: 132 [2019-10-22 11:22:40,748 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-22 11:22:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-10-22 11:22:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-22 11:22:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-10-22 11:22:40,766 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-10-22 11:22:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:40,767 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-10-22 11:22:40,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-10-22 11:22:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 11:22:40,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:40,768 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-22 11:22:40,769 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:40,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-10-22 11:22:40,769 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:40,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686382947] [2019-10-22 11:22:40,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:40,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:40,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:22:40,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686382947] [2019-10-22 11:22:40,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:40,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:40,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192138626] [2019-10-22 11:22:40,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:40,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:40,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:40,840 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-10-22 11:22:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:40,953 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-10-22 11:22:40,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:40,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 11:22:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:40,955 INFO L225 Difference]: With dead ends: 271 [2019-10-22 11:22:40,956 INFO L226 Difference]: Without dead ends: 151 [2019-10-22 11:22:40,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-22 11:22:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-10-22 11:22:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 11:22:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-10-22 11:22:40,971 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-10-22 11:22:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:40,972 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-10-22 11:22:40,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-10-22 11:22:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:22:40,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:40,974 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:40,974 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:40,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-10-22 11:22:40,975 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:40,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489679561] [2019-10-22 11:22:40,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:40,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:40,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 11:22:41,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489679561] [2019-10-22 11:22:41,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:41,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:41,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806013070] [2019-10-22 11:22:41,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:41,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:41,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:41,074 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-10-22 11:22:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:41,244 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-10-22 11:22:41,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:41,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 11:22:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:41,246 INFO L225 Difference]: With dead ends: 334 [2019-10-22 11:22:41,247 INFO L226 Difference]: Without dead ends: 196 [2019-10-22 11:22:41,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-22 11:22:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-10-22 11:22:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-22 11:22:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-10-22 11:22:41,264 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-10-22 11:22:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:41,265 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-10-22 11:22:41,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-10-22 11:22:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 11:22:41,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:41,267 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:41,267 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-10-22 11:22:41,268 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:41,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944288406] [2019-10-22 11:22:41,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:41,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:41,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 11:22:41,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944288406] [2019-10-22 11:22:41,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:41,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:41,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81354761] [2019-10-22 11:22:41,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:41,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:41,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:41,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:41,371 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-10-22 11:22:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:41,496 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-10-22 11:22:41,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:41,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 11:22:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:41,498 INFO L225 Difference]: With dead ends: 389 [2019-10-22 11:22:41,498 INFO L226 Difference]: Without dead ends: 211 [2019-10-22 11:22:41,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-22 11:22:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-10-22 11:22:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 11:22:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-10-22 11:22:41,520 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-10-22 11:22:41,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:41,520 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-10-22 11:22:41,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-10-22 11:22:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 11:22:41,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:41,526 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:41,527 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-10-22 11:22:41,527 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:41,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901150378] [2019-10-22 11:22:41,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:41,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:41,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 11:22:41,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901150378] [2019-10-22 11:22:41,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:41,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:41,600 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057120288] [2019-10-22 11:22:41,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:41,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:41,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:41,601 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-10-22 11:22:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:41,743 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-10-22 11:22:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:41,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 11:22:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:41,745 INFO L225 Difference]: With dead ends: 427 [2019-10-22 11:22:41,746 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 11:22:41,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 11:22:41,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-10-22 11:22:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-22 11:22:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-10-22 11:22:41,765 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-10-22 11:22:41,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:41,765 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-10-22 11:22:41,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-10-22 11:22:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 11:22:41,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:41,767 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:41,767 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-10-22 11:22:41,768 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:41,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486441008] [2019-10-22 11:22:41,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:41,769 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:41,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 11:22:41,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486441008] [2019-10-22 11:22:41,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:41,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:22:41,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451525636] [2019-10-22 11:22:41,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:41,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:41,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:41,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:41,856 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-10-22 11:22:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:41,923 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-10-22 11:22:41,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:41,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 11:22:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:41,927 INFO L225 Difference]: With dead ends: 661 [2019-10-22 11:22:41,927 INFO L226 Difference]: Without dead ends: 443 [2019-10-22 11:22:41,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-22 11:22:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-10-22 11:22:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-10-22 11:22:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-10-22 11:22:41,946 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-10-22 11:22:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:41,946 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-10-22 11:22:41,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-10-22 11:22:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 11:22:41,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:41,948 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:41,948 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:41,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-10-22 11:22:41,948 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:41,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510330553] [2019-10-22 11:22:41,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:41,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:41,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:22:42,098 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:22:42,099 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:22:42,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:42 BoogieIcfgContainer [2019-10-22 11:22:42,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:42,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:42,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:42,189 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:42,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:39" (3/4) ... [2019-10-22 11:22:42,192 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:22:42,317 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_98c27fd1-b6d6-4012-90ad-d12283f5c1eb/bin/utaipan/witness.graphml [2019-10-22 11:22:42,320 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:42,322 INFO L168 Benchmark]: Toolchain (without parser) took 3697.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -219.0 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:42,322 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:42,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:42,323 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.79 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:42,323 INFO L168 Benchmark]: Boogie Preprocessor took 55.64 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:42,323 INFO L168 Benchmark]: RCFGBuilder took 779.08 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: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:42,324 INFO L168 Benchmark]: TraceAbstraction took 2256.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -92.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:42,324 INFO L168 Benchmark]: Witness Printer took 131.01 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:42,325 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 414.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.79 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.64 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 779.08 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: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2256.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -92.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 131.01 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 574]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L579] int s ; [L583] s = 12292 [L13] int s__info_callback = __VERIFIER_nondet_int() ; [L14] int s__in_handshake = __VERIFIER_nondet_int() ; [L15] int s__state ; [L16] int s__new_session ; [L17] int s__server ; [L18] int s__version = __VERIFIER_nondet_int() ; [L19] int s__type ; [L20] int s__init_num ; [L21] int s__bbio = __VERIFIER_nondet_int() ; [L22] int s__wbio = __VERIFIER_nondet_int() ; [L23] int s__hit = __VERIFIER_nondet_int() ; [L24] int s__rwstate ; [L25] int s__init_buf___0 = __VERIFIER_nondet_int() ; [L26] int s__debug = __VERIFIER_nondet_int() ; [L27] int s__shutdown ; [L28] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L29] int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_connect = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int() ; [L33] int s__s3__change_cipher_spec ; [L34] int s__s3__flags = __VERIFIER_nondet_int() ; [L35] int s__s3__delay_buf_pop_ret ; [L36] int s__s3__tmp__cert_req = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_compression = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L41] int s__s3__tmp__next_state___0 ; [L42] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int() ; [L43] int s__session__cipher ; [L44] int s__session__compress_meth ; [L45] int buf ; [L46] unsigned long tmp ; [L47] unsigned long l ; [L48] int num1 = __VERIFIER_nondet_int() ; [L49] int cb ; [L50] int ret ; [L51] int new_state ; [L52] int state ; [L53] int skip ; [L54] int tmp___0 ; [L55] int tmp___1 = __VERIFIER_nondet_int() ; [L56] int tmp___2 = __VERIFIER_nondet_int() ; [L57] int tmp___3 = __VERIFIER_nondet_int() ; [L58] int tmp___4 = __VERIFIER_nondet_int() ; [L59] int tmp___5 = __VERIFIER_nondet_int() ; [L60] int tmp___6 = __VERIFIER_nondet_int() ; [L61] int tmp___7 = __VERIFIER_nondet_int() ; [L62] int tmp___8 = __VERIFIER_nondet_int() ; [L63] int tmp___9 = __VERIFIER_nondet_int() ; [L64] int blastFlag ; [L65] int __cil_tmp55 ; [L66] void *__cil_tmp56 ; [L67] unsigned long __cil_tmp57 ; [L68] unsigned long __cil_tmp58 = __VERIFIER_nondet_ulong() ; [L69] void *__cil_tmp59 ; [L70] unsigned long __cil_tmp60 ; [L71] unsigned long __cil_tmp61 ; [L72] unsigned long __cil_tmp62 ; [L73] unsigned long __cil_tmp63 ; [L74] unsigned long __cil_tmp64 ; [L75] long __cil_tmp65 = __VERIFIER_nondet_long() ; [L76] long __cil_tmp66 ; [L77] long __cil_tmp67 ; [L78] long __cil_tmp68 ; [L79] long __cil_tmp69 ; [L80] long __cil_tmp70 = __VERIFIER_nondet_long() ; [L81] long __cil_tmp71 ; [L82] long __cil_tmp72 ; [L83] long __cil_tmp73 ; [L84] long __cil_tmp74 ; [L88] s__state = initial_state [L89] blastFlag = 0 [L90] tmp = __VERIFIER_nondet_int() [L91] cb = 0 [L92] ret = -1 [L93] skip = 0 [L94] tmp___0 = 0 [L95] COND TRUE s__info_callback != 0 [L96] cb = s__info_callback [L102] s__in_handshake ++ [L103] COND FALSE !(tmp___1 + 12288) [L109] COND TRUE 1 [L111] state = s__state [L112] COND TRUE s__state == 12292 [L214] s__new_session = 1 [L215] s__state = 4096 [L216] s__ctx__stats__sess_connect_renegotiate ++ [L221] s__server = 0 [L222] COND TRUE cb != 0 [L226] __cil_tmp55 = s__version + 65280 [L227] COND FALSE !(__cil_tmp55 != 768) [L232] s__type = 4096 [L234] __cil_tmp56 = (void *)0 [L235] __cil_tmp57 = (unsigned long )__cil_tmp56 [L236] __cil_tmp58 = (unsigned long )s__init_buf___0 [L237] COND FALSE !(__cil_tmp58 == __cil_tmp57) [L255] COND FALSE !(! tmp___4) [L259] COND FALSE !(! tmp___5) [L263] s__state = 4368 [L264] s__ctx__stats__sess_connect ++ [L265] s__init_num = 0 [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND TRUE s__state == 4368 [L269] s__shutdown = 0 [L270] ret = __VERIFIER_nondet_int() [L271] COND TRUE blastFlag == 0 [L272] blastFlag = 1 [L274] COND FALSE !(ret <= 0) [L277] s__state = 4384 [L278] s__init_num = 0 [L280] __cil_tmp62 = (unsigned long )s__wbio [L281] __cil_tmp63 = (unsigned long )s__bbio [L282] COND TRUE __cil_tmp63 != __cil_tmp62 [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND FALSE !(s__state == 4368) [L130] COND FALSE !(s__state == 4369) [L133] COND TRUE s__state == 4384 [L289] ret = __VERIFIER_nondet_int() [L290] COND TRUE blastFlag == 1 [L291] blastFlag = 2 [L297] COND FALSE !(ret <= 0) [L300] COND FALSE !(\read(s__hit)) [L303] s__state = 4400 [L305] s__init_num = 0 [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND FALSE !(s__state == 4368) [L130] COND FALSE !(s__state == 4369) [L133] COND FALSE !(s__state == 4384) [L136] COND FALSE !(s__state == 4385) [L139] COND TRUE s__state == 4400 [L310] __cil_tmp64 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L311] COND FALSE !(__cil_tmp64 + 256UL) [L314] ret = __VERIFIER_nondet_int() [L315] COND TRUE blastFlag == 2 [L316] blastFlag = 3 [L318] COND FALSE !(ret <= 0) [L323] s__state = 4416 [L324] s__init_num = 0 [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND FALSE !(s__state == 4368) [L130] COND FALSE !(s__state == 4369) [L133] COND FALSE !(s__state == 4384) [L136] COND FALSE !(s__state == 4385) [L139] COND FALSE !(s__state == 4400) [L142] COND FALSE !(s__state == 4401) [L145] COND TRUE s__state == 4416 [L328] ret = __VERIFIER_nondet_int() [L329] COND TRUE blastFlag == 3 [L330] blastFlag = 4 [L332] COND FALSE !(ret <= 0) [L335] s__state = 4432 [L336] s__init_num = 0 [L337] COND FALSE !(! tmp___6) [L546] COND FALSE !(! s__s3__tmp__reuse_message) [L563] skip = 0 [L109] COND TRUE 1 [L111] state = s__state [L112] COND FALSE !(s__state == 12292) [L115] COND FALSE !(s__state == 16384) [L118] COND FALSE !(s__state == 4096) [L121] COND FALSE !(s__state == 20480) [L124] COND FALSE !(s__state == 4099) [L127] COND FALSE !(s__state == 4368) [L130] COND FALSE !(s__state == 4369) [L133] COND FALSE !(s__state == 4384) [L136] COND FALSE !(s__state == 4385) [L139] COND FALSE !(s__state == 4400) [L142] COND FALSE !(s__state == 4401) [L145] COND FALSE !(s__state == 4416) [L148] COND FALSE !(s__state == 4417) [L151] COND TRUE s__state == 4432 [L344] ret = __VERIFIER_nondet_int() [L345] COND TRUE blastFlag == 4 [L574] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1223 SDtfs, 255 SDslu, 651 SDs, 0 SdLazy, 617 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 47530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 316/316 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...