./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.25-f470102 [2019-11-28 15:38:30,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:30,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:30,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:30,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:30,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:30,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:30,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:30,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:30,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:30,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:30,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:30,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:30,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:30,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:30,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:30,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:30,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:30,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:30,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:30,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:30,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:30,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:30,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:30,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:30,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:30,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:30,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:30,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:30,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:30,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:30,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:30,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:30,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:30,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:30,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:30,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:30,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:30,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:30,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:30,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:30,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:38:30,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:30,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:30,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:30,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:30,689 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:30,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:30,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:30,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:38:30,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:30,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:30,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:30,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:30,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:30,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:30,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:30,692 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:30,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:30,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:30,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:30,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:30,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:30,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:30,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:30,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:30,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:30,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:38:30,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:38:30,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:30,695 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:30,695 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-28 15:38:30,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:30,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:31,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:31,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:31,005 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:31,006 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-28 15:38:31,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9675160/b0f3526ab429424eafb3542cabed9979/FLAG28189fe0f [2019-11-28 15:38:31,558 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:31,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2019-11-28 15:38:31,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9675160/b0f3526ab429424eafb3542cabed9979/FLAG28189fe0f [2019-11-28 15:38:31,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9675160/b0f3526ab429424eafb3542cabed9979 [2019-11-28 15:38:31,924 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:31,926 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:31,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:31,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:31,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:31,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:31" (1/1) ... [2019-11-28 15:38:31,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f384efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:31, skipping insertion in model container [2019-11-28 15:38:31,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:31" (1/1) ... [2019-11-28 15:38:31,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:31,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:38:32,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:32,231 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:38:32,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:32,365 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:38:32,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32 WrapperNode [2019-11-28 15:38:32,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:32,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:32,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:38:32,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:38:32,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:32,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:38:32,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:38:32,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:38:32,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... [2019-11-28 15:38:32,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:38:32,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:38:32,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:38:32,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:38:32,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:38:32,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:38:32,710 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:38:33,225 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-28 15:38:33,225 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-28 15:38:33,227 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:38:33,227 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:38:33,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:33 BoogieIcfgContainer [2019-11-28 15:38:33,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:38:33,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:38:33,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:38:33,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:38:33,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:31" (1/3) ... [2019-11-28 15:38:33,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b54d1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:33, skipping insertion in model container [2019-11-28 15:38:33,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:32" (2/3) ... [2019-11-28 15:38:33,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b54d1ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:33, skipping insertion in model container [2019-11-28 15:38:33,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:33" (3/3) ... [2019-11-28 15:38:33,238 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2019-11-28 15:38:33,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:38:33,259 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:38:33,272 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:38:33,313 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:38:33,314 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:38:33,315 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:38:33,315 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:38:33,315 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:38:33,315 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:38:33,315 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:38:33,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:38:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-28 15:38:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:38:33,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:33,352 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-28 15:38:33,353 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:33,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 511659491, now seen corresponding path program 1 times [2019-11-28 15:38:33,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:33,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747267502] [2019-11-28 15:38:33,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:33,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747267502] [2019-11-28 15:38:33,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:33,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:38:33,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130104985] [2019-11-28 15:38:33,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:33,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:33,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:33,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:33,587 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-28 15:38:33,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:33,797 INFO L93 Difference]: Finished difference Result 246 states and 422 transitions. [2019-11-28 15:38:33,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:33,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:38:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:33,814 INFO L225 Difference]: With dead ends: 246 [2019-11-28 15:38:33,814 INFO L226 Difference]: Without dead ends: 112 [2019-11-28 15:38:33,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-28 15:38:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-28 15:38:33,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 15:38:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2019-11-28 15:38:33,877 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 24 [2019-11-28 15:38:33,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:33,878 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2019-11-28 15:38:33,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2019-11-28 15:38:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:38:33,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:33,884 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-28 15:38:33,884 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:33,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1971493731, now seen corresponding path program 1 times [2019-11-28 15:38:33,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:33,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386736644] [2019-11-28 15:38:33,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:33,989 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-28 15:38:33,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386736644] [2019-11-28 15:38:33,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:33,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:33,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317103511] [2019-11-28 15:38:33,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:33,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:33,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:33,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:33,995 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 3 states. [2019-11-28 15:38:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:34,157 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-28 15:38:34,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:34,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 15:38:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:34,159 INFO L225 Difference]: With dead ends: 232 [2019-11-28 15:38:34,160 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 15:38:34,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 15:38:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-28 15:38:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 15:38:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2019-11-28 15:38:34,185 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 36 [2019-11-28 15:38:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:34,186 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2019-11-28 15:38:34,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2019-11-28 15:38:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 15:38:34,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:34,189 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-28 15:38:34,189 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash 441356492, now seen corresponding path program 1 times [2019-11-28 15:38:34,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:34,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729405474] [2019-11-28 15:38:34,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:34,327 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-28 15:38:34,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729405474] [2019-11-28 15:38:34,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:34,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:38:34,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099396859] [2019-11-28 15:38:34,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:34,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:38:34,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:34,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:34,334 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand 3 states. [2019-11-28 15:38:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:34,503 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-28 15:38:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:34,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 15:38:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:34,506 INFO L225 Difference]: With dead ends: 265 [2019-11-28 15:38:34,506 INFO L226 Difference]: Without dead ends: 148 [2019-11-28 15:38:34,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-28 15:38:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-28 15:38:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 15:38:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2019-11-28 15:38:34,518 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 50 [2019-11-28 15:38:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:34,519 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2019-11-28 15:38:34,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2019-11-28 15:38:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:38:34,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:34,522 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-28 15:38:34,522 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:34,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -394489400, now seen corresponding path program 1 times [2019-11-28 15:38:34,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:38:34,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565557955] [2019-11-28 15:38:34,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:38:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:34,739 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:38:34,740 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:38:34,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:38:34 BoogieIcfgContainer [2019-11-28 15:38:34,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:38:34,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:38:34,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:38:34,820 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:38:34,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:33" (3/4) ... [2019-11-28 15:38:34,825 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 15:38:34,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:38:34,828 INFO L168 Benchmark]: Toolchain (without parser) took 2901.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 952.3 MB in the beginning and 971.4 MB in the end (delta: -19.1 MB). Peak memory consumption was 133.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:34,830 INFO L168 Benchmark]: CDTParser took 0.79 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:34,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:34,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:34,833 INFO L168 Benchmark]: Boogie Preprocessor took 37.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:34,834 INFO L168 Benchmark]: RCFGBuilder took 765.70 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.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:34,840 INFO L168 Benchmark]: TraceAbstraction took 1588.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.4 MB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:34,841 INFO L168 Benchmark]: Witness Printer took 5.66 ms. Allocated memory is still 1.2 GB. Free memory is still 971.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:34,851 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.79 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 439.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.23 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 37.57 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 765.70 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.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1588.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.4 MB in the end (delta: 119.1 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.66 ms. Allocated memory is still 1.2 GB. Free memory is still 971.4 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.5s, 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.1s 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.25-f470102 [2019-11-28 15:38:36,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:38:36,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:38:36,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:38:36,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:38:36,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:38:36,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:38:36,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:38:36,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:38:36,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:38:36,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:38:36,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:38:36,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:38:36,828 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:38:36,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:38:36,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:38:36,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:38:36,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:38:36,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:38:36,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:38:36,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:38:36,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:38:36,852 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:38:36,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:38:36,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:38:36,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:38:36,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:38:36,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:38:36,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:38:36,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:38:36,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:38:36,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:38:36,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:38:36,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:38:36,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:38:36,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:38:36,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:38:36,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:38:36,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:38:36,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:38:36,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:38:36,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 15:38:36,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:38:36,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:38:36,896 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:38:36,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:38:36,897 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:38:36,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:38:36,899 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:38:36,899 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:38:36,900 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:38:36,900 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:38:36,900 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:38:36,900 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:38:36,900 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 15:38:36,901 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 15:38:36,901 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:38:36,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:38:36,901 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:38:36,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:38:36,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:38:36,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:38:36,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:38:36,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:38:36,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:36,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:38:36,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:38:36,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:38:36,908 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 15:38:36,908 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 15:38:36,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:38:36,909 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:38:36,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 15:38:36,910 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-28 15:38:37,236 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:38:37,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:38:37,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:38:37,259 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:38:37,260 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:38:37,260 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-28 15:38:37,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b612a1837/f6405bc75f3a4186bf572d5630a5286a/FLAG3ce8d4a97 [2019-11-28 15:38:37,846 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:38:37,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2019-11-28 15:38:37,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b612a1837/f6405bc75f3a4186bf572d5630a5286a/FLAG3ce8d4a97 [2019-11-28 15:38:38,191 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b612a1837/f6405bc75f3a4186bf572d5630a5286a [2019-11-28 15:38:38,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:38:38,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:38:38,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:38,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:38:38,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:38:38,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd755b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38, skipping insertion in model container [2019-11-28 15:38:38,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:38:38,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:38:38,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:38,491 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:38:38,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:38:38,638 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:38:38,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38 WrapperNode [2019-11-28 15:38:38,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:38:38,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:38,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:38:38,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:38:38,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:38:38,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:38:38,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:38:38,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:38:38,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... [2019-11-28 15:38:38,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:38:38,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:38:38,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:38:38,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:38:38,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:38:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:38:38,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:38:38,963 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:38:39,508 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-28 15:38:39,509 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-28 15:38:39,511 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:38:39,511 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:38:39,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:39 BoogieIcfgContainer [2019-11-28 15:38:39,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:38:39,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:38:39,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:38:39,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:38:39,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:38:38" (1/3) ... [2019-11-28 15:38:39,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1429ec6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:39, skipping insertion in model container [2019-11-28 15:38:39,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:38:38" (2/3) ... [2019-11-28 15:38:39,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1429ec6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:38:39, skipping insertion in model container [2019-11-28 15:38:39,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:39" (3/3) ... [2019-11-28 15:38:39,525 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2019-11-28 15:38:39,533 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:38:39,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:38:39,556 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:38:39,580 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:38:39,581 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:38:39,581 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:38:39,581 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:38:39,582 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:38:39,582 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:38:39,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:38:39,582 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:38:39,600 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-28 15:38:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:38:39,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:39,609 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-28 15:38:39,610 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:39,616 INFO L82 PathProgramCache]: Analyzing trace with hash 511659491, now seen corresponding path program 1 times [2019-11-28 15:38:39,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:39,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922414583] [2019-11-28 15:38:39,630 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-28 15:38:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:39,721 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:39,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:39,765 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:38:39,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922414583] [2019-11-28 15:38:39,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:39,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 15:38:39,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733568696] [2019-11-28 15:38:39,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:39,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:39,798 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-28 15:38:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:40,049 INFO L93 Difference]: Finished difference Result 246 states and 422 transitions. [2019-11-28 15:38:40,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:40,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:38:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:40,064 INFO L225 Difference]: With dead ends: 246 [2019-11-28 15:38:40,064 INFO L226 Difference]: Without dead ends: 112 [2019-11-28 15:38:40,069 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-28 15:38:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-28 15:38:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-28 15:38:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 15:38:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2019-11-28 15:38:40,117 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 24 [2019-11-28 15:38:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:40,118 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2019-11-28 15:38:40,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2019-11-28 15:38:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:38:40,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:40,123 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-28 15:38:40,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 15:38:40,328 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:40,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:40,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1971493731, now seen corresponding path program 1 times [2019-11-28 15:38:40,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:40,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668342629] [2019-11-28 15:38:40,332 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-28 15:38:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:40,417 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:40,424 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:40,447 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-28 15:38:40,447 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:40,455 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-28 15:38:40,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668342629] [2019-11-28 15:38:40,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:40,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:40,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182827061] [2019-11-28 15:38:40,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:40,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:40,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:40,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:40,460 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand 3 states. [2019-11-28 15:38:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:40,631 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-28 15:38:40,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:40,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 15:38:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:40,634 INFO L225 Difference]: With dead ends: 232 [2019-11-28 15:38:40,634 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 15:38:40,636 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-28 15:38:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 15:38:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-11-28 15:38:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 15:38:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 190 transitions. [2019-11-28 15:38:40,651 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 190 transitions. Word has length 36 [2019-11-28 15:38:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:40,651 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 190 transitions. [2019-11-28 15:38:40,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 190 transitions. [2019-11-28 15:38:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 15:38:40,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:40,658 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-28 15:38:40,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 15:38:40,883 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:40,884 INFO L82 PathProgramCache]: Analyzing trace with hash 441356492, now seen corresponding path program 1 times [2019-11-28 15:38:40,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:40,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334904636] [2019-11-28 15:38:40,885 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-28 15:38:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:40,964 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:40,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:40,988 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-28 15:38:40,988 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:41,000 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-28 15:38:41,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334904636] [2019-11-28 15:38:41,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:41,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:41,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579365723] [2019-11-28 15:38:41,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:41,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:41,013 INFO L87 Difference]: Start difference. First operand 127 states and 190 transitions. Second operand 3 states. [2019-11-28 15:38:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:41,181 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-28 15:38:41,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:41,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 15:38:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:41,184 INFO L225 Difference]: With dead ends: 265 [2019-11-28 15:38:41,184 INFO L226 Difference]: Without dead ends: 148 [2019-11-28 15:38:41,185 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-28 15:38:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-28 15:38:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2019-11-28 15:38:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 15:38:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 212 transitions. [2019-11-28 15:38:41,198 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 212 transitions. Word has length 50 [2019-11-28 15:38:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:41,199 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 212 transitions. [2019-11-28 15:38:41,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 212 transitions. [2019-11-28 15:38:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:38:41,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:41,202 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-28 15:38:41,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 15:38:41,424 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash -394489400, now seen corresponding path program 1 times [2019-11-28 15:38:41,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:41,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857190848] [2019-11-28 15:38:41,427 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-28 15:38:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:41,520 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:38:41,523 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:41,634 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-28 15:38:41,635 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:41,735 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-28 15:38:41,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857190848] [2019-11-28 15:38:41,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:41,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-28 15:38:41,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658160754] [2019-11-28 15:38:41,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:38:41,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:41,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:38:41,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:38:41,739 INFO L87 Difference]: Start difference. First operand 144 states and 212 transitions. Second operand 6 states. [2019-11-28 15:38:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:42,543 INFO L93 Difference]: Finished difference Result 513 states and 781 transitions. [2019-11-28 15:38:42,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 15:38:42,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-28 15:38:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:42,547 INFO L225 Difference]: With dead ends: 513 [2019-11-28 15:38:42,564 INFO L226 Difference]: Without dead ends: 378 [2019-11-28 15:38:42,566 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-28 15:38:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-28 15:38:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 366. [2019-11-28 15:38:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-11-28 15:38:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 540 transitions. [2019-11-28 15:38:42,615 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 540 transitions. Word has length 67 [2019-11-28 15:38:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:42,616 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 540 transitions. [2019-11-28 15:38:42,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:38:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 540 transitions. [2019-11-28 15:38:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:38:42,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:42,624 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-28 15:38:42,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 15:38:42,826 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:42,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2095039562, now seen corresponding path program 1 times [2019-11-28 15:38:42,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:42,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759463230] [2019-11-28 15:38:42,828 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-28 15:38:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:42,902 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:42,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:42,923 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-28 15:38:42,923 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:42,936 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-28 15:38:42,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759463230] [2019-11-28 15:38:42,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:42,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:42,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456555633] [2019-11-28 15:38:42,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:42,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:42,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:42,938 INFO L87 Difference]: Start difference. First operand 366 states and 540 transitions. Second operand 3 states. [2019-11-28 15:38:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:42,983 INFO L93 Difference]: Finished difference Result 874 states and 1297 transitions. [2019-11-28 15:38:42,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:42,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-28 15:38:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:42,988 INFO L225 Difference]: With dead ends: 874 [2019-11-28 15:38:42,989 INFO L226 Difference]: Without dead ends: 521 [2019-11-28 15:38:42,992 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-28 15:38:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-11-28 15:38:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2019-11-28 15:38:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-11-28 15:38:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 768 transitions. [2019-11-28 15:38:43,028 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 768 transitions. Word has length 67 [2019-11-28 15:38:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:43,031 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 768 transitions. [2019-11-28 15:38:43,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 768 transitions. [2019-11-28 15:38:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:38:43,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:43,040 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-28 15:38:43,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 15:38:43,252 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash -811886006, now seen corresponding path program 1 times [2019-11-28 15:38:43,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:43,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37985477] [2019-11-28 15:38:43,253 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-28 15:38:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:43,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:43,339 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:43,362 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-28 15:38:43,364 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:43,376 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-28 15:38:43,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37985477] [2019-11-28 15:38:43,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:43,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:43,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137470207] [2019-11-28 15:38:43,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:43,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:43,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:43,383 INFO L87 Difference]: Start difference. First operand 519 states and 768 transitions. Second operand 3 states. [2019-11-28 15:38:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:43,412 INFO L93 Difference]: Finished difference Result 523 states and 770 transitions. [2019-11-28 15:38:43,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:43,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-28 15:38:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:43,416 INFO L225 Difference]: With dead ends: 523 [2019-11-28 15:38:43,416 INFO L226 Difference]: Without dead ends: 366 [2019-11-28 15:38:43,417 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-28 15:38:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-28 15:38:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2019-11-28 15:38:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-11-28 15:38:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2019-11-28 15:38:43,431 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 67 [2019-11-28 15:38:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:43,432 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2019-11-28 15:38:43,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2019-11-28 15:38:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:38:43,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:43,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-28 15:38:43,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 15:38:43,654 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1677642956, now seen corresponding path program 1 times [2019-11-28 15:38:43,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:43,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053502415] [2019-11-28 15:38:43,656 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-28 15:38:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:43,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 15:38:43,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:43,812 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-28 15:38:43,813 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:43,889 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-28 15:38:43,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053502415] [2019-11-28 15:38:43,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:38:43,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-28 15:38:43,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766751910] [2019-11-28 15:38:43,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 15:38:43,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:43,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 15:38:43,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-28 15:38:43,894 INFO L87 Difference]: Start difference. First operand 364 states and 531 transitions. Second operand 11 states. [2019-11-28 15:38:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:45,083 INFO L93 Difference]: Finished difference Result 828 states and 1231 transitions. [2019-11-28 15:38:45,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 15:38:45,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-11-28 15:38:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:45,088 INFO L225 Difference]: With dead ends: 828 [2019-11-28 15:38:45,089 INFO L226 Difference]: Without dead ends: 672 [2019-11-28 15:38:45,090 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-28 15:38:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-11-28 15:38:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 423. [2019-11-28 15:38:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-11-28 15:38:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 600 transitions. [2019-11-28 15:38:45,109 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 600 transitions. Word has length 67 [2019-11-28 15:38:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:45,109 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 600 transitions. [2019-11-28 15:38:45,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 15:38:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 600 transitions. [2019-11-28 15:38:45,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:38:45,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:45,111 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-28 15:38:45,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 15:38:45,322 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash -602651212, now seen corresponding path program 1 times [2019-11-28 15:38:45,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:45,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334598663] [2019-11-28 15:38:45,325 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-28 15:38:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:45,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:45,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:45,427 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-28 15:38:45,427 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:45,437 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-28 15:38:45,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [334598663] [2019-11-28 15:38:45,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:45,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-28 15:38:45,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570086203] [2019-11-28 15:38:45,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:38:45,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:45,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:38:45,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:38:45,441 INFO L87 Difference]: Start difference. First operand 423 states and 600 transitions. Second operand 3 states. [2019-11-28 15:38:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:45,617 INFO L93 Difference]: Finished difference Result 881 states and 1266 transitions. [2019-11-28 15:38:45,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:38:45,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:38:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:45,620 INFO L225 Difference]: With dead ends: 881 [2019-11-28 15:38:45,621 INFO L226 Difference]: Without dead ends: 471 [2019-11-28 15:38:45,622 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-28 15:38:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-11-28 15:38:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 465. [2019-11-28 15:38:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-11-28 15:38:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 652 transitions. [2019-11-28 15:38:45,641 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 652 transitions. Word has length 84 [2019-11-28 15:38:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:45,641 INFO L462 AbstractCegarLoop]: Abstraction has 465 states and 652 transitions. [2019-11-28 15:38:45,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:38:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 652 transitions. [2019-11-28 15:38:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-28 15:38:45,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:45,643 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-28 15:38:45,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 15:38:45,865 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:45,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash -801029670, now seen corresponding path program 1 times [2019-11-28 15:38:45,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:45,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743288925] [2019-11-28 15:38:45,867 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-28 15:38:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:38:45,946 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:38:45,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:38:45,980 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-28 15:38:45,981 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 15:38:46,013 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-28 15:38:46,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743288925] [2019-11-28 15:38:46,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:38:46,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 15:38:46,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21940980] [2019-11-28 15:38:46,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:38:46,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 15:38:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:38:46,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:38:46,016 INFO L87 Difference]: Start difference. First operand 465 states and 652 transitions. Second operand 4 states. [2019-11-28 15:38:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:38:46,083 INFO L93 Difference]: Finished difference Result 1415 states and 1978 transitions. [2019-11-28 15:38:46,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:38:46,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-28 15:38:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:38:46,089 INFO L225 Difference]: With dead ends: 1415 [2019-11-28 15:38:46,089 INFO L226 Difference]: Without dead ends: 963 [2019-11-28 15:38:46,090 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-28 15:38:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-11-28 15:38:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-11-28 15:38:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-11-28 15:38:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1327 transitions. [2019-11-28 15:38:46,124 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1327 transitions. Word has length 103 [2019-11-28 15:38:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:38:46,124 INFO L462 AbstractCegarLoop]: Abstraction has 959 states and 1327 transitions. [2019-11-28 15:38:46,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:38:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1327 transitions. [2019-11-28 15:38:46,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-28 15:38:46,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:38:46,127 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-28 15:38:46,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 15:38:46,345 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:38:46,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:38:46,346 INFO L82 PathProgramCache]: Analyzing trace with hash -935043176, now seen corresponding path program 1 times [2019-11-28 15:38:46,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 15:38:46,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100147445] [2019-11-28 15:38:46,348 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-28 15:38:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:38:46,666 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-28 15:38:46,669 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:38:46,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 15:38:46,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:38:46 BoogieIcfgContainer [2019-11-28 15:38:46,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:38:46,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:38:46,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:38:46,961 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:38:46,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:38:39" (3/4) ... [2019-11-28 15:38:46,965 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:38:47,125 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:38:47,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:38:47,128 INFO L168 Benchmark]: Toolchain (without parser) took 8931.78 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -211.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:47,129 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:47,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:47,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:38:47,130 INFO L168 Benchmark]: Boogie Preprocessor took 35.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:47,130 INFO L168 Benchmark]: RCFGBuilder took 776.95 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:47,131 INFO L168 Benchmark]: TraceAbstraction took 7444.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:47,131 INFO L168 Benchmark]: Witness Printer took 165.02 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: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:38:47,135 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.13 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 441.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.51 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 35.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 776.95 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7444.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 148.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -117.3 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Witness Printer took 165.02 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: 17.4 MB). Peak memory consumption was 17.4 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.2s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 3.0s, 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.7s 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...