./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b81c98cb025a57c782cd7fac59d92180084d85fffb615d87a6622128bc11df5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:27:55,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:27:55,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:27:55,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:27:55,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:27:55,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:27:55,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:27:55,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:27:55,899 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:27:55,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:27:55,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:27:55,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:27:55,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:27:55,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:27:55,903 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:27:55,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:27:55,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:27:55,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:27:55,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:27:55,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:27:55,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:27:55,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:27:55,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:27:55,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:27:55,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:27:55,909 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:27:55,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:27:55,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:27:55,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:27:55,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:27:55,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:27:55,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:27:55,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:27:55,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:27:55,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:27:55,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:27:55,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:27:55,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:27:55,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:27:55,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:27:55,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:27:55,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:27:55,914 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(reach_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 -> 3b81c98cb025a57c782cd7fac59d92180084d85fffb615d87a6622128bc11df5 [2024-10-12 18:27:56,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:27:56,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:27:56,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:27:56,257 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:27:56,258 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:27:56,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-2.i [2024-10-12 18:27:57,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:27:58,002 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:27:58,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-2.i [2024-10-12 18:27:58,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806ae32ac/b3be4155457846fbb353b1619e692bd4/FLAG61c5dc0df [2024-10-12 18:27:58,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/806ae32ac/b3be4155457846fbb353b1619e692bd4 [2024-10-12 18:27:58,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:27:58,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:27:58,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:27:58,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:27:58,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:27:58,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:58,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4fae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58, skipping insertion in model container [2024-10-12 18:27:58,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:58,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:27:58,596 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-2.i[1830,1843] [2024-10-12 18:27:58,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:27:58,721 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:27:58,734 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-2.i[1830,1843] [2024-10-12 18:27:58,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:27:58,849 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:27:58,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58 WrapperNode [2024-10-12 18:27:58,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:27:58,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:27:58,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:27:58,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:27:58,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:58,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:58,906 INFO L138 Inliner]: procedures = 32, calls = 79, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 243 [2024-10-12 18:27:58,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:27:58,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:27:58,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:27:58,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:27:58,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:58,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:58,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:58,988 INFO L175 MemorySlicer]: Split 39 memory accesses to 5 slices as follows [2, 2, 1, 18, 16]. 46 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 0, 2, 0]. The 10 writes are split as follows [0, 0, 1, 4, 5]. [2024-10-12 18:27:58,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:58,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:59,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:59,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:59,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:59,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:59,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:27:59,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:27:59,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:27:59,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:27:59,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (1/1) ... [2024-10-12 18:27:59,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:27:59,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:27:59,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:27:59,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:27:59,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-12 18:27:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-12 18:27:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-12 18:27:59,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-12 18:27:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 18:27:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 18:27:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 18:27:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 18:27:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-12 18:27:59,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 18:27:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 18:27:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 18:27:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 18:27:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-12 18:27:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-10-12 18:27:59,183 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-10-12 18:27:59,184 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-10-12 18:27:59,184 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-10-12 18:27:59,184 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-10-12 18:27:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:27:59,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:27:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 18:27:59,413 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:27:59,415 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:27:59,493 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint failFINAL: assume true; [2024-10-12 18:28:00,034 INFO L? ?]: Removed 299 outVars from TransFormulas that were not future-live. [2024-10-12 18:28:00,035 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:28:00,168 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:28:00,169 INFO L314 CfgBuilder]: Removed 23 assume(true) statements. [2024-10-12 18:28:00,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:28:00 BoogieIcfgContainer [2024-10-12 18:28:00,170 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:28:00,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:28:00,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:28:00,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:28:00,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:27:58" (1/3) ... [2024-10-12 18:28:00,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3156b4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:28:00, skipping insertion in model container [2024-10-12 18:28:00,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:27:58" (2/3) ... [2024-10-12 18:28:00,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3156b4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:28:00, skipping insertion in model container [2024-10-12 18:28:00,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:28:00" (3/3) ... [2024-10-12 18:28:00,179 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort-2.i [2024-10-12 18:28:00,198 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:28:00,199 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:28:00,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:28:00,284 INFO L333 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, 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;@17c33f52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:28:00,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:28:00,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 70 states have (on average 2.0285714285714285) internal successors, (142), 88 states have internal predecessors, (142), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 18:28:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 18:28:00,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:28:00,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:28:00,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:28:00,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:28:00,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1727990966, now seen corresponding path program 1 times [2024-10-12 18:28:00,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:28:00,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539358934] [2024-10-12 18:28:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:28:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:28:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:28:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:28:00,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:28:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539358934] [2024-10-12 18:28:00,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539358934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:28:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:28:00,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 18:28:00,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282098463] [2024-10-12 18:28:00,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:28:00,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 18:28:00,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:28:00,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 18:28:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 18:28:00,542 INFO L87 Difference]: Start difference. First operand has 98 states, 70 states have (on average 2.0285714285714285) internal successors, (142), 88 states have internal predecessors, (142), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:28:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:28:00,718 INFO L93 Difference]: Finished difference Result 193 states and 340 transitions. [2024-10-12 18:28:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 18:28:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-12 18:28:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:28:00,729 INFO L225 Difference]: With dead ends: 193 [2024-10-12 18:28:00,730 INFO L226 Difference]: Without dead ends: 91 [2024-10-12 18:28:00,735 INFO L431 NwaCegarLoop]: 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 [2024-10-12 18:28:00,742 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:28:00,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:28:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-12 18:28:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-12 18:28:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.34375) internal successors, (86), 81 states have internal predecessors, (86), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:28:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2024-10-12 18:28:00,797 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 9 [2024-10-12 18:28:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:28:00,798 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2024-10-12 18:28:00,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:28:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2024-10-12 18:28:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:28:00,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:28:00,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:28:00,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:28:00,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:28:00,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:28:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash -538681145, now seen corresponding path program 1 times [2024-10-12 18:28:00,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:28:00,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228243493] [2024-10-12 18:28:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:28:00,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:28:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:28:01,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-12 18:28:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:28:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:28:01,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:28:01,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228243493] [2024-10-12 18:28:01,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228243493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:28:01,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:28:01,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 18:28:01,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178285085] [2024-10-12 18:28:01,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:28:01,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 18:28:01,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:28:01,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 18:28:01,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 18:28:01,348 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:28:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:28:02,190 INFO L93 Difference]: Finished difference Result 152 states and 191 transitions. [2024-10-12 18:28:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 18:28:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-12 18:28:02,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:28:02,194 INFO L225 Difference]: With dead ends: 152 [2024-10-12 18:28:02,195 INFO L226 Difference]: Without dead ends: 147 [2024-10-12 18:28:02,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-12 18:28:02,198 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 479 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 18:28:02,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 97 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 18:28:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-12 18:28:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2024-10-12 18:28:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 120 states have internal predecessors, (142), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 18:28:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 170 transitions. [2024-10-12 18:28:02,232 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 170 transitions. Word has length 17 [2024-10-12 18:28:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:28:02,233 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 170 transitions. [2024-10-12 18:28:02,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 18:28:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 170 transitions. [2024-10-12 18:28:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 18:28:02,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:28:02,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:28:02,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:28:02,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:28:02,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:28:02,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2022930038, now seen corresponding path program 1 times [2024-10-12 18:28:02,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:28:02,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101632750] [2024-10-12 18:28:02,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:28:02,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:28:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:28:02,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 18:28:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 18:28:02,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 18:28:02,435 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 18:28:02,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:28:02,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:28:02,441 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-12 18:28:02,490 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:28:02,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:28:02 BoogieIcfgContainer [2024-10-12 18:28:02,496 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:28:02,497 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:28:02,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:28:02,498 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:28:02,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:28:00" (3/4) ... [2024-10-12 18:28:02,500 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 18:28:02,583 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:28:02,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:28:02,584 INFO L158 Benchmark]: Toolchain (without parser) took 4256.68ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 136.8MB in the beginning and 150.2MB in the end (delta: -13.4MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-10-12 18:28:02,584 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:28:02,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.71ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 115.3MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 18:28:02,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.88ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 112.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:28:02,585 INFO L158 Benchmark]: Boogie Preprocessor took 129.14ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 103.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 18:28:02,585 INFO L158 Benchmark]: RCFGBuilder took 1132.64ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 66.9MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-12 18:28:02,586 INFO L158 Benchmark]: TraceAbstraction took 2323.91ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 65.8MB in the beginning and 154.4MB in the end (delta: -88.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:28:02,586 INFO L158 Benchmark]: Witness Printer took 86.88ms. Allocated memory is still 228.6MB. Free memory was 154.4MB in the beginning and 150.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 18:28:02,587 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.71ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 115.3MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.88ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 112.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.14ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 103.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1132.64ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 66.9MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2323.91ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 65.8MB in the beginning and 154.4MB in the end (delta: -88.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 86.88ms. Allocated memory is still 228.6MB. Free memory was 154.4MB in the beginning and 150.2MB in the end (delta: 4.2MB). 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: 46]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L835] struct list_head const *__cil_tmp1 ; [L836] struct list_head const *__cil_tmp2 ; [L839] CALL gl_read() [L676] int tmp ; [L677] int tmp___0 ; VAL [gl_list={5:0}] [L680] COND TRUE 1 [L683] tmp = __VERIFIER_nondet_int() [L684] CALL gl_insert(tmp) [L622] struct node *node ; [L623] void *tmp ; [L624] unsigned int __cil_tmp4 ; [L625] unsigned int __cil_tmp5 ; [L626] unsigned int __cil_tmp6 ; [L627] struct list_head *__cil_tmp7 ; [L628] unsigned int __cil_tmp8 ; [L629] unsigned int __cil_tmp9 ; [L630] unsigned int __cil_tmp10 ; [L631] unsigned int __cil_tmp11 ; [L632] unsigned int __cil_tmp12 ; [L633] unsigned int __cil_tmp13 ; [L634] unsigned int __cil_tmp14 ; [L635] unsigned int __cil_tmp15 ; [L638] __cil_tmp4 = (unsigned int )20UL [L639] tmp = malloc(__cil_tmp4) [L640] node = (struct node *)tmp VAL [gl_list={5:0}, node={4294967297:0}, value=-1] [L642] COND FALSE !(! node) VAL [gl_list={5:0}, node={4294967297:0}, value=-1] [L649] *((int *)node) = value [L650] __cil_tmp5 = (unsigned int )node [L651] __cil_tmp6 = __cil_tmp5 + 4 [L652] __cil_tmp7 = (struct list_head *)__cil_tmp6 VAL [__cil_tmp7={0:5}, gl_list={5:0}, node={4294967297:0}] [L653] CALL list_add(__cil_tmp7, & gl_list) VAL [gl_list={5:0}] [L595] struct list_head *__cil_tmp3 ; [L598] EXPR \read(*head) [L598] __cil_tmp3 = *((struct list_head **)head) [L599] CALL __list_add(new, head, __cil_tmp3) [L567] unsigned int __cil_tmp4 ; [L568] unsigned int __cil_tmp5 ; [L569] unsigned int __cil_tmp6 ; [L570] unsigned int __cil_tmp7 ; [L572] __cil_tmp4 = (unsigned int )next [L573] __cil_tmp5 = __cil_tmp4 + 4 [L574] *((struct list_head **)__cil_tmp5) = new [L575] *((struct list_head **)new) = next [L576] __cil_tmp6 = (unsigned int )new [L577] __cil_tmp7 = __cil_tmp6 + 4 [L578] *((struct list_head **)__cil_tmp7) = prev [L579] *((struct list_head **)prev) = new [L599] RET __list_add(new, head, __cil_tmp3) [L653] RET list_add(__cil_tmp7, & gl_list) VAL [__cil_tmp7={0:5}, gl_list={5:0}, node={4294967297:0}] [L656] COND TRUE 1 [L658] __cil_tmp8 = (unsigned int )node [L659] __cil_tmp9 = __cil_tmp8 + 12 [L660] __cil_tmp10 = (unsigned int )node [L661] __cil_tmp11 = __cil_tmp10 + 12 [L662] *((struct list_head **)__cil_tmp9) = (struct list_head *)__cil_tmp11 [L663] __cil_tmp12 = (unsigned int )node [L664] __cil_tmp13 = __cil_tmp12 + 12 [L665] __cil_tmp14 = (unsigned int )node [L666] __cil_tmp15 = __cil_tmp14 + 12 [L667] *((struct list_head **)__cil_tmp13) = (struct list_head *)__cil_tmp15 VAL [gl_list={5:0}] [L684] RET gl_insert(tmp) [L685] tmp___0 = __VERIFIER_nondet_int() [L687] COND FALSE !(\read(tmp___0)) VAL [gl_list={5:0}] [L839] RET gl_read() [L840] __cil_tmp1 = (struct list_head const *)(& gl_list) VAL [__cil_tmp1={5:0}, gl_list={5:0}] [L841] CALL inspect(__cil_tmp1) VAL [\old(head)={5:0}, gl_list={5:0}] [L55] struct node const *node ; [L56] unsigned int __cil_tmp3 ; [L57] struct list_head *__cil_tmp4 ; [L58] unsigned int __cil_tmp5 ; [L59] int __cil_tmp6 ; [L60] unsigned int __cil_tmp7 ; [L61] unsigned int __cil_tmp8 ; [L62] unsigned int __cil_tmp9 ; [L63] struct list_head *__cil_tmp10 ; [L64] unsigned int __cil_tmp11 ; [L65] int __cil_tmp12 ; [L66] unsigned int __cil_tmp13 ; [L67] unsigned int __cil_tmp14 ; [L68] struct list_head *__cil_tmp15 ; [L69] unsigned int __cil_tmp16 ; [L70] struct list_head *__cil_tmp17 ; [L71] unsigned int __cil_tmp18 ; [L72] int __cil_tmp19 ; [L73] unsigned int __cil_tmp20 ; [L74] unsigned int __cil_tmp21 ; [L75] unsigned int __cil_tmp22 ; [L76] struct list_head *__cil_tmp23 ; [L77] unsigned int __cil_tmp24 ; [L78] int __cil_tmp25 ; [L79] struct node *__cil_tmp26 ; [L80] unsigned int __cil_tmp27 ; [L81] unsigned int __cil_tmp28 ; [L82] struct list_head *__cil_tmp29 ; [L83] unsigned long __cil_tmp30 ; [L84] char *__cil_tmp31 ; [L85] char *__cil_tmp32 ; [L86] struct node *__cil_tmp33 ; [L87] unsigned int __cil_tmp34 ; [L88] unsigned int __cil_tmp35 ; [L89] struct list_head const *__cil_tmp36 ; [L90] unsigned int __cil_tmp37 ; [L91] unsigned int __cil_tmp38 ; [L92] unsigned int __cil_tmp39 ; [L93] struct list_head *__cil_tmp40 ; [L94] unsigned int __cil_tmp41 ; [L95] int __cil_tmp42 ; [L96] unsigned int __cil_tmp43 ; [L97] unsigned int __cil_tmp44 ; [L98] struct list_head const *__cil_tmp45 ; [L99] unsigned int __cil_tmp46 ; [L100] unsigned int __cil_tmp47 ; [L101] unsigned int __cil_tmp48 ; [L102] unsigned int __cil_tmp49 ; [L103] struct list_head *__cil_tmp50 ; [L104] unsigned int __cil_tmp51 ; [L105] int __cil_tmp52 ; [L106] unsigned int __cil_tmp53 ; [L107] unsigned int __cil_tmp54 ; [L108] struct list_head const *__cil_tmp55 ; [L109] unsigned int __cil_tmp56 ; [L110] unsigned int __cil_tmp57 ; [L111] unsigned int __cil_tmp58 ; [L112] struct list_head *__cil_tmp59 ; [L113] unsigned int __cil_tmp60 ; [L114] int __cil_tmp61 ; [L115] unsigned int __cil_tmp62 ; [L116] unsigned int __cil_tmp63 ; [L117] struct list_head const *__cil_tmp64 ; [L118] unsigned int __cil_tmp65 ; [L119] unsigned int __cil_tmp66 ; [L120] unsigned int __cil_tmp67 ; [L121] unsigned int __cil_tmp68 ; [L122] struct list_head *__cil_tmp69 ; [L123] unsigned int __cil_tmp70 ; [L124] int __cil_tmp71 ; [L125] struct node const *__cil_tmp72 ; [L126] unsigned int __cil_tmp73 ; [L127] unsigned int __cil_tmp74 ; [L128] int __cil_tmp75 ; [L129] unsigned int __cil_tmp76 ; [L130] unsigned int __cil_tmp77 ; [L131] struct list_head const *__cil_tmp78 ; [L132] struct node const *__cil_tmp79 ; [L133] unsigned int __cil_tmp80 ; [L134] unsigned int __cil_tmp81 ; [L135] int __cil_tmp82 ; [L136] int const *__cil_tmp83 ; [L137] struct node const *__cil_tmp84 ; [L138] unsigned int __cil_tmp85 ; [L139] unsigned int __cil_tmp86 ; [L140] int __cil_tmp87 ; [L141] unsigned int __cil_tmp88 ; [L142] unsigned int __cil_tmp89 ; [L143] struct list_head *__cil_tmp90 ; [L144] unsigned int __cil_tmp91 ; [L145] unsigned int __cil_tmp92 ; [L146] struct list_head *__cil_tmp93 ; [L147] unsigned int __cil_tmp94 ; [L148] unsigned int __cil_tmp95 ; [L149] int __cil_tmp96 ; [L150] unsigned int __cil_tmp97 ; [L151] unsigned int __cil_tmp98 ; [L152] unsigned int __cil_tmp99 ; [L153] struct list_head *__cil_tmp100 ; [L154] struct list_head *__cil_tmp101 ; [L155] unsigned int __cil_tmp102 ; [L156] unsigned int __cil_tmp103 ; [L157] int __cil_tmp104 ; [L158] struct list_head *__cil_tmp105 ; [L159] unsigned int __cil_tmp106 ; [L160] unsigned int __cil_tmp107 ; [L161] unsigned int __cil_tmp108 ; [L162] struct list_head const *__cil_tmp109 ; [L163] unsigned int __cil_tmp110 ; [L164] struct list_head *__cil_tmp111 ; [L165] unsigned int __cil_tmp112 ; [L166] struct node *__cil_tmp113 ; [L167] unsigned int __cil_tmp114 ; [L168] unsigned int __cil_tmp115 ; [L169] struct list_head *__cil_tmp116 ; [L170] unsigned long __cil_tmp117 ; [L171] char *__cil_tmp118 ; [L172] char *__cil_tmp119 ; [L173] struct node *__cil_tmp120 ; [L174] unsigned int __cil_tmp121 ; [L175] int __cil_tmp122 ; VAL [\old(head)={5:0}, gl_list={5:0}, head={5:0}] [L179] COND TRUE 1 VAL [\old(head)={5:0}, gl_list={5:0}, head={5:0}] [L181] COND FALSE !(! head) VAL [\old(head)={5:0}, gl_list={5:0}, head={5:0}] [L192] COND TRUE 1 [L195] __cil_tmp3 = (unsigned int )head [L196] EXPR \read(*head) [L196] __cil_tmp4 = *((struct list_head * const *)head) [L197] __cil_tmp5 = (unsigned int )__cil_tmp4 [L198] __cil_tmp6 = __cil_tmp5 != __cil_tmp3 VAL [\old(head)={5:0}, __cil_tmp6=0, gl_list={5:0}, head={5:0}] [L199] COND TRUE ! __cil_tmp6 VAL [\old(head)={5:0}, gl_list={5:0}, head={5:0}] [L201] CALL fail() VAL [gl_list={5:0}] [L46] reach_error() VAL [gl_list={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 479 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 506 IncrementalHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 114 mSDtfsCounter, 506 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-10-12 18:28:02,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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