./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test28_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test28_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ab8dcad35597bc77a09246c20c802a7c0b3d86b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-aa41828 [2018-11-23 06:39:53,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:39:53,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:39:53,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:39:53,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:39:53,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:39:53,663 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:39:53,664 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:39:53,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:39:53,666 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:39:53,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:39:53,667 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:39:53,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:39:53,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:39:53,669 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:39:53,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:39:53,670 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:39:53,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:39:53,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:39:53,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:39:53,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:39:53,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:39:53,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:39:53,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:39:53,678 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:39:53,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:39:53,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:39:53,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:39:53,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:39:53,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:39:53,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:39:53,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:39:53,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:39:53,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:39:53,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:39:53,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:39:53,684 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 06:39:53,695 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:39:53,695 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:39:53,696 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:39:53,696 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:39:53,696 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:39:53,696 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:39:53,696 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:39:53,697 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:39:53,697 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:39:53,697 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:39:53,697 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:39:53,697 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:39:53,697 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:39:53,698 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:39:53,698 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:39:53,699 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:39:53,699 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:39:53,699 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:39:53,699 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:39:53,699 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:39:53,699 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:39:53,699 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:39:53,700 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:39:53,700 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:39:53,700 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:39:53,700 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:39:53,700 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:39:53,700 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:39:53,700 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:39:53,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:39:53,700 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:39:53,700 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:39:53,700 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:39:53,701 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:39:53,701 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:39:53,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:39:53,701 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 06:39:53,701 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ab8dcad35597bc77a09246c20c802a7c0b3d86b [2018-11-23 06:39:53,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:39:53,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:39:53,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:39:53,741 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:39:53,742 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:39:53,742 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test28_false-unreach-call_true-termination.c [2018-11-23 06:39:53,789 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/data/b8c94afdd/f022cb009da1447dbfae5a54495bf728/FLAGd0a712da6 [2018-11-23 06:39:54,125 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:39:54,126 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/sv-benchmarks/c/ldv-regression/test28_false-unreach-call_true-termination.c [2018-11-23 06:39:54,131 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/data/b8c94afdd/f022cb009da1447dbfae5a54495bf728/FLAGd0a712da6 [2018-11-23 06:39:54,553 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/data/b8c94afdd/f022cb009da1447dbfae5a54495bf728 [2018-11-23 06:39:54,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:39:54,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:39:54,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:39:54,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:39:54,560 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:39:54,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e873bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54, skipping insertion in model container [2018-11-23 06:39:54,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:39:54,585 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:39:54,704 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:39:54,712 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:39:54,723 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:39:54,734 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:39:54,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54 WrapperNode [2018-11-23 06:39:54,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:39:54,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:39:54,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:39:54,735 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:39:54,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:39:54,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:39:54,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:39:54,753 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:39:54,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... [2018-11-23 06:39:54,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:39:54,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:39:54,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:39:54,771 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:39:54,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:39:54,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:39:54,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:39:54,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:39:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:39:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:39:54,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:39:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:39:54,870 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:39:54,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:39:54,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:39:55,012 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:39:55,012 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:39:55,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:39:55 BoogieIcfgContainer [2018-11-23 06:39:55,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:39:55,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:39:55,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:39:55,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:39:55,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:39:54" (1/3) ... [2018-11-23 06:39:55,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afae1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:39:55, skipping insertion in model container [2018-11-23 06:39:55,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:39:54" (2/3) ... [2018-11-23 06:39:55,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2afae1b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:39:55, skipping insertion in model container [2018-11-23 06:39:55,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:39:55" (3/3) ... [2018-11-23 06:39:55,020 INFO L112 eAbstractionObserver]: Analyzing ICFG test28_false-unreach-call_true-termination.c [2018-11-23 06:39:55,027 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:39:55,032 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 06:39:55,043 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 06:39:55,071 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:39:55,071 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:39:55,071 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:39:55,071 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:39:55,071 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:39:55,072 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:39:55,072 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:39:55,072 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:39:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 06:39:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 06:39:55,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:55,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:39:55,088 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:39:55,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:55,092 INFO L82 PathProgramCache]: Analyzing trace with hash 668850033, now seen corresponding path program 1 times [2018-11-23 06:39:55,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:39:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:55,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:55,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:55,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:39:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:55,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:39:55,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 06:39:55,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:39:55,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 06:39:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 06:39:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:39:55,274 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-23 06:39:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:55,402 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 06:39:55,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 06:39:55,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 06:39:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:55,411 INFO L225 Difference]: With dead ends: 29 [2018-11-23 06:39:55,411 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 06:39:55,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-23 06:39:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 06:39:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 06:39:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 06:39:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 06:39:55,442 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2018-11-23 06:39:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:55,442 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 06:39:55,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 06:39:55,442 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 06:39:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 06:39:55,443 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:55,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:39:55,443 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:39:55,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:55,444 INFO L82 PathProgramCache]: Analyzing trace with hash 667002991, now seen corresponding path program 1 times [2018-11-23 06:39:55,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:39:55,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:55,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:55,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:55,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:39:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:39:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:39:55,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:39:55,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 06:39:55,486 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:39:55,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 06:39:55,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 06:39:55,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 06:39:55,488 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-23 06:39:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:39:55,521 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-23 06:39:55,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 06:39:55,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 06:39:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:39:55,523 INFO L225 Difference]: With dead ends: 21 [2018-11-23 06:39:55,523 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 06:39:55,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 06:39:55,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 06:39:55,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 06:39:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 06:39:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-11-23 06:39:55,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2018-11-23 06:39:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:39:55,527 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-11-23 06:39:55,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 06:39:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-11-23 06:39:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 06:39:55,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:39:55,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:39:55,528 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 06:39:55,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:39:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1852956943, now seen corresponding path program 1 times [2018-11-23 06:39:55,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:39:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:55,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:39:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:39:55,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:39:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:39:55,565 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume !(0 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ite1.base|=10, |main_#t~ite1.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short3|=true, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem2|=12, |main_#t~short3|=true, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume #t~short3;havoc #t~mem2;havoc #t~short3; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume !false; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L12] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] assume !(0 != ~n~0); [L14] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=10, #t~ite1.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L14] havoc #t~ite1.base, #t~ite1.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L15-L19] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; [L16] call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] assume #t~short3; [L20] call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, #t~mem2=12, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20-L22] assume #t~short3; [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L26] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L12] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] assume !(0 != ~n~0); [L14] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=10, #t~ite1.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L14] havoc #t~ite1.base, #t~ite1.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L15-L19] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; [L16] call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] assume #t~short3; [L20] call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, #t~mem2=12, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20-L22] assume #t~short3; [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L26] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L12] struct dummy d1, d2; [L13] int n = __VERIFIER_nondet_int(); [L14] EXPR n ? &d1 : &d2 VAL [d1={11:0}, d2={10:0}, n=0, n ? &d1 : &d2={10:0}] [L14] struct dummy *pd = n ? &d1 : &d2; [L15] COND TRUE pd == &d2 [L16] pd->a = 0 VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] [L20] pd == &d2 && d2.b != 0 [L20] EXPR d2.b [L20] pd == &d2 && d2.b != 0 VAL [d1={11:0}, d2={10:0}, d2.b=12, n=0, pd={10:0}, pd == &d2 && d2.b != 0=1] [L20] COND TRUE pd == &d2 && d2.b != 0 [L26] __VERIFIER_error() VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] ----- [2018-11-23 06:39:55,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:39:55 BoogieIcfgContainer [2018-11-23 06:39:55,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:39:55,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:39:55,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:39:55,599 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:39:55,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:39:55" (3/4) ... [2018-11-23 06:39:55,602 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=13, |#NULL.offset|=9, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=13, |old(#NULL.offset)|=9] [?] RET #35#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret4 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume !(0 != ~n~0);#t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [main_~n~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ite1.base|=10, |main_#t~ite1.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset;havoc #t~ite1.base, #t~ite1.offset; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short3|=true, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume #t~short3;call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4);#t~short3 := 0 != #t~mem2; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem2|=12, |main_#t~short3|=true, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume #t~short3;havoc #t~mem2;havoc #t~short3; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] assume !false; VAL [main_~n~0=0, main_~pd~0.base=10, main_~pd~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#d1~0.base|=11, |main_~#d1~0.offset|=0, |main_~#d2~0.base|=10, |main_~#d2~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L12] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] assume !(0 != ~n~0); [L14] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=10, #t~ite1.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L14] havoc #t~ite1.base, #t~ite1.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L15-L19] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; [L16] call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] assume #t~short3; [L20] call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, #t~mem2=12, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20-L22] assume #t~short3; [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L26] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=13, #NULL.offset=9, old(#NULL.base)=13, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=13, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(8); [L12] call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] assume !(0 != ~n~0); [L14] #t~ite1.base, #t~ite1.offset := ~#d2~0.base, ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~ite1.base=10, #t~ite1.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0] [L14] ~pd~0.base, ~pd~0.offset := #t~ite1.base, #t~ite1.offset; [L14] havoc #t~ite1.base, #t~ite1.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L15-L19] assume ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; [L16] call write~int(0, ~pd~0.base, ~pd~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] #t~short3 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20] assume #t~short3; [L20] call #t~mem2 := read~int(~#d2~0.base, 4 + ~#d2~0.offset, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL.base=0, #NULL.offset=0, #t~mem2=12, #t~short3=true, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L20-L22] assume #t~short3; [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [L26] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#d1~0.base=11, ~#d1~0.offset=0, ~#d2~0.base=10, ~#d2~0.offset=0, ~n~0=0, ~pd~0.base=10, ~pd~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=13, #NULL!offset=9, old(#NULL!base)=13, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=13, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret4 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] FCALL call ~#d1~0 := #Ultimate.alloc(8); [L12] FCALL call ~#d2~0 := #Ultimate.alloc(8); [L13] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L13] ~n~0 := #t~nondet0; [L13] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] COND FALSE !(0 != ~n~0) [L14] #t~ite1 := ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~ite1!base=10, #t~ite1!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0] [L14] ~pd~0 := #t~ite1; [L14] havoc #t~ite1; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L15] COND TRUE ~pd~0 == ~#d2~0 [L16] FCALL call write~int(0, { base: ~pd~0!base, offset: ~pd~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] #t~short3 := ~pd~0 == ~#d2~0; VAL [#NULL!base=0, #NULL!offset=0, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] FCALL call #t~mem2 := read~int({ base: ~#d2~0!base, offset: 4 + ~#d2~0!offset }, 4); [L20] #t~short3 := 0 != #t~mem2; VAL [#NULL!base=0, #NULL!offset=0, #t~mem2=12, #t~short3=true, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L20] COND TRUE #t~short3 [L20] havoc #t~mem2; [L20] havoc #t~short3; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L26] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#d1~0!base=11, ~#d1~0!offset=0, ~#d2~0!base=10, ~#d2~0!offset=0, ~n~0=0, ~pd~0!base=10, ~pd~0!offset=0] [L12] struct dummy d1, d2; [L13] int n = __VERIFIER_nondet_int(); [L14] EXPR n ? &d1 : &d2 VAL [d1={11:0}, d2={10:0}, n=0, n ? &d1 : &d2={10:0}] [L14] struct dummy *pd = n ? &d1 : &d2; [L15] COND TRUE pd == &d2 [L16] pd->a = 0 VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] [L20] pd == &d2 && d2.b != 0 [L20] EXPR d2.b [L20] pd == &d2 && d2.b != 0 VAL [d1={11:0}, d2={10:0}, d2.b=12, n=0, pd={10:0}, pd == &d2 && d2.b != 0=1] [L20] COND TRUE pd == &d2 && d2.b != 0 [L26] __VERIFIER_error() VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] ----- [2018-11-23 06:39:55,655 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0b1341d3-eb30-46b8-8321-4f3455df1c12/bin-2019/utaipan/witness.graphml [2018-11-23 06:39:55,655 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:39:55,656 INFO L168 Benchmark]: Toolchain (without parser) took 1100.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -108.6 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,657 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:39:55,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.28 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.81 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,659 INFO L168 Benchmark]: Boogie Preprocessor took 17.49 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:39:55,659 INFO L168 Benchmark]: RCFGBuilder took 242.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,659 INFO L168 Benchmark]: TraceAbstraction took 585.33 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: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,660 INFO L168 Benchmark]: Witness Printer took 56.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:39:55,663 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.28 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.81 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.49 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 242.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 585.33 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: 53.3 MB). Peak memory consumption was 53.3 MB. Max. memory is 11.5 GB. * Witness Printer took 56.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 26]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] struct dummy d1, d2; [L13] int n = __VERIFIER_nondet_int(); [L14] EXPR n ? &d1 : &d2 VAL [d1={11:0}, d2={10:0}, n=0, n ? &d1 : &d2={10:0}] [L14] struct dummy *pd = n ? &d1 : &d2; [L15] COND TRUE pd == &d2 [L16] pd->a = 0 VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] [L20] pd == &d2 && d2.b != 0 [L20] EXPR d2.b [L20] pd == &d2 && d2.b != 0 VAL [d1={11:0}, d2={10:0}, d2.b=12, n=0, pd={10:0}, pd == &d2 && d2.b != 0=1] [L20] COND TRUE pd == &d2 && d2.b != 0 [L26] __VERIFIER_error() VAL [d1={11:0}, d2={10:0}, n=0, pd={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19 SDtfs, 31 SDslu, 66 SDs, 0 SdLazy, 58 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 516 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...