./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i --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_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer --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 534681b11e8e68e6058985d885b01f2cbfa43e5b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:43:30,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:43:30,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:43:30,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:43:30,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:43:30,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:43:30,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:43:30,362 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:43:30,363 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:43:30,363 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:43:30,364 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:43:30,364 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:43:30,365 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:43:30,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:43:30,366 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:43:30,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:43:30,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:43:30,368 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:43:30,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:43:30,370 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:43:30,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:43:30,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:43:30,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:43:30,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:43:30,373 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:43:30,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:43:30,374 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:43:30,375 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:43:30,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:43:30,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:43:30,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:43:30,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:43:30,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:43:30,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:43:30,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:43:30,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:43:30,378 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:43:30,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:43:30,388 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:43:30,388 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:43:30,389 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:43:30,389 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:43:30,389 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:43:30,389 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:43:30,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:43:30,390 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:43:30,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:43:30,390 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:43:30,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:43:30,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:43:30,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:43:30,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:43:30,391 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:43:30,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:43:30,391 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:43:30,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:43:30,391 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:43:30,391 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:43:30,391 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:43:30,392 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:43:30,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:43:30,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:43:30,392 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:43:30,392 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:43:30,392 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:43:30,392 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:43:30,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:43:30,393 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer 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 -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2018-11-23 03:43:30,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:43:30,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:43:30,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:43:30,430 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:43:30,430 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:43:30,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-23 03:43:30,465 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/data/0fdb51bf9/0851dae98e494b61bbf922833db71021/FLAG5c8046205 [2018-11-23 03:43:30,830 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:43:30,830 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-23 03:43:30,838 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/data/0fdb51bf9/0851dae98e494b61bbf922833db71021/FLAG5c8046205 [2018-11-23 03:43:31,228 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/data/0fdb51bf9/0851dae98e494b61bbf922833db71021 [2018-11-23 03:43:31,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:43:31,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:43:31,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:43:31,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:43:31,234 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:43:31,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e074917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31, skipping insertion in model container [2018-11-23 03:43:31,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:43:31,274 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:43:31,483 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:43:31,489 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:43:31,568 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:43:31,594 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:43:31,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31 WrapperNode [2018-11-23 03:43:31,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:43:31,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:43:31,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:43:31,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:43:31,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:43:31,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:43:31,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:43:31,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:43:31,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... [2018-11-23 03:43:31,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:43:31,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:43:31,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:43:31,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:43:31,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/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 03:43:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-11-23 03:43:31,679 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-11-23 03:43:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-11-23 03:43:31,679 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-11-23 03:43:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:43:31,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:43:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-11-23 03:43:31,680 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-11-23 03:43:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-11-23 03:43:31,680 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-11-23 03:43:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:43:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:43:31,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:43:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-11-23 03:43:31,680 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-11-23 03:43:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:43:31,680 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:43:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 03:43:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 03:43:31,680 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-11-23 03:43:31,681 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-11-23 03:43:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:43:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:43:31,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:43:32,066 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:43:32,066 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-11-23 03:43:32,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:43:32 BoogieIcfgContainer [2018-11-23 03:43:32,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:43:32,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:43:32,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:43:32,069 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:43:32,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:43:31" (1/3) ... [2018-11-23 03:43:32,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eff4311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:43:32, skipping insertion in model container [2018-11-23 03:43:32,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:43:31" (2/3) ... [2018-11-23 03:43:32,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eff4311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:43:32, skipping insertion in model container [2018-11-23 03:43:32,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:43:32" (3/3) ... [2018-11-23 03:43:32,071 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-11-23 03:43:32,076 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:43:32,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:43:32,090 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:43:32,109 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:43:32,110 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:43:32,110 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:43:32,110 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:43:32,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:43:32,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:43:32,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:43:32,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:43:32,110 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:43:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-11-23 03:43:32,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 03:43:32,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:43:32,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:43:32,127 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:43:32,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash 533567477, now seen corresponding path program 1 times [2018-11-23 03:43:32,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:32,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:32,218 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 03:43:32,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:43:32,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:43:32,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:43:32,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:43:32,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:43:32,237 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2018-11-23 03:43:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:32,263 INFO L93 Difference]: Finished difference Result 222 states and 373 transitions. [2018-11-23 03:43:32,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:43:32,264 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 03:43:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:43:32,271 INFO L225 Difference]: With dead ends: 222 [2018-11-23 03:43:32,271 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 03:43:32,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:43:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 03:43:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-23 03:43:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 03:43:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2018-11-23 03:43:32,304 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 13 [2018-11-23 03:43:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:43:32,305 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2018-11-23 03:43:32,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:43:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2018-11-23 03:43:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 03:43:32,305 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:43:32,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:43:32,306 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:43:32,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:32,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1718675266, now seen corresponding path program 1 times [2018-11-23 03:43:32,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:32,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:32,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:32,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:32,343 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 03:43:32,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:43:32,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:43:32,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:43:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:43:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:43:32,344 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 3 states. [2018-11-23 03:43:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:32,363 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2018-11-23 03:43:32,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:43:32,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 03:43:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:43:32,364 INFO L225 Difference]: With dead ends: 200 [2018-11-23 03:43:32,364 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 03:43:32,365 INFO L631 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 [2018-11-23 03:43:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 03:43:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-23 03:43:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 03:43:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2018-11-23 03:43:32,373 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 14 [2018-11-23 03:43:32,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:43:32,373 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2018-11-23 03:43:32,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:43:32,373 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2018-11-23 03:43:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 03:43:32,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:43:32,373 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:43:32,374 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:43:32,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:32,374 INFO L82 PathProgramCache]: Analyzing trace with hash -107362549, now seen corresponding path program 1 times [2018-11-23 03:43:32,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:32,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:32,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:32,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:43:32,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 03:43:32,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:43:32,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:43:32,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:43:32,437 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 6 states. [2018-11-23 03:43:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:32,575 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2018-11-23 03:43:32,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:43:32,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 03:43:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:43:32,577 INFO L225 Difference]: With dead ends: 151 [2018-11-23 03:43:32,577 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 03:43:32,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:43:32,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 03:43:32,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2018-11-23 03:43:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 03:43:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-11-23 03:43:32,588 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 20 [2018-11-23 03:43:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:43:32,589 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-11-23 03:43:32,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:43:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-11-23 03:43:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:43:32,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:43:32,589 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 03:43:32,590 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:43:32,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1290121333, now seen corresponding path program 1 times [2018-11-23 03:43:32,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:32,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:32,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:32,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 03:43:32,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:43:32,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:43:32,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:43:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:43:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:43:32,662 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 5 states. [2018-11-23 03:43:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:32,864 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2018-11-23 03:43:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:43:32,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 03:43:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:43:32,866 INFO L225 Difference]: With dead ends: 110 [2018-11-23 03:43:32,866 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 03:43:32,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:43:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 03:43:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-23 03:43:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 03:43:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-11-23 03:43:32,873 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 27 [2018-11-23 03:43:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:43:32,874 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-11-23 03:43:32,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:43:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-11-23 03:43:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:43:32,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:43:32,874 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 03:43:32,874 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:43:32,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1615537323, now seen corresponding path program 1 times [2018-11-23 03:43:32,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:32,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:32,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 03:43:32,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:43:32,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:43:32,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:43:32,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:43:32,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:43:32,929 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 5 states. [2018-11-23 03:43:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:33,035 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2018-11-23 03:43:33,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:43:33,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 03:43:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:43:33,036 INFO L225 Difference]: With dead ends: 109 [2018-11-23 03:43:33,036 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 03:43:33,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:43:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 03:43:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 03:43:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 03:43:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2018-11-23 03:43:33,045 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 27 [2018-11-23 03:43:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:43:33,046 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2018-11-23 03:43:33,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:43:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2018-11-23 03:43:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 03:43:33,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:43:33,047 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 03:43:33,047 INFO L423 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:43:33,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1872008122, now seen corresponding path program 1 times [2018-11-23 03:43:33,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:33,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:33,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:33,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:33,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:43:33,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:43:33,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 03:43:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:43:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:43:33,112 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 7 states. [2018-11-23 03:43:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:33,302 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2018-11-23 03:43:33,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:43:33,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 03:43:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:43:33,304 INFO L225 Difference]: With dead ends: 141 [2018-11-23 03:43:33,305 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 03:43:33,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:43:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 03:43:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2018-11-23 03:43:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 03:43:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2018-11-23 03:43:33,314 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 30 [2018-11-23 03:43:33,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:43:33,315 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-11-23 03:43:33,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 03:43:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2018-11-23 03:43:33,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 03:43:33,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:43:33,316 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 03:43:33,316 INFO L423 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:43:33,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1085071641, now seen corresponding path program 1 times [2018-11-23 03:43:33,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:33,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:33,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:33,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:33,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:43:33,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 03:43:33,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 03:43:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:43:33,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:43:33,379 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand 7 states. [2018-11-23 03:43:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:33,537 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2018-11-23 03:43:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:43:33,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 03:43:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:43:33,538 INFO L225 Difference]: With dead ends: 140 [2018-11-23 03:43:33,538 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 03:43:33,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:43:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 03:43:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-11-23 03:43:33,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 03:43:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2018-11-23 03:43:33,546 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2018-11-23 03:43:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:43:33,546 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2018-11-23 03:43:33,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 03:43:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-11-23 03:43:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 03:43:33,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:43:33,547 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 03:43:33,547 INFO L423 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:43:33,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:33,548 INFO L82 PathProgramCache]: Analyzing trace with hash 956444098, now seen corresponding path program 1 times [2018-11-23 03:43:33,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:33,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:33,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:33,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:33,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:43:33,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:43:33,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:43:33,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:43:33,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 03:43:33,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 03:43:33,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-23 03:43:33,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 03:43:33,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 03:43:33,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-23 03:43:33,867 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,870 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,873 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,878 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:32, output treesize:18 [2018-11-23 03:43:33,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 03:43:33,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 03:43:33,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 03:43:33,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 03:43:33,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:43:33,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 03:43:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:43:33,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:43:33,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2018-11-23 03:43:33,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 03:43:33,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:43:33,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:43:33,966 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 11 states. [2018-11-23 03:43:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:43:34,138 INFO L93 Difference]: Finished difference Result 241 states and 286 transitions. [2018-11-23 03:43:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:43:34,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-11-23 03:43:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:43:34,140 INFO L225 Difference]: With dead ends: 241 [2018-11-23 03:43:34,141 INFO L226 Difference]: Without dead ends: 151 [2018-11-23 03:43:34,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:43:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-23 03:43:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-11-23 03:43:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-23 03:43:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2018-11-23 03:43:34,151 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 33 [2018-11-23 03:43:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:43:34,151 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2018-11-23 03:43:34,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 03:43:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2018-11-23 03:43:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 03:43:34,152 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:43:34,152 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 03:43:34,152 INFO L423 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:43:34,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:43:34,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1584953832, now seen corresponding path program 1 times [2018-11-23 03:43:34,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:43:34,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:43:34,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:34,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:43:34,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:43:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:43:34,187 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=17, |#NULL.offset|=9, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] RET #429#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret44 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~data~0.base, ~data~0.offset := 0, 0; VAL [main_~data~0.base=0, main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [main_~data~0.base=0, main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet36|=1] [?] assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; VAL [main_~data~0.base=0, main_~data~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0] [?] assume !(~node~1.base == 0 && ~node~1.offset == 0); VAL [main_~data~0.base=0, main_~data~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0] [?] call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; VAL [main_~data~0.base=0, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] assume !(~item~0.base == 0 && ~item~0.offset == 0); VAL [main_~data~0.base=0, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; VAL [main_~data~0.base=10, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [main_~data~0.base=10, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0, |main_#t~nondet36|=0] [?] assume !(0 != #t~nondet36);havoc #t~nondet36; VAL [main_~data~0.base=10, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [main_~data~0.base=10, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] CALL call inspect_before(~data~0.base, ~data~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] goto; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0, |inspect_before_#t~mem25.base|=0, |inspect_before_#t~mem25.offset|=0] [?] assume !(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] goto; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0, |inspect_before_#t~mem26.base|=0, |inspect_before_#t~mem26.offset|=0] [?] assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0);havoc #t~mem26.base, #t~mem26.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] goto; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0, |inspect_before_#t~mem27.base|=14, |inspect_before_#t~mem27.offset|=0] [?] assume !(#t~mem27.base == 0 && #t~mem27.offset == 0);havoc #t~mem27.base, #t~mem27.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] goto; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~shape.base, ~shape.offset, 4);call #t~mem29.base, #t~mem29.offset := read~$Pointer$(#t~mem28.base, #t~mem28.offset, 4); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0, |inspect_before_#t~mem28.base|=14, |inspect_before_#t~mem28.offset|=0, |inspect_before_#t~mem29.base|=14, |inspect_before_#t~mem29.offset|=0] [?] assume !(#t~mem29.base == 0 && #t~mem29.offset == 0);havoc #t~mem29.base, #t~mem29.offset;havoc #t~mem28.base, #t~mem28.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] CALL call fail(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~data~0.base, ~data~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=0, ~data~0.offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet36=1, ~data~0.base=0, ~data~0.offset=0] [L628-L640] assume !!(0 != #t~nondet36); [L628] havoc #t~nondet36; [L629] call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8); [L629] ~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, ~data~0.base=0, ~data~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L630-L631] assume !(~node~1.base == 0 && ~node~1.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, ~data~0.base=0, ~data~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L632] call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4); [L633] havoc #t~nondet38; [L634] call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8); [L634] ~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=0, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L635-L636] assume !(~item~0.base == 0 && ~item~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=0, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L637] call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4); [L638] call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4); [L639] ~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, #t~nondet36=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L628-L640] assume !(0 != #t~nondet36); [L628] havoc #t~nondet36; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L641-L642] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L643] CALL call inspect_before(~data~0.base, ~data~0.offset); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0] [L602-L615] ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L604] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L605] call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem25.base=0, #t~mem25.offset=0, ~shape.base=10, ~shape.offset=0] [L605-L610] assume !(#t~mem25.base != 0 || #t~mem25.offset != 0); [L605] havoc #t~mem25.base, #t~mem25.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L611] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L612] call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem26.base=0, #t~mem26.offset=0, ~shape.base=10, ~shape.offset=0] [L612] assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0); [L612] havoc #t~mem26.base, #t~mem26.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L613] call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem27.base=14, #t~mem27.offset=0, ~shape.base=10, ~shape.offset=0] [L613] assume !(#t~mem27.base == 0 && #t~mem27.offset == 0); [L613] havoc #t~mem27.base, #t~mem27.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L614] call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); [L614] call #t~mem29.base, #t~mem29.offset := read~$Pointer$(#t~mem28.base, #t~mem28.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem28.base=14, #t~mem28.offset=0, #t~mem29.base=14, #t~mem29.offset=0, ~shape.base=10, ~shape.offset=0] [L614] assume !(#t~mem29.base == 0 && #t~mem29.offset == 0); [L614] havoc #t~mem29.base, #t~mem29.offset; [L614] havoc #t~mem28.base, #t~mem28.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L614] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~data~0.base, ~data~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=0, ~data~0.offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet36=1, ~data~0.base=0, ~data~0.offset=0] [L628-L640] assume !!(0 != #t~nondet36); [L628] havoc #t~nondet36; [L629] call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8); [L629] ~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, ~data~0.base=0, ~data~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L630-L631] assume !(~node~1.base == 0 && ~node~1.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, ~data~0.base=0, ~data~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L632] call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4); [L633] havoc #t~nondet38; [L634] call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8); [L634] ~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=0, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L635-L636] assume !(~item~0.base == 0 && ~item~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=0, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L637] call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4); [L638] call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4); [L639] ~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, #t~nondet36=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L628-L640] assume !(0 != #t~nondet36); [L628] havoc #t~nondet36; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L641-L642] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L643] CALL call inspect_before(~data~0.base, ~data~0.offset); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0] [L602-L615] ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L604] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L605] call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem25.base=0, #t~mem25.offset=0, ~shape.base=10, ~shape.offset=0] [L605-L610] assume !(#t~mem25.base != 0 || #t~mem25.offset != 0); [L605] havoc #t~mem25.base, #t~mem25.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L611] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L612] call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem26.base=0, #t~mem26.offset=0, ~shape.base=10, ~shape.offset=0] [L612] assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0); [L612] havoc #t~mem26.base, #t~mem26.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L613] call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem27.base=14, #t~mem27.offset=0, ~shape.base=10, ~shape.offset=0] [L613] assume !(#t~mem27.base == 0 && #t~mem27.offset == 0); [L613] havoc #t~mem27.base, #t~mem27.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L614] call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); [L614] call #t~mem29.base, #t~mem29.offset := read~$Pointer$(#t~mem28.base, #t~mem28.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem28.base=14, #t~mem28.offset=0, #t~mem29.base=14, #t~mem29.offset=0, ~shape.base=10, ~shape.offset=0] [L614] assume !(#t~mem29.base == 0 && #t~mem29.offset == 0); [L614] havoc #t~mem29.base, #t~mem29.offset; [L614] havoc #t~mem28.base, #t~mem28.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L614] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~data~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=0, ~data~0!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet36=1, ~data~0!base=0, ~data~0!offset=0] [L628-L640] COND FALSE !(!(0 != #t~nondet36)) [L628] havoc #t~nondet36; [L629] FCALL call #t~malloc37 := #Ultimate.alloc(8); [L629] ~node~1 := #t~malloc37; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L630] COND FALSE !(~node~1 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L632] FCALL call write~$Pointer$(~node~1, { base: ~node~1!base, offset: ~node~1!offset }, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] FCALL call write~int(#t~nondet38, { base: ~node~1!base, offset: 4 + ~node~1!offset }, 4); [L633] havoc #t~nondet38; [L634] FCALL call #t~malloc39 := #Ultimate.alloc(8); [L634] ~item~0 := #t~malloc39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L635] COND FALSE !(~item~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L637] FCALL call write~$Pointer$(~node~1, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L638] FCALL call write~$Pointer$(~data~0, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L639] ~data~0 := ~item~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, #t~nondet36=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628-L640] COND TRUE !(0 != #t~nondet36) [L628] havoc #t~nondet36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L641] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L643] CALL call inspect_before(~data~0); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0] [L602-L615] ~shape := #in~shape; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L604] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L605] FCALL call #t~mem25 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem25!base=0, #t~mem25!offset=0, ~shape!base=10, ~shape!offset=0] [L605-L610] COND TRUE !(#t~mem25 != { base: 0, offset: 0 }) [L605] havoc #t~mem25; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L611] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L612] FCALL call #t~mem26 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem26!base=0, #t~mem26!offset=0, ~shape!base=10, ~shape!offset=0] [L612] COND FALSE !(!(#t~mem26 == { base: 0, offset: 0 })) [L612] havoc #t~mem26; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L613] FCALL call #t~mem27 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem27!base=14, #t~mem27!offset=0, ~shape!base=10, ~shape!offset=0] [L613] COND FALSE !(#t~mem27 == { base: 0, offset: 0 }) [L613] havoc #t~mem27; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] FCALL call #t~mem28 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); [L614] FCALL call #t~mem29 := read~$Pointer$({ base: #t~mem28!base, offset: #t~mem28!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem28!base=14, #t~mem28!offset=0, #t~mem29!base=14, #t~mem29!offset=0, ~shape!base=10, ~shape!offset=0] [L614] COND TRUE !(#t~mem29 == { base: 0, offset: 0 }) [L614] havoc #t~mem29; [L614] havoc #t~mem28; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~data~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=0, ~data~0!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet36=1, ~data~0!base=0, ~data~0!offset=0] [L628-L640] COND FALSE !(!(0 != #t~nondet36)) [L628] havoc #t~nondet36; [L629] FCALL call #t~malloc37 := #Ultimate.alloc(8); [L629] ~node~1 := #t~malloc37; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L630] COND FALSE !(~node~1 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L632] FCALL call write~$Pointer$(~node~1, { base: ~node~1!base, offset: ~node~1!offset }, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] FCALL call write~int(#t~nondet38, { base: ~node~1!base, offset: 4 + ~node~1!offset }, 4); [L633] havoc #t~nondet38; [L634] FCALL call #t~malloc39 := #Ultimate.alloc(8); [L634] ~item~0 := #t~malloc39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L635] COND FALSE !(~item~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L637] FCALL call write~$Pointer$(~node~1, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L638] FCALL call write~$Pointer$(~data~0, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L639] ~data~0 := ~item~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, #t~nondet36=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628-L640] COND TRUE !(0 != #t~nondet36) [L628] havoc #t~nondet36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L641] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L643] CALL call inspect_before(~data~0); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0] [L602-L615] ~shape := #in~shape; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L604] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L605] FCALL call #t~mem25 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem25!base=0, #t~mem25!offset=0, ~shape!base=10, ~shape!offset=0] [L605-L610] COND TRUE !(#t~mem25 != { base: 0, offset: 0 }) [L605] havoc #t~mem25; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L611] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L612] FCALL call #t~mem26 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem26!base=0, #t~mem26!offset=0, ~shape!base=10, ~shape!offset=0] [L612] COND FALSE !(!(#t~mem26 == { base: 0, offset: 0 })) [L612] havoc #t~mem26; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L613] FCALL call #t~mem27 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem27!base=14, #t~mem27!offset=0, ~shape!base=10, ~shape!offset=0] [L613] COND FALSE !(#t~mem27 == { base: 0, offset: 0 }) [L613] havoc #t~mem27; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] FCALL call #t~mem28 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); [L614] FCALL call #t~mem29 := read~$Pointer$({ base: #t~mem28!base, offset: #t~mem28!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem28!base=14, #t~mem28!offset=0, #t~mem29!base=14, #t~mem29!offset=0, ~shape!base=10, ~shape!offset=0] [L614] COND TRUE !(#t~mem29 == { base: 0, offset: 0 }) [L614] havoc #t~mem29; [L614] havoc #t~mem28; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~data~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=0, ~data~0!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet36=1, ~data~0!base=0, ~data~0!offset=0] [L628-L640] COND FALSE !(!(0 != #t~nondet36)) [L628] havoc #t~nondet36; [L629] FCALL call #t~malloc37 := #Ultimate.alloc(8); [L629] ~node~1 := #t~malloc37; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L630] COND FALSE !(~node~1 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L632] FCALL call write~$Pointer$(~node~1, { base: ~node~1!base, offset: ~node~1!offset }, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] FCALL call write~int(#t~nondet38, { base: ~node~1!base, offset: 4 + ~node~1!offset }, 4); [L633] havoc #t~nondet38; [L634] FCALL call #t~malloc39 := #Ultimate.alloc(8); [L634] ~item~0 := #t~malloc39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L635] COND FALSE !(~item~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L637] FCALL call write~$Pointer$(~node~1, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L638] FCALL call write~$Pointer$(~data~0, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L639] ~data~0 := ~item~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, #t~nondet36=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628-L640] COND TRUE !(0 != #t~nondet36) [L628] havoc #t~nondet36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L641] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L643] CALL call inspect_before(~data~0); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0] [L602-L615] ~shape := #in~shape; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L604] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L605] FCALL call #t~mem25 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem25!base=0, #t~mem25!offset=0, ~shape!base=10, ~shape!offset=0] [L605-L610] COND TRUE !(#t~mem25 != { base: 0, offset: 0 }) [L605] havoc #t~mem25; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L611] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L612] FCALL call #t~mem26 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem26!base=0, #t~mem26!offset=0, ~shape!base=10, ~shape!offset=0] [L612] COND FALSE !(!(#t~mem26 == { base: 0, offset: 0 })) [L612] havoc #t~mem26; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L613] FCALL call #t~mem27 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem27!base=14, #t~mem27!offset=0, ~shape!base=10, ~shape!offset=0] [L613] COND FALSE !(#t~mem27 == { base: 0, offset: 0 }) [L613] havoc #t~mem27; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] FCALL call #t~mem28 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); [L614] FCALL call #t~mem29 := read~$Pointer$({ base: #t~mem28!base, offset: #t~mem28!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem28!base=14, #t~mem28!offset=0, #t~mem29!base=14, #t~mem29!offset=0, ~shape!base=10, ~shape!offset=0] [L614] COND TRUE !(#t~mem29 == { base: 0, offset: 0 }) [L614] havoc #t~mem29; [L614] havoc #t~mem28; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~data~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=0, ~data~0!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet36=1, ~data~0!base=0, ~data~0!offset=0] [L628-L640] COND FALSE !(!(0 != #t~nondet36)) [L628] havoc #t~nondet36; [L629] FCALL call #t~malloc37 := #Ultimate.alloc(8); [L629] ~node~1 := #t~malloc37; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L630] COND FALSE !(~node~1 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L632] FCALL call write~$Pointer$(~node~1, { base: ~node~1!base, offset: ~node~1!offset }, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] FCALL call write~int(#t~nondet38, { base: ~node~1!base, offset: 4 + ~node~1!offset }, 4); [L633] havoc #t~nondet38; [L634] FCALL call #t~malloc39 := #Ultimate.alloc(8); [L634] ~item~0 := #t~malloc39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L635] COND FALSE !(~item~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L637] FCALL call write~$Pointer$(~node~1, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L638] FCALL call write~$Pointer$(~data~0, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L639] ~data~0 := ~item~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, #t~nondet36=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628-L640] COND TRUE !(0 != #t~nondet36) [L628] havoc #t~nondet36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L641] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L643] CALL call inspect_before(~data~0); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0] [L602-L615] ~shape := #in~shape; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L604] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L605] FCALL call #t~mem25 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem25!base=0, #t~mem25!offset=0, ~shape!base=10, ~shape!offset=0] [L605-L610] COND TRUE !(#t~mem25 != { base: 0, offset: 0 }) [L605] havoc #t~mem25; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L611] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L612] FCALL call #t~mem26 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem26!base=0, #t~mem26!offset=0, ~shape!base=10, ~shape!offset=0] [L612] COND FALSE !(!(#t~mem26 == { base: 0, offset: 0 })) [L612] havoc #t~mem26; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L613] FCALL call #t~mem27 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem27!base=14, #t~mem27!offset=0, ~shape!base=10, ~shape!offset=0] [L613] COND FALSE !(#t~mem27 == { base: 0, offset: 0 }) [L613] havoc #t~mem27; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] FCALL call #t~mem28 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); [L614] FCALL call #t~mem29 := read~$Pointer$({ base: #t~mem28!base, offset: #t~mem28!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem28!base=14, #t~mem28!offset=0, #t~mem29!base=14, #t~mem29!offset=0, ~shape!base=10, ~shape!offset=0] [L614] COND TRUE !(#t~mem29 == { base: 0, offset: 0 }) [L614] havoc #t~mem29; [L614] havoc #t~mem28; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L637] item->slist = node [L638] item->next = data [L639] data = item VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L643] CALL inspect_before(data) VAL [shape={10:0}] [L604] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L605] shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L612] EXPR shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}, shape->slist->next={14:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() ----- [2018-11-23 03:43:34,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:43:34 BoogieIcfgContainer [2018-11-23 03:43:34,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:43:34,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:43:34,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:43:34,236 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:43:34,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:43:32" (3/4) ... [2018-11-23 03:43:34,238 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|=17, |#NULL.offset|=9, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=17, |old(#NULL.offset)|=9] [?] RET #429#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret44 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~data~0.base, ~data~0.offset := 0, 0; VAL [main_~data~0.base=0, main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [main_~data~0.base=0, main_~data~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet36|=1] [?] assume !!(0 != #t~nondet36);havoc #t~nondet36;call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8);~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; VAL [main_~data~0.base=0, main_~data~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0] [?] assume !(~node~1.base == 0 && ~node~1.offset == 0); VAL [main_~data~0.base=0, main_~data~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0] [?] call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4);assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4);havoc #t~nondet38;call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8);~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; VAL [main_~data~0.base=0, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] assume !(~item~0.base == 0 && ~item~0.offset == 0); VAL [main_~data~0.base=0, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4);call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4);~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; VAL [main_~data~0.base=10, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [main_~data~0.base=10, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0, |main_#t~nondet36|=0] [?] assume !(0 != #t~nondet36);havoc #t~nondet36; VAL [main_~data~0.base=10, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [main_~data~0.base=10, main_~data~0.offset=0, main_~item~0.base=10, main_~item~0.offset=0, main_~node~1.base=14, main_~node~1.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~malloc37.base|=14, |main_#t~malloc37.offset|=0, |main_#t~malloc39.base|=10, |main_#t~malloc39.offset|=0] [?] CALL call inspect_before(~data~0.base, ~data~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] goto; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0, |inspect_before_#t~mem25.base|=0, |inspect_before_#t~mem25.offset|=0] [?] assume !(#t~mem25.base != 0 || #t~mem25.offset != 0);havoc #t~mem25.base, #t~mem25.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] goto; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0, |inspect_before_#t~mem26.base|=0, |inspect_before_#t~mem26.offset|=0] [?] assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0);havoc #t~mem26.base, #t~mem26.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] goto; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0, |inspect_before_#t~mem27.base|=14, |inspect_before_#t~mem27.offset|=0] [?] assume !(#t~mem27.base == 0 && #t~mem27.offset == 0);havoc #t~mem27.base, #t~mem27.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] goto; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~shape.base, ~shape.offset, 4);call #t~mem29.base, #t~mem29.offset := read~$Pointer$(#t~mem28.base, #t~mem28.offset, 4); VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0, |inspect_before_#t~mem28.base|=14, |inspect_before_#t~mem28.offset|=0, |inspect_before_#t~mem29.base|=14, |inspect_before_#t~mem29.offset|=0] [?] assume !(#t~mem29.base == 0 && #t~mem29.offset == 0);havoc #t~mem29.base, #t~mem29.offset;havoc #t~mem28.base, #t~mem28.offset; VAL [inspect_before_~shape.base=10, inspect_before_~shape.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |inspect_before_#in~shape.base|=10, |inspect_before_#in~shape.offset|=0] [?] CALL call fail(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~data~0.base, ~data~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=0, ~data~0.offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet36=1, ~data~0.base=0, ~data~0.offset=0] [L628-L640] assume !!(0 != #t~nondet36); [L628] havoc #t~nondet36; [L629] call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8); [L629] ~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, ~data~0.base=0, ~data~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L630-L631] assume !(~node~1.base == 0 && ~node~1.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, ~data~0.base=0, ~data~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L632] call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4); [L633] havoc #t~nondet38; [L634] call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8); [L634] ~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=0, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L635-L636] assume !(~item~0.base == 0 && ~item~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=0, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L637] call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4); [L638] call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4); [L639] ~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, #t~nondet36=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L628-L640] assume !(0 != #t~nondet36); [L628] havoc #t~nondet36; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L641-L642] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L643] CALL call inspect_before(~data~0.base, ~data~0.offset); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0] [L602-L615] ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L604] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L605] call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem25.base=0, #t~mem25.offset=0, ~shape.base=10, ~shape.offset=0] [L605-L610] assume !(#t~mem25.base != 0 || #t~mem25.offset != 0); [L605] havoc #t~mem25.base, #t~mem25.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L611] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L612] call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem26.base=0, #t~mem26.offset=0, ~shape.base=10, ~shape.offset=0] [L612] assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0); [L612] havoc #t~mem26.base, #t~mem26.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L613] call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem27.base=14, #t~mem27.offset=0, ~shape.base=10, ~shape.offset=0] [L613] assume !(#t~mem27.base == 0 && #t~mem27.offset == 0); [L613] havoc #t~mem27.base, #t~mem27.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L614] call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); [L614] call #t~mem29.base, #t~mem29.offset := read~$Pointer$(#t~mem28.base, #t~mem28.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem28.base=14, #t~mem28.offset=0, #t~mem29.base=14, #t~mem29.offset=0, ~shape.base=10, ~shape.offset=0] [L614] assume !(#t~mem29.base == 0 && #t~mem29.offset == 0); [L614] havoc #t~mem29.base, #t~mem29.offset; [L614] havoc #t~mem28.base, #t~mem28.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L614] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=17, #NULL.offset=9, old(#NULL.base)=17, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=17, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L627] ~data~0.base, ~data~0.offset := 0, 0; VAL [#NULL.base=0, #NULL.offset=0, ~data~0.base=0, ~data~0.offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet36=1, ~data~0.base=0, ~data~0.offset=0] [L628-L640] assume !!(0 != #t~nondet36); [L628] havoc #t~nondet36; [L629] call #t~malloc37.base, #t~malloc37.offset := #Ultimate.alloc(8); [L629] ~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, ~data~0.base=0, ~data~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L630-L631] assume !(~node~1.base == 0 && ~node~1.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, ~data~0.base=0, ~data~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L632] call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4); [L633] havoc #t~nondet38; [L634] call #t~malloc39.base, #t~malloc39.offset := #Ultimate.alloc(8); [L634] ~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=0, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L635-L636] assume !(~item~0.base == 0 && ~item~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=0, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L637] call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4); [L638] call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4); [L639] ~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, #t~nondet36=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L628-L640] assume !(0 != #t~nondet36); [L628] havoc #t~nondet36; VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L641-L642] assume !(~data~0.base == 0 && ~data~0.offset == 0); VAL [#NULL.base=0, #NULL.offset=0, #t~malloc37.base=14, #t~malloc37.offset=0, #t~malloc39.base=10, #t~malloc39.offset=0, ~data~0.base=10, ~data~0.offset=0, ~item~0.base=10, ~item~0.offset=0, ~node~1.base=14, ~node~1.offset=0] [L643] CALL call inspect_before(~data~0.base, ~data~0.offset); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0] [L602-L615] ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L604] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L605] call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem25.base=0, #t~mem25.offset=0, ~shape.base=10, ~shape.offset=0] [L605-L610] assume !(#t~mem25.base != 0 || #t~mem25.offset != 0); [L605] havoc #t~mem25.base, #t~mem25.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L611] assume !(~shape.base == 0 && ~shape.offset == 0); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L612] call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem26.base=0, #t~mem26.offset=0, ~shape.base=10, ~shape.offset=0] [L612] assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0); [L612] havoc #t~mem26.base, #t~mem26.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L613] call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem27.base=14, #t~mem27.offset=0, ~shape.base=10, ~shape.offset=0] [L613] assume !(#t~mem27.base == 0 && #t~mem27.offset == 0); [L613] havoc #t~mem27.base, #t~mem27.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L614] call #t~mem28.base, #t~mem28.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); [L614] call #t~mem29.base, #t~mem29.offset := read~$Pointer$(#t~mem28.base, #t~mem28.offset, 4); VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, #t~mem28.base=14, #t~mem28.offset=0, #t~mem29.base=14, #t~mem29.offset=0, ~shape.base=10, ~shape.offset=0] [L614] assume !(#t~mem29.base == 0 && #t~mem29.offset == 0); [L614] havoc #t~mem29.base, #t~mem29.offset; [L614] havoc #t~mem28.base, #t~mem28.offset; VAL [#in~shape.base=10, #in~shape.offset=0, #NULL.base=0, #NULL.offset=0, ~shape.base=10, ~shape.offset=0] [L614] CALL call fail(); VAL [#NULL.base=0, #NULL.offset=0] [L554] assert false; VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~data~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=0, ~data~0!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet36=1, ~data~0!base=0, ~data~0!offset=0] [L628-L640] COND FALSE !(!(0 != #t~nondet36)) [L628] havoc #t~nondet36; [L629] FCALL call #t~malloc37 := #Ultimate.alloc(8); [L629] ~node~1 := #t~malloc37; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L630] COND FALSE !(~node~1 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L632] FCALL call write~$Pointer$(~node~1, { base: ~node~1!base, offset: ~node~1!offset }, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] FCALL call write~int(#t~nondet38, { base: ~node~1!base, offset: 4 + ~node~1!offset }, 4); [L633] havoc #t~nondet38; [L634] FCALL call #t~malloc39 := #Ultimate.alloc(8); [L634] ~item~0 := #t~malloc39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L635] COND FALSE !(~item~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L637] FCALL call write~$Pointer$(~node~1, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L638] FCALL call write~$Pointer$(~data~0, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L639] ~data~0 := ~item~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, #t~nondet36=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628-L640] COND TRUE !(0 != #t~nondet36) [L628] havoc #t~nondet36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L641] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L643] CALL call inspect_before(~data~0); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0] [L602-L615] ~shape := #in~shape; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L604] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L605] FCALL call #t~mem25 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem25!base=0, #t~mem25!offset=0, ~shape!base=10, ~shape!offset=0] [L605-L610] COND TRUE !(#t~mem25 != { base: 0, offset: 0 }) [L605] havoc #t~mem25; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L611] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L612] FCALL call #t~mem26 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem26!base=0, #t~mem26!offset=0, ~shape!base=10, ~shape!offset=0] [L612] COND FALSE !(!(#t~mem26 == { base: 0, offset: 0 })) [L612] havoc #t~mem26; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L613] FCALL call #t~mem27 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem27!base=14, #t~mem27!offset=0, ~shape!base=10, ~shape!offset=0] [L613] COND FALSE !(#t~mem27 == { base: 0, offset: 0 }) [L613] havoc #t~mem27; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] FCALL call #t~mem28 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); [L614] FCALL call #t~mem29 := read~$Pointer$({ base: #t~mem28!base, offset: #t~mem28!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem28!base=14, #t~mem28!offset=0, #t~mem29!base=14, #t~mem29!offset=0, ~shape!base=10, ~shape!offset=0] [L614] COND TRUE !(#t~mem29 == { base: 0, offset: 0 }) [L614] havoc #t~mem29; [L614] havoc #t~mem28; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~data~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=0, ~data~0!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet36=1, ~data~0!base=0, ~data~0!offset=0] [L628-L640] COND FALSE !(!(0 != #t~nondet36)) [L628] havoc #t~nondet36; [L629] FCALL call #t~malloc37 := #Ultimate.alloc(8); [L629] ~node~1 := #t~malloc37; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L630] COND FALSE !(~node~1 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L632] FCALL call write~$Pointer$(~node~1, { base: ~node~1!base, offset: ~node~1!offset }, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] FCALL call write~int(#t~nondet38, { base: ~node~1!base, offset: 4 + ~node~1!offset }, 4); [L633] havoc #t~nondet38; [L634] FCALL call #t~malloc39 := #Ultimate.alloc(8); [L634] ~item~0 := #t~malloc39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L635] COND FALSE !(~item~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L637] FCALL call write~$Pointer$(~node~1, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L638] FCALL call write~$Pointer$(~data~0, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L639] ~data~0 := ~item~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, #t~nondet36=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628-L640] COND TRUE !(0 != #t~nondet36) [L628] havoc #t~nondet36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L641] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L643] CALL call inspect_before(~data~0); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0] [L602-L615] ~shape := #in~shape; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L604] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L605] FCALL call #t~mem25 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem25!base=0, #t~mem25!offset=0, ~shape!base=10, ~shape!offset=0] [L605-L610] COND TRUE !(#t~mem25 != { base: 0, offset: 0 }) [L605] havoc #t~mem25; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L611] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L612] FCALL call #t~mem26 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem26!base=0, #t~mem26!offset=0, ~shape!base=10, ~shape!offset=0] [L612] COND FALSE !(!(#t~mem26 == { base: 0, offset: 0 })) [L612] havoc #t~mem26; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L613] FCALL call #t~mem27 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem27!base=14, #t~mem27!offset=0, ~shape!base=10, ~shape!offset=0] [L613] COND FALSE !(#t~mem27 == { base: 0, offset: 0 }) [L613] havoc #t~mem27; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] FCALL call #t~mem28 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); [L614] FCALL call #t~mem29 := read~$Pointer$({ base: #t~mem28!base, offset: #t~mem28!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem28!base=14, #t~mem28!offset=0, #t~mem29!base=14, #t~mem29!offset=0, ~shape!base=10, ~shape!offset=0] [L614] COND TRUE !(#t~mem29 == { base: 0, offset: 0 }) [L614] havoc #t~mem29; [L614] havoc #t~mem28; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~data~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=0, ~data~0!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet36=1, ~data~0!base=0, ~data~0!offset=0] [L628-L640] COND FALSE !(!(0 != #t~nondet36)) [L628] havoc #t~nondet36; [L629] FCALL call #t~malloc37 := #Ultimate.alloc(8); [L629] ~node~1 := #t~malloc37; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L630] COND FALSE !(~node~1 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L632] FCALL call write~$Pointer$(~node~1, { base: ~node~1!base, offset: ~node~1!offset }, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] FCALL call write~int(#t~nondet38, { base: ~node~1!base, offset: 4 + ~node~1!offset }, 4); [L633] havoc #t~nondet38; [L634] FCALL call #t~malloc39 := #Ultimate.alloc(8); [L634] ~item~0 := #t~malloc39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L635] COND FALSE !(~item~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L637] FCALL call write~$Pointer$(~node~1, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L638] FCALL call write~$Pointer$(~data~0, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L639] ~data~0 := ~item~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, #t~nondet36=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628-L640] COND TRUE !(0 != #t~nondet36) [L628] havoc #t~nondet36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L641] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L643] CALL call inspect_before(~data~0); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0] [L602-L615] ~shape := #in~shape; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L604] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L605] FCALL call #t~mem25 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem25!base=0, #t~mem25!offset=0, ~shape!base=10, ~shape!offset=0] [L605-L610] COND TRUE !(#t~mem25 != { base: 0, offset: 0 }) [L605] havoc #t~mem25; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L611] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L612] FCALL call #t~mem26 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem26!base=0, #t~mem26!offset=0, ~shape!base=10, ~shape!offset=0] [L612] COND FALSE !(!(#t~mem26 == { base: 0, offset: 0 })) [L612] havoc #t~mem26; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L613] FCALL call #t~mem27 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem27!base=14, #t~mem27!offset=0, ~shape!base=10, ~shape!offset=0] [L613] COND FALSE !(#t~mem27 == { base: 0, offset: 0 }) [L613] havoc #t~mem27; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] FCALL call #t~mem28 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); [L614] FCALL call #t~mem29 := read~$Pointer$({ base: #t~mem28!base, offset: #t~mem28!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem28!base=14, #t~mem28!offset=0, #t~mem29!base=14, #t~mem29!offset=0, ~shape!base=10, ~shape!offset=0] [L614] COND TRUE !(#t~mem29 == { base: 0, offset: 0 }) [L614] havoc #t~mem29; [L614] havoc #t~mem28; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=17, #NULL!offset=9, old(#NULL!base)=17, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=17, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret44 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L627] ~data~0 := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, ~data~0!base=0, ~data~0!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet36=1, ~data~0!base=0, ~data~0!offset=0] [L628-L640] COND FALSE !(!(0 != #t~nondet36)) [L628] havoc #t~nondet36; [L629] FCALL call #t~malloc37 := #Ultimate.alloc(8); [L629] ~node~1 := #t~malloc37; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L630] COND FALSE !(~node~1 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, ~data~0!base=0, ~data~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L632] FCALL call write~$Pointer$(~node~1, { base: ~node~1!base, offset: ~node~1!offset }, 4); [L633] assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; [L633] FCALL call write~int(#t~nondet38, { base: ~node~1!base, offset: 4 + ~node~1!offset }, 4); [L633] havoc #t~nondet38; [L634] FCALL call #t~malloc39 := #Ultimate.alloc(8); [L634] ~item~0 := #t~malloc39; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L635] COND FALSE !(~item~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=0, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L637] FCALL call write~$Pointer$(~node~1, { base: ~item~0!base, offset: ~item~0!offset }, 4); [L638] FCALL call write~$Pointer$(~data~0, { base: ~item~0!base, offset: 4 + ~item~0!offset }, 4); [L639] ~data~0 := ~item~0; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628] assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, #t~nondet36=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L628-L640] COND TRUE !(0 != #t~nondet36) [L628] havoc #t~nondet36; VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L641] COND FALSE !(~data~0 == { base: 0, offset: 0 }) VAL [#NULL!base=0, #NULL!offset=0, #t~malloc37!base=14, #t~malloc37!offset=0, #t~malloc39!base=10, #t~malloc39!offset=0, ~data~0!base=10, ~data~0!offset=0, ~item~0!base=10, ~item~0!offset=0, ~node~1!base=14, ~node~1!offset=0] [L643] CALL call inspect_before(~data~0); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0] [L602-L615] ~shape := #in~shape; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L604] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L605] FCALL call #t~mem25 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem25!base=0, #t~mem25!offset=0, ~shape!base=10, ~shape!offset=0] [L605-L610] COND TRUE !(#t~mem25 != { base: 0, offset: 0 }) [L605] havoc #t~mem25; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L611] COND FALSE !(~shape == { base: 0, offset: 0 }) VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L612] FCALL call #t~mem26 := read~$Pointer$({ base: ~shape!base, offset: 4 + ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem26!base=0, #t~mem26!offset=0, ~shape!base=10, ~shape!offset=0] [L612] COND FALSE !(!(#t~mem26 == { base: 0, offset: 0 })) [L612] havoc #t~mem26; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L613] FCALL call #t~mem27 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem27!base=14, #t~mem27!offset=0, ~shape!base=10, ~shape!offset=0] [L613] COND FALSE !(#t~mem27 == { base: 0, offset: 0 }) [L613] havoc #t~mem27; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] FCALL call #t~mem28 := read~$Pointer$({ base: ~shape!base, offset: ~shape!offset }, 4); [L614] FCALL call #t~mem29 := read~$Pointer$({ base: #t~mem28!base, offset: #t~mem28!offset }, 4); VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, #t~mem28!base=14, #t~mem28!offset=0, #t~mem29!base=14, #t~mem29!offset=0, ~shape!base=10, ~shape!offset=0] [L614] COND TRUE !(#t~mem29 == { base: 0, offset: 0 }) [L614] havoc #t~mem29; [L614] havoc #t~mem28; VAL [#in~shape!base=10, #in~shape!offset=0, #NULL!base=0, #NULL!offset=0, ~shape!base=10, ~shape!offset=0] [L614] CALL call fail(); VAL [#NULL!base=0, #NULL!offset=0] [L554] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L637] item->slist = node [L638] item->next = data [L639] data = item VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L643] CALL inspect_before(data) VAL [shape={10:0}] [L604] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L605] shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L612] EXPR shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}, shape->slist->next={14:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() ----- [2018-11-23 03:43:34,322 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_affe22de-5be4-424e-9e03-218b65e21608/bin-2019/uautomizer/witness.graphml [2018-11-23 03:43:34,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:43:34,323 INFO L168 Benchmark]: Toolchain (without parser) took 3092.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:34,324 INFO L168 Benchmark]: CDTParser took 0.16 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 03:43:34,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:34,325 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:43:34,325 INFO L168 Benchmark]: Boogie Preprocessor took 28.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:34,325 INFO L168 Benchmark]: RCFGBuilder took 418.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:34,326 INFO L168 Benchmark]: TraceAbstraction took 2168.60 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -77.2 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:34,326 INFO L168 Benchmark]: Witness Printer took 86.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:43:34,329 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.16 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 363.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.51 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 418.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2168.60 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -77.2 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. * Witness Printer took 86.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L637] item->slist = node [L638] item->next = data [L639] data = item VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L643] CALL inspect_before(data) VAL [shape={10:0}] [L604] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L605] shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L612] EXPR shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}, shape->slist->next={14:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 115 locations, 1 error locations. UNSAFE Result, 2.1s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 918 SDtfs, 391 SDslu, 2420 SDs, 0 SdLazy, 819 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=8, 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, 8 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 34662 SizeOfPredicates, 11 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...