./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a482892abf67e79a3ae4664db384c404b0bcc555 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a482892abf67e79a3ae4664db384c404b0bcc555 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-30f4e4a [2019-11-27 22:34:01,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:01,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:01,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:01,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:01,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:01,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:01,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:01,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:01,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:01,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:01,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:01,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:01,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:01,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:01,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:01,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:01,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:01,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:01,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:01,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:01,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:01,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:01,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:01,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:01,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:01,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:01,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:01,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:01,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:01,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:01,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:01,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:01,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:01,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:01,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:01,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:01,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:01,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:01,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:01,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:01,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:34:01,507 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:01,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:01,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:01,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:01,510 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:01,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:01,511 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:01,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:34:01,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:01,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:01,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:01,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:01,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:01,513 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:01,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:01,513 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:01,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:01,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:01,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:01,514 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:01,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:01,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:01,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:01,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:01,516 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:01,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:34:01,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:34:01,517 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:01,517 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a482892abf67e79a3ae4664db384c404b0bcc555 [2019-11-27 22:34:01,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:01,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:01,833 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:01,834 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:01,835 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:01,836 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2019-11-27 22:34:01,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca035050b/b3382adaddae429a9bd38542645b54d7/FLAG8b8a51bbd [2019-11-27 22:34:02,429 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:02,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2019-11-27 22:34:02,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca035050b/b3382adaddae429a9bd38542645b54d7/FLAG8b8a51bbd [2019-11-27 22:34:02,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca035050b/b3382adaddae429a9bd38542645b54d7 [2019-11-27 22:34:02,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:02,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:02,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:02,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:02,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:02,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:02" (1/1) ... [2019-11-27 22:34:02,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7397f0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:02, skipping insertion in model container [2019-11-27 22:34:02,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:02" (1/1) ... [2019-11-27 22:34:02,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:02,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:03,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:03,121 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:03,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:03,252 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:03,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03 WrapperNode [2019-11-27 22:34:03,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:03,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:03,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:03,254 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:03,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:03,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:03,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:03,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:03,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... [2019-11-27 22:34:03,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:03,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:03,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:03,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:03,362 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:03,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:03,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:03,551 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:34:04,138 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-27 22:34:04,139 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-27 22:34:04,143 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:04,144 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:34:04,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:04 BoogieIcfgContainer [2019-11-27 22:34:04,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:04,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:04,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:04,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:04,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:02" (1/3) ... [2019-11-27 22:34:04,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c49899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:04, skipping insertion in model container [2019-11-27 22:34:04,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:03" (2/3) ... [2019-11-27 22:34:04,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c49899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:04, skipping insertion in model container [2019-11-27 22:34:04,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:04" (3/3) ... [2019-11-27 22:34:04,158 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2019-11-27 22:34:04,168 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:04,174 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:34:04,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:34:04,211 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:04,211 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:04,211 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:04,211 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:04,212 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:04,212 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:04,212 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:04,212 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-27 22:34:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:34:04,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:04,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:04,236 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:04,241 INFO L82 PathProgramCache]: Analyzing trace with hash 511659491, now seen corresponding path program 1 times [2019-11-27 22:34:04,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:04,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87380744] [2019-11-27 22:34:04,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:04,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:04,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87380744] [2019-11-27 22:34:04,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:04,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:34:04,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270139949] [2019-11-27 22:34:04,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:04,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:04,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:04,473 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-27 22:34:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:04,683 INFO L93 Difference]: Finished difference Result 246 states and 422 transitions. [2019-11-27 22:34:04,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:04,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 22:34:04,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:04,699 INFO L225 Difference]: With dead ends: 246 [2019-11-27 22:34:04,700 INFO L226 Difference]: Without dead ends: 112 [2019-11-27 22:34:04,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-27 22:34:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-27 22:34:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-27 22:34:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2019-11-27 22:34:04,753 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 24 [2019-11-27 22:34:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:04,753 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2019-11-27 22:34:04,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2019-11-27 22:34:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:34:04,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:04,756 INFO L410 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-11-27 22:34:04,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:04,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:04,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1971493731, now seen corresponding path program 1 times [2019-11-27 22:34:04,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:04,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736283670] [2019-11-27 22:34:04,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:04,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736283670] [2019-11-27 22:34:04,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:04,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:04,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552980975] [2019-11-27 22:34:04,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:04,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:04,893 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 3 states. [2019-11-27 22:34:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:05,096 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-27 22:34:05,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:05,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 22:34:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:05,100 INFO L225 Difference]: With dead ends: 232 [2019-11-27 22:34:05,100 INFO L226 Difference]: Without dead ends: 130 [2019-11-27 22:34:05,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-27 22:34:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-27 22:34:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 22:34:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2019-11-27 22:34:05,115 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 36 [2019-11-27 22:34:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:05,115 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2019-11-27 22:34:05,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2019-11-27 22:34:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 22:34:05,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:05,118 INFO L410 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-11-27 22:34:05,118 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:05,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:05,119 INFO L82 PathProgramCache]: Analyzing trace with hash 441356492, now seen corresponding path program 1 times [2019-11-27 22:34:05,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:05,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691936013] [2019-11-27 22:34:05,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:05,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691936013] [2019-11-27 22:34:05,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:05,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:05,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353225397] [2019-11-27 22:34:05,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:05,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:05,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:05,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:05,233 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand 3 states. [2019-11-27 22:34:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:05,407 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-27 22:34:05,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:05,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-27 22:34:05,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:05,410 INFO L225 Difference]: With dead ends: 265 [2019-11-27 22:34:05,410 INFO L226 Difference]: Without dead ends: 148 [2019-11-27 22:34:05,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:05,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-27 22:34:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-27 22:34:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 22:34:05,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2019-11-27 22:34:05,424 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 50 [2019-11-27 22:34:05,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:05,425 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2019-11-27 22:34:05,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2019-11-27 22:34:05,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:34:05,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:05,433 INFO L410 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-11-27 22:34:05,434 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash -394489400, now seen corresponding path program 1 times [2019-11-27 22:34:05,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:05,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142478375] [2019-11-27 22:34:05,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:05,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:34:05,688 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:34:05,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:05 BoogieIcfgContainer [2019-11-27 22:34:05,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:05,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:05,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:05,768 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:05,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:04" (3/4) ... [2019-11-27 22:34:05,773 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 22:34:05,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:05,776 INFO L168 Benchmark]: Toolchain (without parser) took 2975.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 957.7 MB in the beginning and 953.5 MB in the end (delta: 4.1 MB). Peak memory consumption was 141.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:05,778 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:05,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:05,780 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:05,782 INFO L168 Benchmark]: Boogie Preprocessor took 39.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:05,783 INFO L168 Benchmark]: RCFGBuilder took 785.65 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:05,789 INFO L168 Benchmark]: TraceAbstraction took 1619.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 953.5 MB in the end (delta: 120.5 MB). Peak memory consumption was 120.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:05,790 INFO L168 Benchmark]: Witness Printer took 5.83 ms. Allocated memory is still 1.2 GB. Free memory is still 953.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:05,800 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 451.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.57 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 39.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 785.65 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1619.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 953.5 MB in the end (delta: 120.5 MB). Peak memory consumption was 120.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.83 ms. Allocated memory is still 1.2 GB. Free memory is still 953.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 614]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 301. Possible FailurePath: [L623] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y ; [L63] int ag_Z ; [L64] int __retres60 ; [L67] s__state = 12292 [L68] blastFlag = 0 [L69] tmp = __VERIFIER_nondet_int() [L70] cb = 0 [L71] ret = -1 [L72] skip = 0 [L73] tmp___0 = 0 [L74] COND TRUE s__info_callback != 0 [L75] cb = s__info_callback [L83] s__in_handshake = s__in_handshake + 1 [L84] COND FALSE !(tmp___1 + 12288) [L93] COND TRUE \read(s__hit) [L94] ag_Y = 208 [L99] COND TRUE 1 [L101] state = s__state [L102] COND TRUE s__state == 12292 [L205] s__new_session = 1 [L206] s__state = 4096 [L207] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L212] s__server = 0 [L213] COND TRUE cb != 0 [L218] COND FALSE !(s__version + 65280 != 768) [L224] s__type = 4096 [L225] COND FALSE !((unsigned long )s__init_buf___0 == (unsigned long )((void *)0)) [L243] COND FALSE !(! tmp___4) [L249] COND FALSE !(! tmp___5) [L255] s__state = 4368 [L256] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L257] s__init_num = 0 [L572] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND TRUE s__state == 4368 [L261] s__shutdown = 0 [L262] ret = __VERIFIER_nondet_int() [L263] COND TRUE blastFlag == 0 [L264] blastFlag = 1 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] ag_X = s__state - 32 [L275] s__init_num = 0 [L276] COND TRUE (unsigned long )s__bbio != (unsigned long )s__wbio [L572] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND TRUE s__state == 4384 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L294] COND FALSE !(ret <= 0) [L299] s__state = ag_X [L300] COND TRUE \read(s__hit) [L301] s__state = s__state | ag_Y [L305] s__init_num = 0 [L572] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L351] ret = __VERIFIER_nondet_int() [L352] COND TRUE blastFlag <= 5 [L614] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: UNSAFE, OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 544 SDtfs, 37 SDslu, 265 SDs, 0 SdLazy, 283 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 6451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 19/19 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:34:07,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:07,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:07,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:07,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:07,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:07,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:07,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:07,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:07,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:07,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:07,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:07,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:07,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:07,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:07,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:07,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:07,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:07,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:07,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:07,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:07,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:07,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:07,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:07,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:07,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:07,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:07,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:07,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:07,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:07,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:07,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:07,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:07,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:07,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:07,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:07,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:07,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:07,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:07,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:07,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:07,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 22:34:07,693 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:07,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:07,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:07,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:07,696 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:07,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:07,696 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:07,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:07,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:07,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:07,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:07,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:07,699 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 22:34:07,699 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 22:34:07,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:07,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:07,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:07,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:07,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:07,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:07,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:07,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:07,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:07,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:07,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:07,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:07,703 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 22:34:07,703 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 22:34:07,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:07,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 22:34:07,704 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a482892abf67e79a3ae4664db384c404b0bcc555 [2019-11-27 22:34:08,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:08,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:08,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:08,033 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:08,034 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:08,035 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2019-11-27 22:34:08,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71542897c/64e704f3d6784d27ad1107c759ce1f71/FLAGcb9175d81 [2019-11-27 22:34:08,582 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:08,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2019-11-27 22:34:08,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71542897c/64e704f3d6784d27ad1107c759ce1f71/FLAGcb9175d81 [2019-11-27 22:34:08,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71542897c/64e704f3d6784d27ad1107c759ce1f71 [2019-11-27 22:34:08,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:08,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:08,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:08,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:08,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:08,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:08" (1/1) ... [2019-11-27 22:34:08,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f36619a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:08, skipping insertion in model container [2019-11-27 22:34:08,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:08" (1/1) ... [2019-11-27 22:34:08,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:08,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:09,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:09,290 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:09,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:09,424 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:09,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09 WrapperNode [2019-11-27 22:34:09,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:09,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:09,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:09,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:09,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... [2019-11-27 22:34:09,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... [2019-11-27 22:34:09,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:09,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:09,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:09,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:09,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... [2019-11-27 22:34:09,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... [2019-11-27 22:34:09,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... [2019-11-27 22:34:09,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... [2019-11-27 22:34:09,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... [2019-11-27 22:34:09,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... [2019-11-27 22:34:09,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... [2019-11-27 22:34:09,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:09,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:09,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:09,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:09,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:09,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:09,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:09,890 WARN L759 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-27 22:34:10,517 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-27 22:34:10,518 INFO L712 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-27 22:34:10,521 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:10,521 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:34:10,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:10 BoogieIcfgContainer [2019-11-27 22:34:10,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:10,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:10,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:10,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:10,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:08" (1/3) ... [2019-11-27 22:34:10,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1c99d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:10, skipping insertion in model container [2019-11-27 22:34:10,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:09" (2/3) ... [2019-11-27 22:34:10,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1c99d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:10, skipping insertion in model container [2019-11-27 22:34:10,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:10" (3/3) ... [2019-11-27 22:34:10,529 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2019-11-27 22:34:10,539 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:10,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:34:10,559 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:34:10,584 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:10,584 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:10,585 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:10,585 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:10,585 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:10,585 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:10,585 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:10,585 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-27 22:34:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:34:10,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:10,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:34:10,613 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash 511659491, now seen corresponding path program 1 times [2019-11-27 22:34:10,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:10,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772965857] [2019-11-27 22:34:10,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:10,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:10,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:10,777 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:10,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772965857] [2019-11-27 22:34:10,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:10,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 22:34:10,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775701034] [2019-11-27 22:34:10,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:10,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:10,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:10,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:10,809 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-27 22:34:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:11,063 INFO L93 Difference]: Finished difference Result 246 states and 422 transitions. [2019-11-27 22:34:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:11,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 22:34:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:11,085 INFO L225 Difference]: With dead ends: 246 [2019-11-27 22:34:11,085 INFO L226 Difference]: Without dead ends: 112 [2019-11-27 22:34:11,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-27 22:34:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-27 22:34:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-27 22:34:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2019-11-27 22:34:11,165 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 24 [2019-11-27 22:34:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:11,165 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2019-11-27 22:34:11,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:11,166 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2019-11-27 22:34:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:34:11,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:11,171 INFO L410 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-11-27 22:34:11,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 22:34:11,378 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:11,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1971493731, now seen corresponding path program 1 times [2019-11-27 22:34:11,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:11,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513095007] [2019-11-27 22:34:11,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:11,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:11,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:11,489 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:34:11,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513095007] [2019-11-27 22:34:11,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:11,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:11,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13233580] [2019-11-27 22:34:11,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:11,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:11,499 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 3 states. [2019-11-27 22:34:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:11,687 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-27 22:34:11,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:11,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-27 22:34:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:11,689 INFO L225 Difference]: With dead ends: 232 [2019-11-27 22:34:11,689 INFO L226 Difference]: Without dead ends: 130 [2019-11-27 22:34:11,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-27 22:34:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-27 22:34:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-27 22:34:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2019-11-27 22:34:11,707 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 36 [2019-11-27 22:34:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:11,708 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2019-11-27 22:34:11,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2019-11-27 22:34:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-27 22:34:11,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:11,712 INFO L410 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-11-27 22:34:11,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 22:34:11,935 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash 441356492, now seen corresponding path program 1 times [2019-11-27 22:34:11,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:11,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277889740] [2019-11-27 22:34:11,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:12,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:12,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:12,044 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:12,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277889740] [2019-11-27 22:34:12,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:12,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:12,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878679775] [2019-11-27 22:34:12,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:12,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:12,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:12,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:12,054 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand 3 states. [2019-11-27 22:34:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:12,226 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-27 22:34:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:12,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-27 22:34:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:12,229 INFO L225 Difference]: With dead ends: 265 [2019-11-27 22:34:12,229 INFO L226 Difference]: Without dead ends: 148 [2019-11-27 22:34:12,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-27 22:34:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-27 22:34:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-27 22:34:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2019-11-27 22:34:12,242 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 50 [2019-11-27 22:34:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:12,242 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2019-11-27 22:34:12,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2019-11-27 22:34:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:34:12,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:12,249 INFO L410 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-11-27 22:34:12,450 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 22:34:12,450 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:12,451 INFO L82 PathProgramCache]: Analyzing trace with hash -394489400, now seen corresponding path program 1 times [2019-11-27 22:34:12,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:12,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722674204] [2019-11-27 22:34:12,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:12,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:34:12,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:12,623 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:12,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722674204] [2019-11-27 22:34:12,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:12,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-27 22:34:12,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752765473] [2019-11-27 22:34:12,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:12,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:12,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:12,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:12,757 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand 6 states. [2019-11-27 22:34:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:13,377 INFO L93 Difference]: Finished difference Result 513 states and 781 transitions. [2019-11-27 22:34:13,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 22:34:13,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-27 22:34:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:13,397 INFO L225 Difference]: With dead ends: 513 [2019-11-27 22:34:13,397 INFO L226 Difference]: Without dead ends: 378 [2019-11-27 22:34:13,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-27 22:34:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-27 22:34:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 366. [2019-11-27 22:34:13,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-27 22:34:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 540 transitions. [2019-11-27 22:34:13,449 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 540 transitions. Word has length 67 [2019-11-27 22:34:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:13,449 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 540 transitions. [2019-11-27 22:34:13,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 540 transitions. [2019-11-27 22:34:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:34:13,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:13,453 INFO L410 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-11-27 22:34:13,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 22:34:13,665 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:13,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2095039562, now seen corresponding path program 1 times [2019-11-27 22:34:13,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:13,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810590466] [2019-11-27 22:34:13,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:13,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:13,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:13,760 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:13,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810590466] [2019-11-27 22:34:13,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:13,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:13,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790755353] [2019-11-27 22:34:13,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:13,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:13,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:13,775 INFO L87 Difference]: Start difference. First operand 366 states and 540 transitions. Second operand 3 states. [2019-11-27 22:34:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:13,821 INFO L93 Difference]: Finished difference Result 874 states and 1297 transitions. [2019-11-27 22:34:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:13,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:34:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:13,826 INFO L225 Difference]: With dead ends: 874 [2019-11-27 22:34:13,827 INFO L226 Difference]: Without dead ends: 521 [2019-11-27 22:34:13,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-11-27 22:34:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2019-11-27 22:34:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-11-27 22:34:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 768 transitions. [2019-11-27 22:34:13,853 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 768 transitions. Word has length 67 [2019-11-27 22:34:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:13,853 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 768 transitions. [2019-11-27 22:34:13,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 768 transitions. [2019-11-27 22:34:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:34:13,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:13,856 INFO L410 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-11-27 22:34:14,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 22:34:14,069 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:14,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash -811886006, now seen corresponding path program 1 times [2019-11-27 22:34:14,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:14,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215321375] [2019-11-27 22:34:14,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:14,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:14,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:14,208 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-27 22:34:14,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215321375] [2019-11-27 22:34:14,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:14,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:14,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293901546] [2019-11-27 22:34:14,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:14,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:14,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:14,223 INFO L87 Difference]: Start difference. First operand 519 states and 768 transitions. Second operand 3 states. [2019-11-27 22:34:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:14,262 INFO L93 Difference]: Finished difference Result 523 states and 770 transitions. [2019-11-27 22:34:14,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:14,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-27 22:34:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:14,266 INFO L225 Difference]: With dead ends: 523 [2019-11-27 22:34:14,266 INFO L226 Difference]: Without dead ends: 366 [2019-11-27 22:34:14,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-27 22:34:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2019-11-27 22:34:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-27 22:34:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2019-11-27 22:34:14,284 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 67 [2019-11-27 22:34:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:14,285 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2019-11-27 22:34:14,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2019-11-27 22:34:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-27 22:34:14,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:14,287 INFO L410 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-11-27 22:34:14,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 22:34:14,502 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:14,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1677642956, now seen corresponding path program 1 times [2019-11-27 22:34:14,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:14,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165187554] [2019-11-27 22:34:14,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:14,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:34:14,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:14,629 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-27 22:34:14,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165187554] [2019-11-27 22:34:14,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:14,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-27 22:34:14,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338906406] [2019-11-27 22:34:14,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 22:34:14,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 22:34:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-27 22:34:14,694 INFO L87 Difference]: Start difference. First operand 364 states and 531 transitions. Second operand 11 states. [2019-11-27 22:34:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:16,236 INFO L93 Difference]: Finished difference Result 828 states and 1231 transitions. [2019-11-27 22:34:16,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 22:34:16,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-11-27 22:34:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:16,243 INFO L225 Difference]: With dead ends: 828 [2019-11-27 22:34:16,243 INFO L226 Difference]: Without dead ends: 672 [2019-11-27 22:34:16,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-11-27 22:34:16,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-11-27 22:34:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 423. [2019-11-27 22:34:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-11-27 22:34:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 600 transitions. [2019-11-27 22:34:16,267 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 600 transitions. Word has length 67 [2019-11-27 22:34:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:16,268 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 600 transitions. [2019-11-27 22:34:16,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 22:34:16,269 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 600 transitions. [2019-11-27 22:34:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-27 22:34:16,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:16,271 INFO L410 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-11-27 22:34:16,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 22:34:16,482 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:16,484 INFO L82 PathProgramCache]: Analyzing trace with hash -602651212, now seen corresponding path program 1 times [2019-11-27 22:34:16,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:16,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129814564] [2019-11-27 22:34:16,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:16,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:16,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:34:16,573 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-27 22:34:16,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129814564] [2019-11-27 22:34:16,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:16,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 22:34:16,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672132729] [2019-11-27 22:34:16,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:16,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:16,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:16,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:16,582 INFO L87 Difference]: Start difference. First operand 423 states and 600 transitions. Second operand 3 states. [2019-11-27 22:34:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:16,745 INFO L93 Difference]: Finished difference Result 881 states and 1266 transitions. [2019-11-27 22:34:16,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:16,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-27 22:34:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:16,749 INFO L225 Difference]: With dead ends: 881 [2019-11-27 22:34:16,749 INFO L226 Difference]: Without dead ends: 471 [2019-11-27 22:34:16,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:16,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-27 22:34:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 465. [2019-11-27 22:34:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-11-27 22:34:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 652 transitions. [2019-11-27 22:34:16,772 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 652 transitions. Word has length 84 [2019-11-27 22:34:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:16,772 INFO L462 AbstractCegarLoop]: Abstraction has 465 states and 652 transitions. [2019-11-27 22:34:16,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 652 transitions. [2019-11-27 22:34:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-27 22:34:16,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:16,774 INFO L410 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] [2019-11-27 22:34:16,983 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 22:34:16,984 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash -801029670, now seen corresponding path program 1 times [2019-11-27 22:34:16,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:16,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964190940] [2019-11-27 22:34:16,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:17,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:34:17,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:34:17,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 22:34:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-27 22:34:17,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964190940] [2019-11-27 22:34:17,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:17,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 22:34:17,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026108475] [2019-11-27 22:34:17,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:17,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 22:34:17,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:17,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:17,159 INFO L87 Difference]: Start difference. First operand 465 states and 652 transitions. Second operand 4 states. [2019-11-27 22:34:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:17,251 INFO L93 Difference]: Finished difference Result 1415 states and 1978 transitions. [2019-11-27 22:34:17,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:17,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-27 22:34:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:17,257 INFO L225 Difference]: With dead ends: 1415 [2019-11-27 22:34:17,257 INFO L226 Difference]: Without dead ends: 963 [2019-11-27 22:34:17,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:17,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-27 22:34:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-11-27 22:34:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-11-27 22:34:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1327 transitions. [2019-11-27 22:34:17,293 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1327 transitions. Word has length 103 [2019-11-27 22:34:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:17,294 INFO L462 AbstractCegarLoop]: Abstraction has 959 states and 1327 transitions. [2019-11-27 22:34:17,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1327 transitions. [2019-11-27 22:34:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-27 22:34:17,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:17,296 INFO L410 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] [2019-11-27 22:34:17,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 22:34:17,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:17,513 INFO L82 PathProgramCache]: Analyzing trace with hash -935043176, now seen corresponding path program 1 times [2019-11-27 22:34:17,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 22:34:17,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697309994] [2019-11-27 22:34:17,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 22:34:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:34:17,901 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-27 22:34:17,902 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:34:18,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 22:34:18,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:18 BoogieIcfgContainer [2019-11-27 22:34:18,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:18,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:18,216 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:18,216 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:18,217 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:10" (3/4) ... [2019-11-27 22:34:18,220 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:34:18,368 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:18,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:18,373 INFO L168 Benchmark]: Toolchain (without parser) took 9457.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 960.3 MB in the beginning and 1.2 GB in the end (delta: -256.3 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:18,373 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:18,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:18,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:18,375 INFO L168 Benchmark]: Boogie Preprocessor took 51.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:18,375 INFO L168 Benchmark]: RCFGBuilder took 982.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:18,375 INFO L168 Benchmark]: TraceAbstraction took 7691.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -178.4 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:18,376 INFO L168 Benchmark]: Witness Printer took 152.53 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:18,378 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 511.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 982.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7691.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -178.4 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Witness Printer took 152.53 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 614]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L623] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate ; [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y ; [L63] int ag_Z ; [L64] int __retres60 ; [L67] s__state = 12292 [L68] blastFlag = 0 [L69] tmp = __VERIFIER_nondet_int() [L70] cb = 0 [L71] ret = -1 [L72] skip = 0 [L73] tmp___0 = 0 [L74] COND TRUE s__info_callback != 0 [L75] cb = s__info_callback [L83] s__in_handshake = s__in_handshake + 1 [L84] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(\read(s__hit)) [L96] ag_Z = 48 [L99] COND TRUE 1 [L101] state = s__state [L102] COND TRUE s__state == 12292 [L205] s__new_session = 1 [L206] s__state = 4096 [L207] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L212] s__server = 0 [L213] COND TRUE cb != 0 [L218] COND FALSE !(s__version + 65280 != 768) [L224] s__type = 4096 [L225] COND FALSE !((unsigned long )s__init_buf___0 == (unsigned long )((void *)0)) [L243] COND FALSE !(! tmp___4) [L249] COND FALSE !(! tmp___5) [L255] s__state = 4368 [L256] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L257] s__init_num = 0 [L572] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND TRUE s__state == 4368 [L261] s__shutdown = 0 [L262] ret = __VERIFIER_nondet_int() [L263] COND TRUE blastFlag == 0 [L264] blastFlag = 1 [L268] COND FALSE !(ret <= 0) [L273] s__state = 4384 [L274] ag_X = s__state - 32 [L275] s__init_num = 0 [L276] COND TRUE (unsigned long )s__bbio != (unsigned long )s__wbio [L572] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND TRUE s__state == 4384 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L294] COND FALSE !(ret <= 0) [L299] s__state = ag_X [L300] COND FALSE !(\read(s__hit)) [L303] s__state = s__state | ag_Z [L305] s__init_num = 0 [L572] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND TRUE s__state == 4400 [L309] COND TRUE (unsigned long )s__s3__tmp__new_cipher__algorithms + 256UL [L310] skip = 1 [L324] s__state = 4416 [L325] s__init_num = 0 [L572] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND TRUE s__state == 4416 [L329] ret = __VERIFIER_nondet_int() [L330] COND FALSE !(blastFlag == 3) [L335] COND FALSE !(ret <= 0) [L340] s__state = 4432 [L341] s__init_num = 0 [L342] COND FALSE !(! tmp___6) [L572] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L351] ret = __VERIFIER_nondet_int() [L352] COND TRUE blastFlag <= 5 [L614] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 125 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.5s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1698 SDtfs, 1753 SDslu, 2509 SDs, 0 SdLazy, 1659 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1122 GetRequests, 1091 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=959occurred in iteration=9, 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, 9 MinimizatonAttempts, 282 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 668 NumberOfCodeBlocks, 668 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1112 ConstructedInterpolants, 59 QuantifiedInterpolants, 195008 SizeOfPredicates, 7 NumberOfNonLiveVariables, 988 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 695/796 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...