./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-regression/test29-1.c --full-output --witness-type violation_witness --validate ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/test29-1.yml/witness.yml --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0a70ae82 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/ldv-regression/test29-1.c ./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/test29-1.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --preprocessor.replace.while.statements.and.if-then-else.statements false --icfgbuilder.size.of.a.code.block SequenceOfStatements --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.yaml-violation-witnesses-0a70ae8-m [2024-08-07 14:08:00,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-07 14:08:00,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-08-07 14:08:00,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-07 14:08:00,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-07 14:08:00,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-07 14:08:00,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-07 14:08:00,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-07 14:08:00,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-08-07 14:08:00,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-08-07 14:08:00,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-07 14:08:00,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-07 14:08:00,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-07 14:08:00,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-07 14:08:00,742 INFO L153 SettingsManager]: * Use SBE=true [2024-08-07 14:08:00,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-07 14:08:00,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-07 14:08:00,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-07 14:08:00,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-07 14:08:00,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-07 14:08:00,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-07 14:08:00,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-07 14:08:00,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-07 14:08:00,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-07 14:08:00,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-07 14:08:00,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-07 14:08:00,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-07 14:08:00,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-07 14:08:00,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-07 14:08:00,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-07 14:08:00,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-07 14:08:00,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-07 14:08:00,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-08-07 14:08:00,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-07 14:08:00,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-07 14:08:00,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-07 14:08:00,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-07 14:08:00,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-07 14:08:00,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-07 14:08:00,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-08-07 14:08:00,749 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-07 14:08:00,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-08-07 14:08:00,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-08-07 14:08:00,750 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder: Size of a code block -> SequenceOfStatements [2024-08-07 14:08:01,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-07 14:08:01,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-07 14:08:01,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-07 14:08:01,093 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-07 14:08:01,093 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-07 14:08:01,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./svcomp-yaml-violation-generation.2024-08-01_14-26-22.files/Default/test29-1.yml/witness.yml [2024-08-07 14:08:01,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-07 14:08:01,172 INFO L274 PluginConnector]: CDTParser initialized [2024-08-07 14:08:01,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test29-1.c [2024-08-07 14:08:02,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-07 14:08:02,724 INFO L384 CDTParser]: Found 1 translation units. [2024-08-07 14:08:02,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29-1.c [2024-08-07 14:08:02,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/452a9a19b/56f6054c576948d1bf5b2b8db4ce64ae/FLAGf4ed5de27 [2024-08-07 14:08:03,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/452a9a19b/56f6054c576948d1bf5b2b8db4ce64ae [2024-08-07 14:08:03,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-07 14:08:03,135 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-08-07 14:08:03,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-07 14:08:03,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-07 14:08:03,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-07 14:08:03,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:08:01" (1/2) ... [2024-08-07 14:08:03,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca1c00e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:08:03, skipping insertion in model container [2024-08-07 14:08:03,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:08:01" (1/2) ... [2024-08-07 14:08:03,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14efdec0 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 07.08 02:08:03, skipping insertion in model container [2024-08-07 14:08:03,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:08:03" (2/2) ... [2024-08-07 14:08:03,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca1c00e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03, skipping insertion in model container [2024-08-07 14:08:03,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 02:08:03" (2/2) ... [2024-08-07 14:08:03,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-08-07 14:08:03,305 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29-1.c[614,627] [2024-08-07 14:08:03,311 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:08:03,326 INFO L200 MainTranslator]: Completed pre-run [2024-08-07 14:08:03,338 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test29-1.c[614,627] [2024-08-07 14:08:03,339 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-07 14:08:03,352 INFO L204 MainTranslator]: Completed translation [2024-08-07 14:08:03,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03 WrapperNode [2024-08-07 14:08:03,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-07 14:08:03,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-07 14:08:03,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-07 14:08:03,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-07 14:08:03,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (1/1) ... [2024-08-07 14:08:03,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (1/1) ... [2024-08-07 14:08:03,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (1/1) ... [2024-08-07 14:08:03,381 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-08-07 14:08:03,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (1/1) ... [2024-08-07 14:08:03,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (1/1) ... [2024-08-07 14:08:03,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (1/1) ... [2024-08-07 14:08:03,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (1/1) ... [2024-08-07 14:08:03,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (1/1) ... [2024-08-07 14:08:03,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-07 14:08:03,392 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-08-07 14:08:03,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-08-07 14:08:03,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-08-07 14:08:03,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (1/1) ... [2024-08-07 14:08:03,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-08-07 14:08:03,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-08-07 14:08:03,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-08-07 14:08:03,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-08-07 14:08:03,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-08-07 14:08:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-07 14:08:03,466 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-08-07 14:08:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-08-07 14:08:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-08-07 14:08:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-08-07 14:08:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-08-07 14:08:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-08-07 14:08:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-08-07 14:08:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-08-07 14:08:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-07 14:08:03,544 INFO L273 CfgBuilder]: Building ICFG [2024-08-07 14:08:03,546 INFO L304 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-07 14:08:03,619 INFO L1251 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(~#d1~0.base, ~#d1~0.offset);havoc ~#d1~0.base, ~#d1~0.offset;call ULTIMATE.dealloc(~#d2~0.base, ~#d2~0.offset);havoc ~#d2~0.base, ~#d2~0.offset; [2024-08-07 14:08:03,647 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-08-07 14:08:03,647 INFO L327 CfgBuilder]: Performing block encoding [2024-08-07 14:08:03,655 INFO L349 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-07 14:08:03,656 INFO L354 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-07 14:08:03,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:08:03 BoogieIcfgContainer [2024-08-07 14:08:03,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-08-07 14:08:03,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-07 14:08:03,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-07 14:08:03,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-07 14:08:03,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 07.08 02:08:01" (1/4) ... [2024-08-07 14:08:03,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0aa596 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 07.08 02:08:03, skipping insertion in model container [2024-08-07 14:08:03,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 02:08:03" (2/4) ... [2024-08-07 14:08:03,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0aa596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:08:03, skipping insertion in model container [2024-08-07 14:08:03,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 02:08:03" (3/4) ... [2024-08-07 14:08:03,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0aa596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 02:08:03, skipping insertion in model container [2024-08-07 14:08:03,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.08 02:08:03" (4/4) ... [2024-08-07 14:08:03,666 INFO L119 eAbstractionObserver]: Analyzing ICFG test29-1.c [2024-08-07 14:08:03,666 WARN L130 eAbstractionObserver]: Found a witness in the YAML format. I will only consider traces that are accepted by the witness [2024-08-07 14:08:03,693 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-07 14:08:03,693 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-08-07 14:08:03,721 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,722 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,725 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,726 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,729 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,729 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,730 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,731 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,731 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,732 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,732 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,733 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,733 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,733 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,734 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,734 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,734 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,734 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,735 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,735 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,736 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,737 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,737 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,738 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,738 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,739 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,739 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,739 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,739 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,739 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,740 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,740 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,740 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,740 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,741 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,741 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,741 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,743 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,745 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,745 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,746 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,746 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,748 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,748 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,748 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,749 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,749 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,749 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,749 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,749 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,749 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,750 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,758 INFO L90 WitnessUtils]: NestedWordAutomaton nwa = ( callAlphabet = {"call #t~ret8 := main();" "call ULTIMATE.init();" }, internalAlphabet = {"assume false;#res := 1;call ULTIMATE.dealloc(~#d1~0.base, ~#d1~0.offset);havoc ~#d1~0.base, ~#d1~0.offset;call ULTIMATE.dealloc(~#d2~0.base, ~#d2~0.offset);havoc ~#d2~0.base, ~#d2~0.offset;" "assume false;" "assume !false;" "#res := 0;call ULTIMATE.dealloc(~#d1~0.base, ~#d1~0.offset);havoc ~#d1~0.base, ~#d1~0.offset;call ULTIMATE.dealloc(~#d2~0.base, ~#d2~0.offset);havoc ~#d2~0.base, ~#d2~0.offset;" "assume #t~short7;havoc #t~mem6;havoc #t~short7;" "assume !#t~short7;havoc #t~mem6;havoc #t~short7;" "assume #t~short7;call #t~mem6 := read~int#1(~#d1~0.base, ~#d1~0.offset, 4);#t~short7 := 0 != #t~mem6;" "assume !#t~short7;" "#t~short7 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;" "assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);" "assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);" "call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4);havoc #t~nondet4;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~pd~0.base, ~pd~0.offset := (if 0 != ~n~0 then ~#d1~0.base else ~#d2~0.base), (if 0 != ~n~0 then ~#d1~0.offset else ~#d2~0.offset);havoc #t~nondet5;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int#1(#t~nondet5, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet5;" "assume true;" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "assume true;" "SUMMARY for call #t~ret8 := main(); srcloc: L-1" "SUMMARY for call ULTIMATE.init(); srcloc: ULTIMATE.startENTRY" "assume true;" }, returnAlphabet = {"#23#return;" "#25#return;" }, states = {"CountingPredicate [underlying: 9#mainENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 8#L25true, annotation: [0, 0]]" "CountingPredicate [underlying: 14#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 8#L25true, annotation: [2, 0]]" "CountingPredicate [underlying: 14#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 19#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 19#ULTIMATE.startFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 3#L19true, annotation: [0, 0]]" "CountingPredicate [underlying: 6#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 10#L28true, annotation: [1, 0]]" "CountingPredicate [underlying: 10#L28true, annotation: [0, 0]]" "CountingPredicate [underlying: 17#L24-2true, annotation: [0, 0]]" "CountingPredicate [underlying: 5#L24-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 4#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 5#L24-1true, annotation: [1, 0]]" "CountingPredicate [underlying: 12#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 13#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 11#L-1true, annotation: [0, 0]]" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 17#L24-2true, annotation: [1, 0]]" "CountingPredicate [underlying: 18#L30true, annotation: [3, 0]]" "CountingPredicate [underlying: 18#L30true, annotation: [0, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 7#L24true, annotation: [1, 0]]" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 7#L24true, annotation: [0, 0]]" "CountingPredicate [underlying: 19#ULTIMATE.startFINALtrue, annotation: [0, 0]]" }, initialStates = {"CountingPredicate [underlying: 6#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" }, finalStates = {"CountingPredicate [underlying: 14#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [3, 0]]" }, callTransitions = { ("CountingPredicate [underlying: 6#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "call ULTIMATE.init();" "CountingPredicate [underlying: 4#ULTIMATE.initENTRYtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 11#L-1true, annotation: [0, 0]]" "call #t~ret8 := main();" "CountingPredicate [underlying: 9#mainENTRYtrue, annotation: [0, 0]]") }, internalTransitions = { ("CountingPredicate [underlying: 9#mainENTRYtrue, annotation: [0, 0]]" "call ~#d1~0.base, ~#d1~0.offset := #Ultimate.allocOnStack(4);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.allocOnStack(4);havoc #t~nondet4;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~pd~0.base, ~pd~0.offset := (if 0 != ~n~0 then ~#d1~0.base else ~#d2~0.base), (if 0 != ~n~0 then ~#d1~0.offset else ~#d2~0.offset);havoc #t~nondet5;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int#1(#t~nondet5, ~#d1~0.base, ~#d1~0.offset, 4);havoc #t~nondet5;" "CountingPredicate [underlying: 3#L19true, annotation: [0, 0]]") ("CountingPredicate [underlying: 8#L25true, annotation: [0, 0]]" "assume false;" "CountingPredicate [underlying: 18#L30true, annotation: [0, 0]]") ("CountingPredicate [underlying: 8#L25true, annotation: [0, 0]]" "assume !false;" "CountingPredicate [underlying: 14#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 8#L25true, annotation: [2, 0]]" "assume false;" "CountingPredicate [underlying: 18#L30true, annotation: [3, 0]]") ("CountingPredicate [underlying: 8#L25true, annotation: [2, 0]]" "assume !false;" "CountingPredicate [underlying: 14#mainErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 19#ULTIMATE.startFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 16#mainFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 19#ULTIMATE.startFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 3#L19true, annotation: [0, 0]]" "assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);" "CountingPredicate [underlying: 17#L24-2true, annotation: [0, 0]]") ("CountingPredicate [underlying: 3#L19true, annotation: [0, 0]]" "assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);" "CountingPredicate [underlying: 17#L24-2true, annotation: [1, 0]]") ("CountingPredicate [underlying: 10#L28true, annotation: [1, 0]]" "#res := 0;call ULTIMATE.dealloc(~#d1~0.base, ~#d1~0.offset);havoc ~#d1~0.base, ~#d1~0.offset;call ULTIMATE.dealloc(~#d2~0.base, ~#d2~0.offset);havoc ~#d2~0.base, ~#d2~0.offset;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 10#L28true, annotation: [0, 0]]" "#res := 0;call ULTIMATE.dealloc(~#d1~0.base, ~#d1~0.offset);havoc ~#d1~0.base, ~#d1~0.offset;call ULTIMATE.dealloc(~#d2~0.base, ~#d2~0.offset);havoc ~#d2~0.base, ~#d2~0.offset;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 17#L24-2true, annotation: [0, 0]]" "#t~short7 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;" "CountingPredicate [underlying: 5#L24-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 5#L24-1true, annotation: [0, 0]]" "assume #t~short7;call #t~mem6 := read~int#1(~#d1~0.base, ~#d1~0.offset, 4);#t~short7 := 0 != #t~mem6;" "CountingPredicate [underlying: 7#L24true, annotation: [0, 0]]") ("CountingPredicate [underlying: 5#L24-1true, annotation: [0, 0]]" "assume !#t~short7;" "CountingPredicate [underlying: 7#L24true, annotation: [0, 0]]") ("CountingPredicate [underlying: 4#ULTIMATE.initENTRYtrue, annotation: [0, 0]]" "assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);" "CountingPredicate [underlying: 12#ULTIMATE.initFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 5#L24-1true, annotation: [1, 0]]" "assume #t~short7;call #t~mem6 := read~int#1(~#d1~0.base, ~#d1~0.offset, 4);#t~short7 := 0 != #t~mem6;" "CountingPredicate [underlying: 7#L24true, annotation: [1, 0]]") ("CountingPredicate [underlying: 5#L24-1true, annotation: [1, 0]]" "assume !#t~short7;" "CountingPredicate [underlying: 7#L24true, annotation: [1, 0]]") ("CountingPredicate [underlying: 12#ULTIMATE.initFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 13#ULTIMATE.initEXITtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 16#mainFINALtrue, annotation: [1, 0]]" "assume true;" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 16#mainFINALtrue, annotation: [3, 0]]" "assume true;" "CountingPredicate [underlying: 15#mainEXITtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 17#L24-2true, annotation: [1, 0]]" "#t~short7 := ~pd~0.base == ~#d2~0.base && ~pd~0.offset == ~#d2~0.offset;" "CountingPredicate [underlying: 5#L24-1true, annotation: [1, 0]]") ("CountingPredicate [underlying: 18#L30true, annotation: [3, 0]]" "assume false;#res := 1;call ULTIMATE.dealloc(~#d1~0.base, ~#d1~0.offset);havoc ~#d1~0.base, ~#d1~0.offset;call ULTIMATE.dealloc(~#d2~0.base, ~#d2~0.offset);havoc ~#d2~0.base, ~#d2~0.offset;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 18#L30true, annotation: [0, 0]]" "assume false;#res := 1;call ULTIMATE.dealloc(~#d1~0.base, ~#d1~0.offset);havoc ~#d1~0.base, ~#d1~0.offset;call ULTIMATE.dealloc(~#d2~0.base, ~#d2~0.offset);havoc ~#d2~0.base, ~#d2~0.offset;" "CountingPredicate [underlying: 16#mainFINALtrue, annotation: [0, 0]]") ("CountingPredicate [underlying: 7#L24true, annotation: [1, 0]]" "assume #t~short7;havoc #t~mem6;havoc #t~short7;" "CountingPredicate [underlying: 8#L25true, annotation: [2, 0]]") ("CountingPredicate [underlying: 7#L24true, annotation: [1, 0]]" "assume !#t~short7;havoc #t~mem6;havoc #t~short7;" "CountingPredicate [underlying: 10#L28true, annotation: [1, 0]]") ("CountingPredicate [underlying: 7#L24true, annotation: [0, 0]]" "assume #t~short7;havoc #t~mem6;havoc #t~short7;" "CountingPredicate [underlying: 8#L25true, annotation: [0, 0]]") ("CountingPredicate [underlying: 7#L24true, annotation: [0, 0]]" "assume !#t~short7;havoc #t~mem6;havoc #t~short7;" "CountingPredicate [underlying: 10#L28true, annotation: [0, 0]]") ("CountingPredicate [underlying: 19#ULTIMATE.startFINALtrue, annotation: [0, 0]]" "assume true;" "CountingPredicate [underlying: 2#ULTIMATE.startEXITtrue, annotation: [0, 0]]") }, returnTransitions = { ("CountingPredicate [underlying: 13#ULTIMATE.initEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 6#ULTIMATE.startENTRYtrue, annotation: [0, 0]]" "#25#return;" "CountingPredicate [underlying: 11#L-1true, annotation: [0, 0]]") ("CountingPredicate [underlying: 15#mainEXITtrue, annotation: [3, 0]]" "CountingPredicate [underlying: 11#L-1true, annotation: [0, 0]]" "#23#return;" "CountingPredicate [underlying: 19#ULTIMATE.startFINALtrue, annotation: [3, 0]]") ("CountingPredicate [underlying: 15#mainEXITtrue, annotation: [1, 0]]" "CountingPredicate [underlying: 11#L-1true, annotation: [0, 0]]" "#23#return;" "CountingPredicate [underlying: 19#ULTIMATE.startFINALtrue, annotation: [1, 0]]") ("CountingPredicate [underlying: 15#mainEXITtrue, annotation: [0, 0]]" "CountingPredicate [underlying: 11#L-1true, annotation: [0, 0]]" "#23#return;" "CountingPredicate [underlying: 19#ULTIMATE.startFINALtrue, annotation: [0, 0]]") } ); [2024-08-07 14:08:03,765 INFO L82 GeneralOperation]: Start removeDeadEnds. Operand has 18 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-08-07 14:08:03,766 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,766 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,766 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,766 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,767 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,767 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,767 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,767 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,767 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,767 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,767 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,768 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,768 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,768 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,768 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,768 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,769 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,769 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,769 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,769 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,769 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,769 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,770 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,770 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,773 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,773 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,774 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,774 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,774 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,774 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,774 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,774 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,775 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,775 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,775 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,775 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,775 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,775 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,776 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,776 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,776 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,776 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,776 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,778 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,778 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,778 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,778 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,778 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,778 WARN L283 nessProductAutomaton]: assume ~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset;call write~int#1(0, ~pd~0.base, ~pd~0.offset, 4);, isNegated false [2024-08-07 14:08:03,779 WARN L283 nessProductAutomaton]: assume !(~pd~0.base == ~#d1~0.base && ~pd~0.offset == ~#d1~0.offset);call write~int#1(0, ~pd~0.base, ~pd~0.offset, 1);, isNegated true [2024-08-07 14:08:03,779 WARN L283 nessProductAutomaton]: assume #t~short7;havoc #t~mem6;havoc #t~short7;, isNegated false [2024-08-07 14:08:03,779 WARN L283 nessProductAutomaton]: assume !#t~short7;havoc #t~mem6;havoc #t~short7;, isNegated true [2024-08-07 14:08:03,784 INFO L88 GeneralOperation]: Finished removeDeadEnds. Reduced from 33 states to 12 states. [2024-08-07 14:08:03,800 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-08-07 14:08:03,807 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@113fb6dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-07 14:08:03,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-08-07 14:08:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2024-08-07 14:08:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-08-07 14:08:03,812 INFO L187 NwaCegarLoop]: Found error trace [2024-08-07 14:08:03,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-07 14:08:03,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-08-07 14:08:03,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-07 14:08:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1845282639, now seen corresponding path program 1 times [2024-08-07 14:08:03,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-07 14:08:03,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284776769] [2024-08-07 14:08:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-07 14:08:03,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-07 14:08:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:08:03,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-07 14:08:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-07 14:08:03,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-07 14:08:03,956 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-07 14:08:03,957 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-08-07 14:08:03,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-07 14:08:03,963 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-08-07 14:08:03,966 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-08-07 14:08:03,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 02:08:03 BoogieIcfgContainer [2024-08-07 14:08:03,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-07 14:08:03,992 INFO L158 Benchmark]: Toolchain (without parser) took 856.50ms. Allocated memory is still 75.5MB. Free memory was 40.9MB in the beginning and 54.5MB in the end (delta: -13.6MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-08-07 14:08:03,993 INFO L158 Benchmark]: Witness Parser took 0.32ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:08:03,997 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 54.5MB. Free memory was 35.1MB in the beginning and 35.1MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-07 14:08:03,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.91ms. Allocated memory is still 75.5MB. Free memory was 40.6MB in the beginning and 49.4MB in the end (delta: -8.7MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-08-07 14:08:03,998 INFO L158 Benchmark]: Boogie Preprocessor took 36.95ms. Allocated memory is still 75.5MB. Free memory was 49.4MB in the beginning and 47.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-08-07 14:08:03,998 INFO L158 Benchmark]: IcfgBuilder took 265.03ms. Allocated memory is still 75.5MB. Free memory was 47.3MB in the beginning and 35.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-08-07 14:08:03,999 INFO L158 Benchmark]: TraceAbstraction took 332.74ms. Allocated memory is still 75.5MB. Free memory was 34.7MB in the beginning and 54.5MB in the end (delta: -19.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-07 14:08:04,000 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.32ms. Allocated memory is still 54.5MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.24ms. Allocated memory is still 54.5MB. Free memory was 35.1MB in the beginning and 35.1MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.91ms. Allocated memory is still 75.5MB. Free memory was 40.6MB in the beginning and 49.4MB in the end (delta: -8.7MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.95ms. Allocated memory is still 75.5MB. Free memory was 49.4MB in the beginning and 47.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 265.03ms. Allocated memory is still 75.5MB. Free memory was 47.3MB in the beginning and 35.2MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 332.74ms. Allocated memory is still 75.5MB. Free memory was 34.7MB in the beginning and 54.5MB in the end (delta: -19.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 30]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L15] union dummy d1, d2; [L16] int n = __VERIFIER_nondet_int(); [L17] union dummy *pd = n ? &d1 : &d2; [L18] d1.a = __VERIFIER_nondet_int() [L19] pd == &d1 [L22] pd->b = 0 VAL [d1={5:0}, d2={6:0}, pd={6:0}] [L24] pd == &d2 && d1.a != 0 VAL [d1={5:0}] [L24] pd == &d2 && d1.a != 0 [L24] EXPR d1.a [L24] pd == &d2 && d1.a != 0 [L24] pd == &d2 && d1.a != 0 [L30] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-07 14:08:04,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE