./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/verifythis/tree_del_iter_incorrect.c -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 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 13:56:06,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 13:56:06,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 13:56:06,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 13:56:06,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 13:56:06,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 13:56:06,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 13:56:06,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 13:56:06,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 13:56:06,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 13:56:06,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 13:56:06,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 13:56:06,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 13:56:06,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 13:56:06,389 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 13:56:06,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 13:56:06,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 13:56:06,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 13:56:06,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 13:56:06,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 13:56:06,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 13:56:06,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 13:56:06,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 13:56:06,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 13:56:06,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 13:56:06,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 13:56:06,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 13:56:06,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 13:56:06,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 13:56:06,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 13:56:06,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 13:56:06,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 13:56:06,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:56:06,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 13:56:06,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 13:56:06,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 13:56:06,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 13:56:06,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 13:56:06,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 13:56:06,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 13:56:06,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 13:56:06,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 13:56:06,397 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 -> 11dfc9c267e4b15a18edd43bd8f373e4d6af1fa864b5f35e9818e0875ad24411 [2024-11-18 13:56:06,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 13:56:06,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 13:56:06,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 13:56:06,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 13:56:06,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 13:56:06,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2024-11-18 13:56:07,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 13:56:07,960 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 13:56:07,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2024-11-18 13:56:07,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3c1502d/8cf01742ead24823ae91b0ef473353ee/FLAG55b0c3f20 [2024-11-18 13:56:08,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3c1502d/8cf01742ead24823ae91b0ef473353ee [2024-11-18 13:56:08,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 13:56:08,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 13:56:08,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 13:56:08,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 13:56:08,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 13:56:08,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3180734a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08, skipping insertion in model container [2024-11-18 13:56:08,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 13:56:08,538 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/verifythis/tree_del_iter_incorrect.c[619,632] [2024-11-18 13:56:08,562 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-18 13:56:08,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:56:08,579 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 13:56:08,588 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/verifythis/tree_del_iter_incorrect.c[619,632] [2024-11-18 13:56:08,611 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-18 13:56:08,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 13:56:08,639 INFO L204 MainTranslator]: Completed translation [2024-11-18 13:56:08,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08 WrapperNode [2024-11-18 13:56:08,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 13:56:08,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 13:56:08,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 13:56:08,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 13:56:08,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,680 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 109 [2024-11-18 13:56:08,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 13:56:08,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 13:56:08,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 13:56:08,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 13:56:08,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,717 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [2, 18, 2, 5]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 4, 1, 2]. [2024-11-18 13:56:08,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 13:56:08,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 13:56:08,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 13:56:08,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 13:56:08,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (1/1) ... [2024-11-18 13:56:08,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 13:56:08,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:56:08,772 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-18 13:56:08,774 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-18 13:56:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 13:56:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 13:56:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-18 13:56:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-18 13:56:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-18 13:56:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-18 13:56:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-18 13:56:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-18 13:56:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-18 13:56:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-18 13:56:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-18 13:56:08,813 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-18 13:56:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 13:56:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 13:56:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 13:56:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-18 13:56:08,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-18 13:56:08,814 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-18 13:56:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-18 13:56:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-18 13:56:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-18 13:56:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-18 13:56:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-18 13:56:08,815 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-18 13:56:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 13:56:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 13:56:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 13:56:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-18 13:56:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-18 13:56:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-18 13:56:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-18 13:56:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 13:56:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 13:56:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-18 13:56:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-18 13:56:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-18 13:56:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-18 13:56:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 13:56:08,948 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 13:56:08,950 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 13:56:09,166 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-11-18 13:56:09,166 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 13:56:09,178 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 13:56:09,178 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 13:56:09,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:56:09 BoogieIcfgContainer [2024-11-18 13:56:09,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 13:56:09,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 13:56:09,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 13:56:09,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 13:56:09,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:56:08" (1/3) ... [2024-11-18 13:56:09,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38915e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:56:09, skipping insertion in model container [2024-11-18 13:56:09,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:08" (2/3) ... [2024-11-18 13:56:09,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38915e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:56:09, skipping insertion in model container [2024-11-18 13:56:09,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:56:09" (3/3) ... [2024-11-18 13:56:09,184 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2024-11-18 13:56:09,196 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 13:56:09,196 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 13:56:09,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 13:56:09,249 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;@50fe13bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 13:56:09,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 13:56:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-18 13:56:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-18 13:56:09,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:56:09,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:56:09,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:56:09,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:56:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 206162836, now seen corresponding path program 1 times [2024-11-18 13:56:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:56:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92296955] [2024-11-18 13:56:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:56:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:56:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:56:09,650 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-18 13:56:09,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:56:09,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92296955] [2024-11-18 13:56:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92296955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:56:09,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:56:09,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 13:56:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531912993] [2024-11-18 13:56:09,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:56:09,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 13:56:09,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:56:09,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 13:56:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:56:09,689 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 13:56:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:56:09,762 INFO L93 Difference]: Finished difference Result 140 states and 189 transitions. [2024-11-18 13:56:09,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 13:56:09,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-18 13:56:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:56:09,771 INFO L225 Difference]: With dead ends: 140 [2024-11-18 13:56:09,771 INFO L226 Difference]: Without dead ends: 78 [2024-11-18 13:56:09,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 13:56:09,776 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:56:09,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:56:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-18 13:56:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-18 13:56:09,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.16) internal successors, (58), 51 states have internal predecessors, (58), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-18 13:56:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-18 13:56:09,812 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 37 [2024-11-18 13:56:09,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:56:09,812 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-18 13:56:09,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-18 13:56:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-18 13:56:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-18 13:56:09,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:56:09,815 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:56:09,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 13:56:09,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:56:09,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:56:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -162761303, now seen corresponding path program 1 times [2024-11-18 13:56:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:56:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117950614] [2024-11-18 13:56:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:56:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:56:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:56:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 13:56:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:56:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117950614] [2024-11-18 13:56:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117950614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:56:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331713775] [2024-11-18 13:56:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:56:10,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:56:10,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:56:10,056 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-18 13:56:10,058 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-18 13:56:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:56:10,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 13:56:10,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:56:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 13:56:10,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:56:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 13:56:10,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331713775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:56:10,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:56:10,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-18 13:56:10,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89580083] [2024-11-18 13:56:10,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:56:10,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 13:56:10,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:56:10,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 13:56:10,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:56:10,454 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-18 13:56:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:56:10,542 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2024-11-18 13:56:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 13:56:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 49 [2024-11-18 13:56:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:56:10,545 INFO L225 Difference]: With dead ends: 138 [2024-11-18 13:56:10,546 INFO L226 Difference]: Without dead ends: 80 [2024-11-18 13:56:10,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-18 13:56:10,549 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 13:56:10,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 616 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 13:56:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-18 13:56:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-18 13:56:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2024-11-18 13:56:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2024-11-18 13:56:10,567 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 49 [2024-11-18 13:56:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:56:10,568 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2024-11-18 13:56:10,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-18 13:56:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2024-11-18 13:56:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-18 13:56:10,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:56:10,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:56:10,584 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-18 13:56:10,770 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-18 13:56:10,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:56:10,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:56:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash -972646618, now seen corresponding path program 1 times [2024-11-18 13:56:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:56:10,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514856302] [2024-11-18 13:56:10,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:56:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:56:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:56:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-18 13:56:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:56:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514856302] [2024-11-18 13:56:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514856302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 13:56:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 13:56:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 13:56:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485671995] [2024-11-18 13:56:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 13:56:10,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 13:56:10,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:56:10,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 13:56:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:56:10,935 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-18 13:56:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:56:10,995 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2024-11-18 13:56:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 13:56:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2024-11-18 13:56:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:56:10,997 INFO L225 Difference]: With dead ends: 138 [2024-11-18 13:56:10,997 INFO L226 Difference]: Without dead ends: 82 [2024-11-18 13:56:10,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-18 13:56:10,999 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 22 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 13:56:10,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 585 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 13:56:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-18 13:56:11,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-18 13:56:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 55 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2024-11-18 13:56:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2024-11-18 13:56:11,013 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 61 [2024-11-18 13:56:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:56:11,014 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2024-11-18 13:56:11,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-18 13:56:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2024-11-18 13:56:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-18 13:56:11,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:56:11,017 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 13:56:11,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 13:56:11,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:56:11,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:56:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash -338276188, now seen corresponding path program 1 times [2024-11-18 13:56:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:56:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987804652] [2024-11-18 13:56:11,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:56:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:56:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:56:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-18 13:56:11,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 13:56:11,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987804652] [2024-11-18 13:56:11,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987804652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 13:56:11,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398579980] [2024-11-18 13:56:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:56:11,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 13:56:11,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 13:56:11,234 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-18 13:56:11,235 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-18 13:56:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 13:56:11,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 13:56:11,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 13:56:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-18 13:56:11,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 13:56:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-18 13:56:11,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398579980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 13:56:11,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 13:56:11,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16 [2024-11-18 13:56:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289639045] [2024-11-18 13:56:11,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 13:56:11,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-18 13:56:11,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 13:56:11,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-18 13:56:11,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-18 13:56:11,609 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 8 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-11-18 13:56:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 13:56:11,845 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2024-11-18 13:56:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 13:56:11,845 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 8 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) Word has length 74 [2024-11-18 13:56:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 13:56:11,847 INFO L225 Difference]: With dead ends: 134 [2024-11-18 13:56:11,847 INFO L226 Difference]: Without dead ends: 86 [2024-11-18 13:56:11,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-18 13:56:11,848 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 13:56:11,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 805 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 13:56:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-18 13:56:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-18 13:56:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 58 states have internal predecessors, (63), 20 states have call successors, (20), 7 states have call predecessors, (20), 10 states have return successors, (29), 20 states have call predecessors, (29), 20 states have call successors, (29) [2024-11-18 13:56:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2024-11-18 13:56:11,862 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 74 [2024-11-18 13:56:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 13:56:11,862 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-18 13:56:11,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 15 states have internal predecessors, (53), 8 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-11-18 13:56:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2024-11-18 13:56:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-18 13:56:11,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 13:56:11,866 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 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-18 13:56:11,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 13:56:12,067 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,SelfDestructingSolverStorable3 [2024-11-18 13:56:12,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 13:56:12,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 13:56:12,069 INFO L85 PathProgramCache]: Analyzing trace with hash 471199463, now seen corresponding path program 1 times [2024-11-18 13:56:12,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 13:56:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724356136] [2024-11-18 13:56:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 13:56:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 13:56:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 13:56:12,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 13:56:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 13:56:12,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 13:56:12,149 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 13:56:12,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 13:56:12,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 13:56:12,154 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-18 13:56:12,192 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 13:56:12,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:56:12 BoogieIcfgContainer [2024-11-18 13:56:12,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 13:56:12,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 13:56:12,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 13:56:12,197 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 13:56:12,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:56:09" (3/4) ... [2024-11-18 13:56:12,198 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 13:56:12,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 13:56:12,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 13:56:12,248 INFO L158 Benchmark]: Toolchain (without parser) took 3878.39ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 85.3MB in the beginning and 85.3MB in the end (delta: -30.8kB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2024-11-18 13:56:12,248 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 110.0MB in the beginning and 109.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 13:56:12,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.48ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 127.2MB in the end (delta: -42.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-18 13:56:12,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.31ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 127.1MB in the beginning and 183.1MB in the end (delta: -55.9MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-18 13:56:12,249 INFO L158 Benchmark]: Boogie Preprocessor took 53.29ms. Allocated memory is still 211.8MB. Free memory was 183.1MB in the beginning and 178.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 13:56:12,249 INFO L158 Benchmark]: RCFGBuilder took 443.90ms. Allocated memory is still 211.8MB. Free memory was 178.9MB in the beginning and 153.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-18 13:56:12,249 INFO L158 Benchmark]: TraceAbstraction took 3016.06ms. Allocated memory is still 211.8MB. Free memory was 153.7MB in the beginning and 89.5MB in the end (delta: 64.2MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2024-11-18 13:56:12,250 INFO L158 Benchmark]: Witness Printer took 50.84ms. Allocated memory is still 211.8MB. Free memory was 89.5MB in the beginning and 85.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 13:56:12,251 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.14ms. Allocated memory is still 159.4MB. Free memory was 110.0MB in the beginning and 109.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.48ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 127.2MB in the end (delta: -42.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.31ms. Allocated memory was 159.4MB in the beginning and 211.8MB in the end (delta: 52.4MB). Free memory was 127.1MB in the beginning and 183.1MB in the end (delta: -55.9MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.29ms. Allocated memory is still 211.8MB. Free memory was 183.1MB in the beginning and 178.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 443.90ms. Allocated memory is still 211.8MB. Free memory was 178.9MB in the beginning and 153.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3016.06ms. Allocated memory is still 211.8MB. Free memory was 153.7MB in the beginning and 89.5MB in the end (delta: 64.2MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 50.84ms. Allocated memory is still 211.8MB. Free memory was 89.5MB in the beginning and 85.3MB 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L105] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}] [L105] RET, EXPR nondet_tree() [L105] CALL task(nondet_tree()) [L83] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [\old(n)={-1:0}, n={-1:0}] [L40] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L40] RET, EXPR min(n->left) VAL [\old(n)={-1:0}, n={-1:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [\old(n)={-1:0}, a=2147483647] [L41] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->right) VAL [\old(n)={-1:0}, a=2147483647] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\old(n)={-1:0}, \result=2147483647] [L83] RET, EXPR min(t) VAL [t={-1:0}] [L83] int a = min(t); [L84] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L86] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L78] COND FALSE !(!t) [L79] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\old(t)={0:0}, \result=0] [L79] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L79] EXPR t->right VAL [\old(t)={-1:0}] [L79] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L78] COND TRUE !t [L78] return 0; VAL [\old(t)={0:0}, \result=0] [L79] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L79] return size(t->left) + size(t->right) + 1; [L86] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L86] int n = size(t); [L87] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) [L87] RET assume_abort_if_not(n != 0) [L88] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L88] int *x = calloc(n, sizeof(int)); [L89] CALL tree_inorder(t, x, n) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}] [L67] COND FALSE !(!t) [L70] EXPR t->left VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L70] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-3:0}] [L70] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=1, t={-1:0}] [L70] i = tree_inorder(t->left, a, i) [L71] EXPR i++ [L71] EXPR t->data [L71] a[i++] = t->data [L72] EXPR t->right VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L72] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}] [L67] COND TRUE !t [L68] return i; VAL [\old(a)={-3:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-3:0}] [L72] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, a={-3:0}, i=2] [L72] i = tree_inorder(t->right, a, i) [L73] return i; VAL [\old(a)={-3:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-3:0}, i=2] [L89] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-3:0}] [L90] EXPR x[0] [L90] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0] [L16] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 2401 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2037 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 477 IncrementalHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 364 mSDtfsCounter, 477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=4, InterpolantAutomatonStates: 36, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1110 SizeOfPredicates, 6 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 156/168 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-18 13:56:12,274 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