./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 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/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-?-c7c6ca5-m [2024-11-08 14:45:53,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:45:53,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:45:53,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:45:53,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:45:53,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:45:53,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:45:53,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:45:53,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:45:53,859 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:45:53,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:45:53,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:45:53,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:45:53,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:45:53,862 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:45:53,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:45:53,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:45:53,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:45:53,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:45:53,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:45:53,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:45:53,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:45:53,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:45:53,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:45:53,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:45:53,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:45:53,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:45:53,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:45:53,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:45:53,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:45:53,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:45:53,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:45:53,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:45:53,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:45:53,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:45:53,874 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:45:53,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:45:53,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:45:53,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:45:53,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:45:53,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:45:53,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:45:53,875 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-08 14:45:54,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:45:54,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:45:54,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:45:54,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:45:54,087 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:45:54,088 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-08 14:45:55,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:45:55,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:45:55,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2024-11-08 14:45:55,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b4388ea/9ec84513b160457da884b2ed8ca42fe9/FLAG1cba9e528 [2024-11-08 14:45:55,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18b4388ea/9ec84513b160457da884b2ed8ca42fe9 [2024-11-08 14:45:55,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:45:55,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:45:55,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:45:55,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:45:55,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:45:55,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:45:55" (1/1) ... [2024-11-08 14:45:55,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d93446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:55, skipping insertion in model container [2024-11-08 14:45:55,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:45:55" (1/1) ... [2024-11-08 14:45:55,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:45:55,972 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-08 14:45:55,992 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-08 14:45:56,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:45:56,012 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:45:56,020 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-08 14:45:56,024 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-08 14:45:56,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:45:56,042 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:45:56,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56 WrapperNode [2024-11-08 14:45:56,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:45:56,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:45:56,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:45:56,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:45:56,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,071 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 109 [2024-11-08 14:45:56,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:45:56,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:45:56,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:45:56,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:45:56,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,108 INFO L175 MemorySlicer]: Split 27 memory accesses to 4 slices as follows [5, 2, 2, 18]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0]. The 7 writes are split as follows [2, 0, 1, 4]. [2024-11-08 14:45:56,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:45:56,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:45:56,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:45:56,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:45:56,127 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (1/1) ... [2024-11-08 14:45:56,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:45:56,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:45:56,156 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 14:45:56,158 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 14:45:56,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:45:56,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 14:45:56,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 14:45:56,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 14:45:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 14:45:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-08 14:45:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 14:45:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 14:45:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 14:45:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 14:45:56,197 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-08 14:45:56,197 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-08 14:45:56,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 14:45:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 14:45:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 14:45:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 14:45:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-08 14:45:56,199 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-08 14:45:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 14:45:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 14:45:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 14:45:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-08 14:45:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-08 14:45:56,200 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-08 14:45:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:45:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:45:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 14:45:56,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 14:45:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 14:45:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-08 14:45:56,201 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-08 14:45:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:45:56,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:45:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 14:45:56,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 14:45:56,201 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-08 14:45:56,201 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-08 14:45:56,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 14:45:56,317 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:45:56,318 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:45:56,599 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-11-08 14:45:56,599 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:45:56,613 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:45:56,613 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 14:45:56,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:45:56 BoogieIcfgContainer [2024-11-08 14:45:56,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:45:56,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:45:56,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:45:56,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:45:56,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:45:55" (1/3) ... [2024-11-08 14:45:56,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116d78cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:45:56, skipping insertion in model container [2024-11-08 14:45:56,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:56" (2/3) ... [2024-11-08 14:45:56,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116d78cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:45:56, skipping insertion in model container [2024-11-08 14:45:56,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:45:56" (3/3) ... [2024-11-08 14:45:56,622 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2024-11-08 14:45:56,635 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:45:56,635 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:45:56,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:45:56,699 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;@108c2170, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:45:56,700 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:45:56,704 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-08 14:45:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 14:45:56,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:56,725 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-08 14:45:56,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 206162836, now seen corresponding path program 1 times [2024-11-08 14:45:56,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:56,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765014656] [2024-11-08 14:45:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:56,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:45:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:45:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 14:45:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,173 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 14:45:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765014656] [2024-11-08 14:45:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765014656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:45:57,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:45:57,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 14:45:57,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046256923] [2024-11-08 14:45:57,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:45:57,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 14:45:57,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:57,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 14:45:57,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:45:57,203 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 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 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-08 14:45:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:57,609 INFO L93 Difference]: Finished difference Result 145 states and 199 transitions. [2024-11-08 14:45:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 14:45:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 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-08 14:45:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:57,620 INFO L225 Difference]: With dead ends: 145 [2024-11-08 14:45:57,620 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 14:45:57,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:45:57,627 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 98 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:57,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 209 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 14:45:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 14:45:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-11-08 14:45:57,659 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-08 14:45:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-08 14:45:57,662 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 37 [2024-11-08 14:45:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:57,662 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-08 14:45:57,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 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-08 14:45:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-08 14:45:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 14:45:57,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:57,665 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-08 14:45:57,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:45:57,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:57,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:57,666 INFO L85 PathProgramCache]: Analyzing trace with hash -162761303, now seen corresponding path program 1 times [2024-11-08 14:45:57,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:57,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080886825] [2024-11-08 14:45:57,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:45:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:45:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:45:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 14:45:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 14:45:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,985 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-08 14:45:57,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:57,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080886825] [2024-11-08 14:45:57,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080886825] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:45:57,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449583024] [2024-11-08 14:45:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:57,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:45:57,988 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 14:45:57,989 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 14:45:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:58,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 14:45:58,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:45:58,186 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-08 14:45:58,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:45:58,354 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-08 14:45:58,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449583024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:45:58,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:45:58,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-11-08 14:45:58,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118335892] [2024-11-08 14:45:58,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:45:58,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 14:45:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:58,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 14:45:58,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:45:58,358 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-08 14:45:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:58,873 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2024-11-08 14:45:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:45:58,874 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 49 [2024-11-08 14:45:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:58,875 INFO L225 Difference]: With dead ends: 141 [2024-11-08 14:45:58,876 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 14:45:58,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-08 14:45:58,877 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 66 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:58,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 370 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 14:45:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 14:45:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-08 14:45:58,890 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-08 14:45:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2024-11-08 14:45:58,895 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 49 [2024-11-08 14:45:58,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:58,896 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2024-11-08 14:45:58,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-08 14:45:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2024-11-08 14:45:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 14:45:58,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:58,897 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-08 14:45:58,914 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 14:45:59,098 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 14:45:59,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:59,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash -972646618, now seen corresponding path program 1 times [2024-11-08 14:45:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468176668] [2024-11-08 14:45:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:45:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 14:45:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 14:45:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:45:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 14:45:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 14:45:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,317 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-08 14:45:59,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:59,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468176668] [2024-11-08 14:45:59,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468176668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:45:59,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:45:59,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 14:45:59,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139512804] [2024-11-08 14:45:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:45:59,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:45:59,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:59,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:45:59,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:45:59,320 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 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-08 14:45:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:59,719 INFO L93 Difference]: Finished difference Result 141 states and 186 transitions. [2024-11-08 14:45:59,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:45:59,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 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-08 14:45:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:59,722 INFO L225 Difference]: With dead ends: 141 [2024-11-08 14:45:59,722 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 14:45:59,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-08 14:45:59,723 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 87 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:59,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 281 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 14:45:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 14:45:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-08 14:45:59,739 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-08 14:45:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2024-11-08 14:45:59,741 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 61 [2024-11-08 14:45:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:59,742 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2024-11-08 14:45:59,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 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-08 14:45:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2024-11-08 14:45:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 14:45:59,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:59,746 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-08 14:45:59,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:45:59,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:59,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:59,747 INFO L85 PathProgramCache]: Analyzing trace with hash -338276188, now seen corresponding path program 1 times [2024-11-08 14:45:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:59,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53721724] [2024-11-08 14:45:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:45:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 14:45:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:45:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 14:45:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:45:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:59,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 14:45:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:46:00,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 14:46:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:46:00,030 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-08 14:46:00,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:46:00,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53721724] [2024-11-08 14:46:00,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53721724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:46:00,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903932233] [2024-11-08 14:46:00,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:46:00,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:46:00,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:46:00,036 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 14:46:00,037 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 14:46:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:46:00,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 14:46:00,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:46:00,187 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-08 14:46:00,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:46:00,348 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-08 14:46:00,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903932233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:46:00,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:46:00,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 16 [2024-11-08 14:46:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575984583] [2024-11-08 14:46:00,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:46:00,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 14:46:00,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:46:00,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 14:46:00,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-08 14:46:00,350 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-08 14:46:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:46:00,887 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2024-11-08 14:46:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:46:00,887 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 74 [2024-11-08 14:46:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:46:00,890 INFO L225 Difference]: With dead ends: 133 [2024-11-08 14:46:00,890 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 14:46:00,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2024-11-08 14:46:00,893 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 103 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:46:00,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 390 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 14:46:00,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 14:46:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2024-11-08 14:46:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2024-11-08 14:46:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2024-11-08 14:46:00,905 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 74 [2024-11-08 14:46:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:46:00,907 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2024-11-08 14:46:00,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 12 states have internal predecessors, (46), 6 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-08 14:46:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2024-11-08 14:46:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 14:46:00,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:46:00,913 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-08 14:46:00,925 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 14:46:01,116 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-08 14:46:01,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:46:01,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:46:01,117 INFO L85 PathProgramCache]: Analyzing trace with hash 471199463, now seen corresponding path program 1 times [2024-11-08 14:46:01,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:46:01,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774273697] [2024-11-08 14:46:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:46:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:46:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 14:46:01,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 14:46:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 14:46:01,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 14:46:01,186 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 14:46:01,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:46:01,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 14:46:01,190 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 14:46:01,216 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:46:01,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:46:01 BoogieIcfgContainer [2024-11-08 14:46:01,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:46:01,219 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:46:01,219 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:46:01,219 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:46:01,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:45:56" (3/4) ... [2024-11-08 14:46:01,220 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 14:46:01,266 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 14:46:01,266 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:46:01,267 INFO L158 Benchmark]: Toolchain (without parser) took 5440.99ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 95.9MB in the beginning and 105.6MB in the end (delta: -9.7MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-08 14:46:01,269 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory was 104.9MB in the beginning and 104.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:46:01,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.78ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 80.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 14:46:01,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.77ms. Allocated memory is still 138.4MB. Free memory was 80.7MB in the beginning and 79.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:46:01,269 INFO L158 Benchmark]: Boogie Preprocessor took 47.41ms. Allocated memory is still 138.4MB. Free memory was 79.1MB in the beginning and 75.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:46:01,269 INFO L158 Benchmark]: RCFGBuilder took 490.89ms. Allocated memory is still 138.4MB. Free memory was 75.4MB in the beginning and 50.4MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 14:46:01,270 INFO L158 Benchmark]: TraceAbstraction took 4602.79ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 49.7MB in the beginning and 108.7MB in the end (delta: -59.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:46:01,270 INFO L158 Benchmark]: Witness Printer took 47.25ms. Allocated memory is still 178.3MB. Free memory was 108.7MB in the beginning and 105.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 14:46:01,271 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.16ms. Allocated memory is still 138.4MB. Free memory was 104.9MB in the beginning and 104.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.78ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 80.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.77ms. Allocated memory is still 138.4MB. Free memory was 80.7MB in the beginning and 79.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.41ms. Allocated memory is still 138.4MB. Free memory was 79.1MB in the beginning and 75.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.89ms. Allocated memory is still 138.4MB. Free memory was 75.4MB in the beginning and 50.4MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4602.79ms. Allocated memory was 138.4MB in the beginning and 178.3MB in the end (delta: 39.8MB). Free memory was 49.7MB in the beginning and 108.7MB in the end (delta: -59.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 47.25ms. Allocated memory is still 178.3MB. Free memory was 108.7MB in the beginning and 105.6MB in the end (delta: 3.1MB). 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: 4.5s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 1250 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1062 mSDsCounter, 265 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2173 IncrementalHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 265 mSolverCounterUnsat, 188 mSDtfsCounter, 2173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=4, InterpolantAutomatonStates: 45, 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, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1294 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-08 14:46:01,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE