./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.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 f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:51:14,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:51:14,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:51:14,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:51:14,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:51:14,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:51:14,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:51:14,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:51:14,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:51:14,258 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:51:14,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:51:14,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:51:14,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:51:14,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:51:14,262 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:51:14,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:51:14,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:51:14,263 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:51:14,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:51:14,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:51:14,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:51:14,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:51:14,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:51:14,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:51:14,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:51:14,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:51:14,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:51:14,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:51:14,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:51:14,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:51:14,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:51:14,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:51:14,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:51:14,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:51:14,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:51:14,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:51:14,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:51:14,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:51:14,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:51:14,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:51:14,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:51:14,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:51:14,273 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 -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2024-11-08 13:51:14,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:51:14,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:51:14,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:51:14,546 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:51:14,546 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:51:14,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2024-11-08 13:51:15,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:51:16,194 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:51:16,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2024-11-08 13:51:16,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816570ea1/c920c73937df4ff18b47ab68026b1f35/FLAG1a0d5ac1c [2024-11-08 13:51:16,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816570ea1/c920c73937df4ff18b47ab68026b1f35 [2024-11-08 13:51:16,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:51:16,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:51:16,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:51:16,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:51:16,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:51:16,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b35bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16, skipping insertion in model container [2024-11-08 13:51:16,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:51:16,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2024-11-08 13:51:16,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:51:16,623 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:51:16,663 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2024-11-08 13:51:16,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:51:16,721 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:51:16,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16 WrapperNode [2024-11-08 13:51:16,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:51:16,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:51:16,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:51:16,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:51:16,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,774 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 205 [2024-11-08 13:51:16,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:51:16,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:51:16,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:51:16,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:51:16,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,788 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,821 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 8, 18, 8, 6]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 0, 1]. The 10 writes are split as follows [0, 1, 7, 1, 1]. [2024-11-08 13:51:16,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,832 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:51:16,844 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:51:16,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:51:16,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:51:16,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (1/1) ... [2024-11-08 13:51:16,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:51:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:16,904 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-11-08 13:51:16,910 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-11-08 13:51:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-08 13:51:16,983 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-08 13:51:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:51:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:51:16,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:51:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:51:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:51:16,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:51:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-08 13:51:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-08 13:51:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:51:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:51:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:51:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-08 13:51:16,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-08 13:51:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-08 13:51:16,986 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-08 13:51:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:51:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:51:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:51:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:51:16,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-08 13:51:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-08 13:51:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-08 13:51:16,987 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-08 13:51:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:51:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:51:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:51:16,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 13:51:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 13:51:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-08 13:51:16,988 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-08 13:51:16,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:51:16,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:51:17,123 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:51:17,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:51:17,447 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-08 13:51:17,448 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:51:17,464 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:51:17,464 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-08 13:51:17,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:51:17 BoogieIcfgContainer [2024-11-08 13:51:17,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:51:17,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:51:17,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:51:17,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:51:17,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:51:16" (1/3) ... [2024-11-08 13:51:17,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746d91e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:51:17, skipping insertion in model container [2024-11-08 13:51:17,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:51:16" (2/3) ... [2024-11-08 13:51:17,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746d91e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:51:17, skipping insertion in model container [2024-11-08 13:51:17,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:51:17" (3/3) ... [2024-11-08 13:51:17,474 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2024-11-08 13:51:17,489 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:51:17,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:51:17,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:51:17,552 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;@50a4682f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:51:17,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:51:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 83 states have internal predecessors, (125), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 13:51:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 13:51:17,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:17,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:17,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:17,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1657014822, now seen corresponding path program 1 times [2024-11-08 13:51:17,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057797703] [2024-11-08 13:51:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:51:17,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:17,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057797703] [2024-11-08 13:51:17,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057797703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:51:17,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:51:17,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:51:17,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993979722] [2024-11-08 13:51:17,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:51:17,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:51:17,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:51:17,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:51:17,856 INFO L87 Difference]: Start difference. First operand has 96 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 83 states have internal predecessors, (125), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-11-08 13:51:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:17,901 INFO L93 Difference]: Finished difference Result 188 states and 324 transitions. [2024-11-08 13:51:17,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:51:17,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 16 [2024-11-08 13:51:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:17,915 INFO L225 Difference]: With dead ends: 188 [2024-11-08 13:51:17,915 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 13:51:17,920 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-11-08 13:51:17,926 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:17,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:51:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 13:51:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-08 13:51:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 76 states have internal predecessors, (83), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:51:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2024-11-08 13:51:17,975 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 16 [2024-11-08 13:51:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:17,976 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2024-11-08 13:51:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-11-08 13:51:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2024-11-08 13:51:17,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 13:51:17,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:17,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:17,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:51:17,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:17,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2109362787, now seen corresponding path program 1 times [2024-11-08 13:51:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452983226] [2024-11-08 13:51:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:18,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 13:51:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:51:18,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:18,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452983226] [2024-11-08 13:51:18,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452983226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:18,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734082611] [2024-11-08 13:51:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:18,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:18,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:18,936 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:51:18,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:51:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:19,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 13:51:19,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:19,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 13:51:19,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2024-11-08 13:51:19,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 13:51:19,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-08 13:51:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:51:19,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:19,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-08 13:51:19,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-08 13:51:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:51:19,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734082611] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:19,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 13 [2024-11-08 13:51:19,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956651612] [2024-11-08 13:51:19,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:19,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 13:51:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:19,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 13:51:19,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-08 13:51:19,617 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:51:23,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:51:27,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:51:31,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:51:35,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:51:39,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:51:43,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:51:47,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:51:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:48,418 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2024-11-08 13:51:48,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 13:51:48,419 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-08 13:51:48,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:48,422 INFO L225 Difference]: With dead ends: 116 [2024-11-08 13:51:48,422 INFO L226 Difference]: Without dead ends: 113 [2024-11-08 13:51:48,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2024-11-08 13:51:48,424 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 149 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 38 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:48,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 443 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 640 Invalid, 7 Unknown, 0 Unchecked, 28.5s Time] [2024-11-08 13:51:48,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-08 13:51:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2024-11-08 13:51:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 92 states have internal predecessors, (102), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:51:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2024-11-08 13:51:48,446 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 33 [2024-11-08 13:51:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:48,447 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2024-11-08 13:51:48,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:51:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2024-11-08 13:51:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 13:51:48,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:48,448 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:48,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:51:48,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:48,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:48,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash 120227463, now seen corresponding path program 1 times [2024-11-08 13:51:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068543707] [2024-11-08 13:51:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:48,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:49,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:51:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:49,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 13:51:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:51:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:51:49,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068543707] [2024-11-08 13:51:49,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068543707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:51:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023947558] [2024-11-08 13:51:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:49,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:51:49,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:51:49,169 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:51:49,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:51:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:51:49,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 13:51:49,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:51:49,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:51:49,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 13:51:49,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-08 13:51:49,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 13:51:49,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 13:51:49,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:51:49,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 13:51:49,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:51:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:51:49,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:51:50,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-08 13:51:50,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:50,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:51:50,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2024-11-08 13:51:50,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-08 13:51:50,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-11-08 13:51:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:51:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023947558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:51:50,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:51:50,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 28 [2024-11-08 13:51:50,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136449308] [2024-11-08 13:51:50,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:51:50,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-08 13:51:50,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:51:50,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-08 13:51:50,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2024-11-08 13:51:50,294 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 28 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 9 states have call successors, (9), 7 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:51:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:51:52,239 INFO L93 Difference]: Finished difference Result 214 states and 255 transitions. [2024-11-08 13:51:52,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 13:51:52,239 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 9 states have call successors, (9), 7 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 35 [2024-11-08 13:51:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:51:52,241 INFO L225 Difference]: With dead ends: 214 [2024-11-08 13:51:52,241 INFO L226 Difference]: Without dead ends: 211 [2024-11-08 13:51:52,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=253, Invalid=2609, Unknown=0, NotChecked=0, Total=2862 [2024-11-08 13:51:52,247 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 410 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:51:52,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 965 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 13:51:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-08 13:51:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 106. [2024-11-08 13:51:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.216867469879518) internal successors, (101), 92 states have internal predecessors, (101), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 13:51:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2024-11-08 13:51:52,279 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 35 [2024-11-08 13:51:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:51:52,280 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2024-11-08 13:51:52,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 9 states have call successors, (9), 7 states have call predecessors, (9), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:51:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2024-11-08 13:51:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 13:51:52,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:51:52,282 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:51:52,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:51:52,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 13:51:52,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:51:52,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:51:52,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1648784627, now seen corresponding path program 1 times [2024-11-08 13:51:52,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:51:52,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822738141] [2024-11-08 13:51:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:51:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:51:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:51:52,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 13:51:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:51:52,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 13:51:52,585 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 13:51:52,586 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:51:52,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:51:52,591 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 13:51:52,627 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:51:52,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:51:52 BoogieIcfgContainer [2024-11-08 13:51:52,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:51:52,633 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:51:52,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:51:52,634 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:51:52,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:51:17" (3/4) ... [2024-11-08 13:51:52,637 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 13:51:52,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 13:51:52,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:51:52,691 INFO L158 Benchmark]: Toolchain (without parser) took 36463.89ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 87.0MB in the beginning and 97.5MB in the end (delta: -10.5MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-11-08 13:51:52,691 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 104.9MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:51:52,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 495.62ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 66.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 13:51:52,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.93ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:51:52,692 INFO L158 Benchmark]: Boogie Preprocessor took 68.16ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 58.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 13:51:52,692 INFO L158 Benchmark]: RCFGBuilder took 620.49ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 58.6MB in the beginning and 137.7MB in the end (delta: -79.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-08 13:51:52,693 INFO L158 Benchmark]: TraceAbstraction took 35165.74ms. Allocated memory is still 190.8MB. Free memory was 137.7MB in the beginning and 100.7MB in the end (delta: 37.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-11-08 13:51:52,693 INFO L158 Benchmark]: Witness Printer took 57.18ms. Allocated memory is still 190.8MB. Free memory was 100.7MB in the beginning and 97.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 13:51:52,695 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.46ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 104.9MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 495.62ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 66.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.93ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.16ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 58.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 620.49ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 58.6MB in the beginning and 137.7MB in the end (delta: -79.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35165.74ms. Allocated memory is still 190.8MB. Free memory was 137.7MB in the beginning and 100.7MB in the end (delta: 37.0MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * Witness Printer took 57.18ms. Allocated memory is still 190.8MB. Free memory was 100.7MB in the beginning and 97.5MB in the end (delta: 3.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: 565]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L639] const struct node *p1, *p2; [L640] CALL, EXPR create_sll(&p1, &p2) [L588] struct node *list = ((void *)0); [L588] struct node *list = ((void *)0); [L590] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-1:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; VAL [\result={-1:0}] [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node VAL [\old(ppnode)={5:0}] [L590] RET chain_node(&list) VAL [list={5:0}, pp1={3:0}, pp2={6:0}] [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L597] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-2:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; VAL [\result={-2:0}] [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node VAL [\old(ppnode)={5:0}] [L597] RET chain_node(&list) VAL [list={5:0}] [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; VAL [\result={-2:0}] [L640] RET, EXPR create_sll(&p1, &p2) [L640] struct node *list = create_sll(&p1, &p2); [L642] EXPR \read(*p1) [L642] EXPR \read(*p2) [L642] CALL check_seq_next(p1, p2) VAL [\old(beg)={-1:0}, \old(end)={-1:0}] [L626] COND FALSE !(!(beg)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L627] COND FALSE !(!(end)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] COND TRUE !(beg) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] CALL fail() [L565] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 568 SdHoareTripleChecker+Valid, 29.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 1523 SdHoareTripleChecker+Invalid, 29.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1305 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2269 IncrementalHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 218 mSDtfsCounter, 2269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=2, InterpolantAutomatonStates: 53, 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, 3 MinimizatonAttempts, 112 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 213 ConstructedInterpolants, 12 QuantifiedInterpolants, 1949 SizeOfPredicates, 33 NumberOfNonLiveVariables, 668 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 6/36 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-11-08 13:51:52,720 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