./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 3289d67d 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.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:24:49,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:24:49,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:24:49,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:24:49,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:24:49,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:24:49,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:24:49,486 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:24:49,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:24:49,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:24:49,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:24:49,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:24:49,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:24:49,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:24:49,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:24:49,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:24:49,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:24:49,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:24:49,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:24:49,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:24:49,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:24:49,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:24:49,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:24:49,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:24:49,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:24:49,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:24:49,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:24:49,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:24:49,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:24:49,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:24:49,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:24:49,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:24:49,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:24:49,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:24:49,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:24:49,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:24:49,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:24:49,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:24:49,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:24:49,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:24:49,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:24:49,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:24:49,499 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-16 07:24:49,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:24:49,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:24:49,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:24:49,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:24:49,741 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:24:49,742 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-16 07:24:51,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:24:51,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:24:51,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter_incorrect.c [2024-11-16 07:24:51,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9cd2ff8/645183c5aa6a4695a0e51247ab934e38/FLAG6b5759614 [2024-11-16 07:24:51,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea9cd2ff8/645183c5aa6a4695a0e51247ab934e38 [2024-11-16 07:24:51,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:24:51,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:24:51,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:24:51,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:24:51,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:24:51,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:51,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a58ec70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51, skipping insertion in model container [2024-11-16 07:24:51,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:51,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:24:51,791 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-16 07:24:51,810 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-16 07:24:51,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:24:51,861 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:24:51,876 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-16 07:24:51,884 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-16 07:24:51,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:24:51,918 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:24:51,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51 WrapperNode [2024-11-16 07:24:51,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:24:51,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:24:51,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:24:51,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:24:51,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:51,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:51,961 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2024-11-16 07:24:51,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:24:51,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:24:51,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:24:51,962 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:24:51,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:51,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:51,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:51,993 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-16 07:24:51,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:51,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:52,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:52,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:52,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:52,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:52,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:24:52,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:24:52,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:24:52,018 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:24:52,018 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (1/1) ... [2024-11-16 07:24:52,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:24:52,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:24:52,062 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-16 07:24:52,070 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-16 07:24:52,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:24:52,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 07:24:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 07:24:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 07:24:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 07:24:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-16 07:24:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 07:24:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 07:24:52,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 07:24:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 07:24:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-16 07:24:52,101 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-16 07:24:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 07:24:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 07:24:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 07:24:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 07:24:52,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-16 07:24:52,101 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-16 07:24:52,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 07:24:52,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 07:24:52,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 07:24:52,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-16 07:24:52,102 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-16 07:24:52,102 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-16 07:24:52,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:24:52,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 07:24:52,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 07:24:52,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 07:24:52,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 07:24:52,103 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-16 07:24:52,103 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-16 07:24:52,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:24:52,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:24:52,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 07:24:52,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 07:24:52,104 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-16 07:24:52,104 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-16 07:24:52,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 07:24:52,259 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:24:52,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:24:52,340 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L39: havoc ~a~0, ~b~0; [2024-11-16 07:24:52,414 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc ~n~0.base, ~n~0.offset; [2024-11-16 07:24:52,677 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2024-11-16 07:24:52,677 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:24:52,690 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:24:52,690 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:24:52,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:24:52 BoogieIcfgContainer [2024-11-16 07:24:52,690 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:24:52,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:24:52,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:24:52,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:24:52,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:24:51" (1/3) ... [2024-11-16 07:24:52,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7818c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:24:52, skipping insertion in model container [2024-11-16 07:24:52,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:24:51" (2/3) ... [2024-11-16 07:24:52,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7818c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:24:52, skipping insertion in model container [2024-11-16 07:24:52,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:24:52" (3/3) ... [2024-11-16 07:24:52,697 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c [2024-11-16 07:24:52,708 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:24:52,708 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:24:52,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:24:52,757 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;@12394f57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:24:52,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:24:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 57 states have internal predecessors, (69), 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-16 07:24:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 07:24:52,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:24:52,775 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-16 07:24:52,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:24:52,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:24:52,780 INFO L85 PathProgramCache]: Analyzing trace with hash -556493083, now seen corresponding path program 1 times [2024-11-16 07:24:52,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:24:52,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962430651] [2024-11-16 07:24:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:24:52,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:24:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:24:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 07:24:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:24:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 07:24:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,066 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-16 07:24:53,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:24:53,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962430651] [2024-11-16 07:24:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962430651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:24:53,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:24:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 07:24:53,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234114986] [2024-11-16 07:24:53,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:24:53,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:24:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:24:53,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:24:53,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 07:24:53,092 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 57 states have internal predecessors, (69), 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), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 07:24:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:24:53,379 INFO L93 Difference]: Finished difference Result 146 states and 196 transitions. [2024-11-16 07:24:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:24:53,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-16 07:24:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:24:53,395 INFO L225 Difference]: With dead ends: 146 [2024-11-16 07:24:53,395 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 07:24:53,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:24:53,405 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 95 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:24:53,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 105 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 07:24:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 07:24:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-11-16 07:24:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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-16 07:24:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2024-11-16 07:24:53,497 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 37 [2024-11-16 07:24:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:24:53,497 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2024-11-16 07:24:53,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 07:24:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2024-11-16 07:24:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 07:24:53,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:24:53,500 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-16 07:24:53,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 07:24:53,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:24:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:24:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash 796816614, now seen corresponding path program 1 times [2024-11-16 07:24:53,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:24:53,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506818564] [2024-11-16 07:24:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:24:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:24:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:24:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 07:24:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 07:24:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 07:24:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:53,764 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-16 07:24:53,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:24:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506818564] [2024-11-16 07:24:53,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506818564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:24:53,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:24:53,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 07:24:53,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389764081] [2024-11-16 07:24:53,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:24:53,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 07:24:53,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:24:53,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 07:24:53,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:24:53,773 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. 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-16 07:24:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:24:54,112 INFO L93 Difference]: Finished difference Result 139 states and 181 transitions. [2024-11-16 07:24:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 07:24:54,113 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-16 07:24:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:24:54,116 INFO L225 Difference]: With dead ends: 139 [2024-11-16 07:24:54,117 INFO L226 Difference]: Without dead ends: 85 [2024-11-16 07:24:54,118 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-16 07:24:54,119 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 98 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:24:54,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 194 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:24:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-16 07:24:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2024-11-16 07:24:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 53 states have internal predecessors, (60), 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-16 07:24:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2024-11-16 07:24:54,140 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 37 [2024-11-16 07:24:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:24:54,140 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2024-11-16 07:24:54,141 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-16 07:24:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2024-11-16 07:24:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 07:24:54,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:24:54,142 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-16 07:24:54,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 07:24:54,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:24:54,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:24:54,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1316709563, now seen corresponding path program 1 times [2024-11-16 07:24:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:24:54,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352427769] [2024-11-16 07:24:54,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:24:54,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:24:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:24:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-16 07:24:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:54,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:24:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:54,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 07:24:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:54,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 07:24:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:54,423 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-16 07:24:54,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:24:54,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352427769] [2024-11-16 07:24:54,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352427769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:24:54,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059003776] [2024-11-16 07:24:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:24:54,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:24:54,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:24:54,425 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-16 07:24:54,427 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-16 07:24:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:54,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 07:24:54,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:24:54,622 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-16 07:24:54,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:24:54,758 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-16 07:24:54,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059003776] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:24:54,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:24:54,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-11-16 07:24:54,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442509869] [2024-11-16 07:24:54,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:24:54,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 07:24:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:24:54,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 07:24:54,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:24:54,760 INFO L87 Difference]: Start difference. First operand 80 states and 103 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-16 07:24:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:24:55,205 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2024-11-16 07:24:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 07:24:55,206 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-16 07:24:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:24:55,207 INFO L225 Difference]: With dead ends: 145 [2024-11-16 07:24:55,207 INFO L226 Difference]: Without dead ends: 85 [2024-11-16 07:24:55,208 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-16 07:24:55,209 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 96 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:24:55,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 266 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:24:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-16 07:24:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-16 07:24:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.150943396226415) internal successors, (61), 55 states have internal predecessors, (61), 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-16 07:24:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2024-11-16 07:24:55,217 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 49 [2024-11-16 07:24:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:24:55,218 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2024-11-16 07:24:55,218 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-16 07:24:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2024-11-16 07:24:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-16 07:24:55,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:24:55,219 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-16 07:24:55,236 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-16 07:24:55,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:24:55,421 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:24:55,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:24:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash -614713085, now seen corresponding path program 1 times [2024-11-16 07:24:55,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:24:55,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124563801] [2024-11-16 07:24:55,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:24:55,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:24:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:24:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:24:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 07:24:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:24:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 07:24:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 07:24:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:55,614 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-16 07:24:55,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:24:55,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124563801] [2024-11-16 07:24:55,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124563801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:24:55,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:24:55,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 07:24:55,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430190350] [2024-11-16 07:24:55,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:24:55,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 07:24:55,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:24:55,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 07:24:55,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:24:55,616 INFO L87 Difference]: Start difference. First operand 82 states and 106 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-16 07:24:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:24:56,119 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2024-11-16 07:24:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 07:24:56,120 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-16 07:24:56,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:24:56,121 INFO L225 Difference]: With dead ends: 145 [2024-11-16 07:24:56,121 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 07:24:56,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-16 07:24:56,122 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 120 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:24:56,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 277 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 07:24:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 07:24:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-16 07:24:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 57 states have internal predecessors, (62), 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-16 07:24:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2024-11-16 07:24:56,132 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 61 [2024-11-16 07:24:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:24:56,132 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2024-11-16 07:24:56,133 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-16 07:24:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2024-11-16 07:24:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-16 07:24:56,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:24:56,134 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-16 07:24:56,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 07:24:56,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:24:56,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:24:56,135 INFO L85 PathProgramCache]: Analyzing trace with hash -993567269, now seen corresponding path program 1 times [2024-11-16 07:24:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:24:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642642948] [2024-11-16 07:24:56,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:24:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:24:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:24:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-16 07:24:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:24:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 07:24:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 07:24:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 07:24:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 07:24:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:24:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,513 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-16 07:24:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:24:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642642948] [2024-11-16 07:24:56,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642642948] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:24:56,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807983627] [2024-11-16 07:24:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:24:56,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:24:56,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:24:56,516 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-16 07:24:56,517 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-16 07:24:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:24:56,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 07:24:56,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:24:56,703 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-16 07:24:56,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:24:56,928 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-16 07:24:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807983627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:24:56,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:24:56,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 17 [2024-11-16 07:24:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912823407] [2024-11-16 07:24:56,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:24:56,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 07:24:56,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:24:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 07:24:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-16 07:24:56,933 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 7 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-16 07:24:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:24:57,634 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2024-11-16 07:24:57,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 07:24:57,634 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 7 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2024-11-16 07:24:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:24:57,636 INFO L225 Difference]: With dead ends: 137 [2024-11-16 07:24:57,637 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 07:24:57,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2024-11-16 07:24:57,638 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 137 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 07:24:57,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 426 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 07:24:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 07:24:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-16 07:24:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 59 states have internal predecessors, (63), 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-16 07:24:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 113 transitions. [2024-11-16 07:24:57,653 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 113 transitions. Word has length 74 [2024-11-16 07:24:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:24:57,654 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 113 transitions. [2024-11-16 07:24:57,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 13 states have internal predecessors, (48), 7 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-16 07:24:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 113 transitions. [2024-11-16 07:24:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-16 07:24:57,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:24:57,655 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-16 07:24:57,692 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-16 07:24:57,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:24:57,856 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:24:57,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:24:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1870032434, now seen corresponding path program 1 times [2024-11-16 07:24:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:24:57,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888017360] [2024-11-16 07:24:57,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:24:57,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:24:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:24:57,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 07:24:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 07:24:57,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 07:24:57,923 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 07:24:57,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 07:24:57,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:24:57,927 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 07:24:57,956 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 07:24:57,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:24:57 BoogieIcfgContainer [2024-11-16 07:24:57,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 07:24:57,959 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 07:24:57,959 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 07:24:57,959 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 07:24:57,960 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:24:52" (3/4) ... [2024-11-16 07:24:57,960 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 07:24:58,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 07:24:58,007 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 07:24:58,008 INFO L158 Benchmark]: Toolchain (without parser) took 6390.04ms. Allocated memory was 167.8MB in the beginning and 297.8MB in the end (delta: 130.0MB). Free memory was 94.9MB in the beginning and 134.0MB in the end (delta: -39.0MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2024-11-16 07:24:58,008 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 07:24:58,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.46ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 134.8MB in the end (delta: -40.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 07:24:58,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.43ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 134.8MB in the beginning and 217.6MB in the end (delta: -82.8MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-11-16 07:24:58,009 INFO L158 Benchmark]: Boogie Preprocessor took 55.69ms. Allocated memory is still 247.5MB. Free memory was 217.6MB in the beginning and 214.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 07:24:58,009 INFO L158 Benchmark]: IcfgBuilder took 672.73ms. Allocated memory is still 247.5MB. Free memory was 214.3MB in the beginning and 188.3MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 07:24:58,009 INFO L158 Benchmark]: TraceAbstraction took 5266.46ms. Allocated memory was 247.5MB in the beginning and 297.8MB in the end (delta: 50.3MB). Free memory was 187.2MB in the beginning and 138.2MB in the end (delta: 49.1MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2024-11-16 07:24:58,009 INFO L158 Benchmark]: Witness Printer took 48.39ms. Allocated memory is still 297.8MB. Free memory was 138.2MB in the beginning and 134.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 07:24:58,010 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 167.8MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.46ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 134.8MB in the end (delta: -40.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.43ms. Allocated memory was 167.8MB in the beginning and 247.5MB in the end (delta: 79.7MB). Free memory was 134.8MB in the beginning and 217.6MB in the end (delta: -82.8MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.69ms. Allocated memory is still 247.5MB. Free memory was 217.6MB in the beginning and 214.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 672.73ms. Allocated memory is still 247.5MB. Free memory was 214.3MB in the beginning and 188.3MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5266.46ms. Allocated memory was 247.5MB in the beginning and 297.8MB in the end (delta: 50.3MB). Free memory was 187.2MB in the beginning and 138.2MB in the end (delta: 49.1MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. * Witness Printer took 48.39ms. Allocated memory is still 297.8MB. Free memory was 138.2MB in the beginning and 134.0MB 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, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 546 mSDsluCounter, 1268 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1022 mSDsCounter, 430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2093 IncrementalHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 430 mSolverCounterUnsat, 246 mSDtfsCounter, 2093 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=5, InterpolantAutomatonStates: 50, 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, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 467 NumberOfCodeBlocks, 467 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 1378 SizeOfPredicates, 6 NumberOfNonLiveVariables, 631 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 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-16 07:24:58,047 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