./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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.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 cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:55:44,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:55:44,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:55:44,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:55:44,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:55:44,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:55:44,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:55:44,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:55:44,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:55:44,724 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:55:44,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:55:44,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:55:44,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:55:44,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:55:44,727 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:55:44,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:55:44,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:55:44,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:55:44,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:55:44,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:55:44,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:55:44,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:55:44,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:55:44,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:55:44,730 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:55:44,730 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:55:44,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:55:44,731 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:55:44,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:55:44,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:55:44,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:55:44,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:55:44,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:55:44,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:55:44,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:55:44,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:55:44,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:55:44,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:55:44,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:55:44,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:55:44,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:55:44,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:55:44,736 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2024-11-09 22:55:44,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:55:45,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:55:45,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:55:45,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:55:45,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:55:45,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter.c [2024-11-09 22:55:46,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:55:46,718 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:55:46,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2024-11-09 22:55:46,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c2ca265b/d52e0fc7d9fa4e9aa90e6ecadf04b2ff/FLAGc43d846b7 [2024-11-09 22:55:47,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c2ca265b/d52e0fc7d9fa4e9aa90e6ecadf04b2ff [2024-11-09 22:55:47,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:55:47,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:55:47,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:55:47,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:55:47,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:55:47,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355c0ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47, skipping insertion in model container [2024-11-09 22:55:47,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:55:47,305 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.c[586,599] [2024-11-09 22:55:47,322 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 22:55:47,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:55:47,351 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:55:47,364 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.c[586,599] [2024-11-09 22:55:47,373 WARN L1684 CHandler]: Possible shadowing of function min [2024-11-09 22:55:47,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:55:47,404 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:55:47,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47 WrapperNode [2024-11-09 22:55:47,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:55:47,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:55:47,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:55:47,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:55:47,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,462 INFO L138 Inliner]: procedures = 29, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2024-11-09 22:55:47,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:55:47,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:55:47,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:55:47,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:55:47,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,520 INFO L175 MemorySlicer]: Split 28 memory accesses to 4 slices as follows [2, 2, 19, 5]. 68 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, 1, 4, 2]. [2024-11-09 22:55:47,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,547 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:55:47,548 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:55:47,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:55:47,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:55:47,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (1/1) ... [2024-11-09 22:55:47,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:55:47,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:55:47,580 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-09 22:55:47,584 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-09 22:55:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:55:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 22:55:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 22:55:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 22:55:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 22:55:47,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 22:55:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 22:55:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 22:55:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 22:55:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 22:55:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-09 22:55:47,628 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-09 22:55:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 22:55:47,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 22:55:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 22:55:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 22:55:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-09 22:55:47,629 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-09 22:55:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 22:55:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 22:55:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 22:55:47,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 22:55:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-09 22:55:47,630 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-09 22:55:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:55:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:55:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:55:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 22:55:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 22:55:47,630 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-09 22:55:47,630 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-09 22:55:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:55:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:55:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:55:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:55:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-09 22:55:47,631 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-09 22:55:47,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 22:55:47,762 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:55:47,765 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:55:47,849 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L39: havoc ~a~0, ~b~0, ~c~0; [2024-11-09 22:55:47,902 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc ~n~0.base, ~n~0.offset; [2024-11-09 22:55:48,098 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-09 22:55:48,098 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:55:48,112 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:55:48,112 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:55:48,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:55:48 BoogieIcfgContainer [2024-11-09 22:55:48,113 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:55:48,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:55:48,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:55:48,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:55:48,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:55:47" (1/3) ... [2024-11-09 22:55:48,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a03d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:55:48, skipping insertion in model container [2024-11-09 22:55:48,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:47" (2/3) ... [2024-11-09 22:55:48,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a03d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:55:48, skipping insertion in model container [2024-11-09 22:55:48,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:55:48" (3/3) ... [2024-11-09 22:55:48,120 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2024-11-09 22:55:48,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:55:48,134 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:55:48,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:55:48,194 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;@3a143cb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:55:48,194 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:55:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 59 states have (on average 1.271186440677966) internal successors, (75), 60 states have internal predecessors, (75), 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-09 22:55:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 22:55:48,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:55:48,208 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-09 22:55:48,208 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:55:48,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:55:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 697432050, now seen corresponding path program 1 times [2024-11-09 22:55:48,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:55:48,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927692377] [2024-11-09 22:55:48,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:55:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:55:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:48,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:55:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:48,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 22:55:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:48,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 22:55:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 22:55:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:48,865 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-09 22:55:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:55:48,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927692377] [2024-11-09 22:55:48,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927692377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:55:48,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:55:48,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 22:55:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102451121] [2024-11-09 22:55:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:55:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:55:48,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:55:48,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:55:48,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:55:48,899 INFO L87 Difference]: Start difference. First operand has 87 states, 59 states have (on average 1.271186440677966) internal successors, (75), 60 states have internal predecessors, (75), 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-09 22:55:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:55:49,379 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2024-11-09 22:55:49,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 22:55:49,382 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-09 22:55:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:55:49,391 INFO L225 Difference]: With dead ends: 153 [2024-11-09 22:55:49,391 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 22:55:49,394 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-09 22:55:49,397 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 104 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:55:49,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 233 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 22:55:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 22:55:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-09 22:55:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 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-09 22:55:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2024-11-09 22:55:49,449 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 37 [2024-11-09 22:55:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:55:49,450 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2024-11-09 22:55:49,450 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-09 22:55:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2024-11-09 22:55:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 22:55:49,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:55:49,454 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-09 22:55:49,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:55:49,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:55:49,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:55:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1934627657, now seen corresponding path program 1 times [2024-11-09 22:55:49,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:55:49,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527824213] [2024-11-09 22:55:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:55:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:55:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:49,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:49,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:55:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:49,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 22:55:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:49,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:55:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 22:55:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:55:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:49,871 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-09 22:55:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:55:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527824213] [2024-11-09 22:55:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527824213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:55:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656374849] [2024-11-09 22:55:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:55:49,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:55:49,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:55:49,878 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-09 22:55:49,881 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-09 22:55:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:49,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 22:55:50,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:55:50,166 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-09 22:55:50,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:55:50,374 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-09 22:55:50,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656374849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:55:50,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:55:50,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-11-09 22:55:50,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479808956] [2024-11-09 22:55:50,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:55:50,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 22:55:50,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:55:50,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 22:55:50,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 22:55:50,378 INFO L87 Difference]: Start difference. First operand 81 states and 105 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-09 22:55:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:55:51,032 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2024-11-09 22:55:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:55:51,033 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-09 22:55:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:55:51,035 INFO L225 Difference]: With dead ends: 146 [2024-11-09 22:55:51,035 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 22:55:51,036 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-09 22:55:51,037 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 70 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 22:55:51,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 359 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 22:55:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 22:55:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-09 22:55:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 56 states have internal predecessors, (63), 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-09 22:55:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2024-11-09 22:55:51,051 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 49 [2024-11-09 22:55:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:55:51,051 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2024-11-09 22:55:51,052 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-09 22:55:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2024-11-09 22:55:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 22:55:51,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:55:51,055 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-09 22:55:51,073 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-09 22:55:51,259 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-09 22:55:51,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:55:51,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:55:51,260 INFO L85 PathProgramCache]: Analyzing trace with hash -296821777, now seen corresponding path program 1 times [2024-11-09 22:55:51,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:55:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179430053] [2024-11-09 22:55:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:55:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:55:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:55:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:55:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 22:55:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:55:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 22:55:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 22:55:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:51,526 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-09 22:55:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:55:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179430053] [2024-11-09 22:55:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179430053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:55:51,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:55:51,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 22:55:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715020122] [2024-11-09 22:55:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:55:51,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:55:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:55:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:55:51,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:55:51,529 INFO L87 Difference]: Start difference. First operand 83 states and 108 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-09 22:55:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:55:52,006 INFO L93 Difference]: Finished difference Result 146 states and 192 transitions. [2024-11-09 22:55:52,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 22:55:52,007 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-09 22:55:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:55:52,009 INFO L225 Difference]: With dead ends: 146 [2024-11-09 22:55:52,011 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 22:55:52,012 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-09 22:55:52,013 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 93 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:55:52,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 299 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 22:55:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 22:55:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-09 22:55:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 58 states have internal predecessors, (64), 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-09 22:55:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2024-11-09 22:55:52,039 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 61 [2024-11-09 22:55:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:55:52,042 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2024-11-09 22:55:52,042 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-09 22:55:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2024-11-09 22:55:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 22:55:52,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:55:52,047 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-09 22:55:52,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:55:52,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:55:52,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:55:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1544760993, now seen corresponding path program 1 times [2024-11-09 22:55:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:55:52,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4957123] [2024-11-09 22:55:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:55:52,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:55:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:55:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 22:55:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:55:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:55:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 22:55:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 22:55:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 22:55:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 22:55:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:55:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 22:55:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:55:52,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4957123] [2024-11-09 22:55:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4957123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:55:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:55:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 22:55:52,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197243380] [2024-11-09 22:55:52,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:55:52,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:55:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:55:52,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:55:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:55:52,376 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 22:55:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:55:52,854 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2024-11-09 22:55:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:55:52,854 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 74 [2024-11-09 22:55:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:55:52,856 INFO L225 Difference]: With dead ends: 138 [2024-11-09 22:55:52,860 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 22:55:52,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-11-09 22:55:52,861 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 86 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 22:55:52,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 296 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 22:55:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 22:55:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-09 22:55:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 60 states have internal predecessors, (65), 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-09 22:55:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 115 transitions. [2024-11-09 22:55:52,881 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 115 transitions. Word has length 74 [2024-11-09 22:55:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:55:52,882 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 115 transitions. [2024-11-09 22:55:52,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 22:55:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2024-11-09 22:55:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-09 22:55:52,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:55:52,888 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-09 22:55:52,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:55:52,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:55:52,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:55:52,889 INFO L85 PathProgramCache]: Analyzing trace with hash 395394898, now seen corresponding path program 1 times [2024-11-09 22:55:52,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:55:52,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849402446] [2024-11-09 22:55:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:55:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:55:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:55:52,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 22:55:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 22:55:53,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 22:55:53,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 22:55:53,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:55:53,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:55:53,007 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 22:55:53,050 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:55:53,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:55:53 BoogieIcfgContainer [2024-11-09 22:55:53,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:55:53,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:55:53,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:55:53,054 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:55:53,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:55:48" (3/4) ... [2024-11-09 22:55:53,055 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 22:55:53,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:55:53,127 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:55:53,128 INFO L158 Benchmark]: Toolchain (without parser) took 6021.04ms. Allocated memory was 161.5MB in the beginning and 207.6MB in the end (delta: 46.1MB). Free memory was 88.3MB in the beginning and 123.7MB in the end (delta: -35.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-11-09 22:55:53,128 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 161.5MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:55:53,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.02ms. Allocated memory is still 161.5MB. Free memory was 88.0MB in the beginning and 73.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 22:55:53,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.84ms. Allocated memory is still 161.5MB. Free memory was 73.6MB in the beginning and 71.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:55:53,129 INFO L158 Benchmark]: Boogie Preprocessor took 84.91ms. Allocated memory is still 161.5MB. Free memory was 71.8MB in the beginning and 68.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 22:55:53,129 INFO L158 Benchmark]: IcfgBuilder took 565.14ms. Allocated memory was 161.5MB in the beginning and 207.6MB in the end (delta: 46.1MB). Free memory was 68.1MB in the beginning and 163.2MB in the end (delta: -95.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-11-09 22:55:53,129 INFO L158 Benchmark]: TraceAbstraction took 4937.41ms. Allocated memory is still 207.6MB. Free memory was 163.2MB in the beginning and 127.9MB in the end (delta: 35.3MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-11-09 22:55:53,129 INFO L158 Benchmark]: Witness Printer took 73.79ms. Allocated memory is still 207.6MB. Free memory was 127.9MB in the beginning and 123.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 22:55:53,131 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.20ms. Allocated memory is still 161.5MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.02ms. Allocated memory is still 161.5MB. Free memory was 88.0MB in the beginning and 73.6MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.84ms. Allocated memory is still 161.5MB. Free memory was 73.6MB in the beginning and 71.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.91ms. Allocated memory is still 161.5MB. Free memory was 71.8MB in the beginning and 68.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 565.14ms. Allocated memory was 161.5MB in the beginning and 207.6MB in the end (delta: 46.1MB). Free memory was 68.1MB in the beginning and 163.2MB in the end (delta: -95.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4937.41ms. Allocated memory is still 207.6MB. Free memory was 163.2MB in the beginning and 127.9MB in the end (delta: 35.3MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * Witness Printer took 73.79ms. Allocated memory is still 207.6MB. Free memory was 127.9MB in the beginning and 123.7MB 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: [L110] 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}] [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->left) VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L42] RET, EXPR min(n->right) VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\old(n)={-1:0}, \result=2147483647] [L86] RET, EXPR min(t) VAL [t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L82] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L82] EXPR t->right VAL [\old(t)={-1:0}] [L82] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-2:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-2:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-2:0}, i=2] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-2:0}] [L93] EXPR x[0] [L93] 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, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 1187 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 988 mSDsCounter, 243 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1941 IncrementalHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 243 mSolverCounterUnsat, 199 mSDtfsCounter, 1941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 40, 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.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 864 SizeOfPredicates, 2 NumberOfNonLiveVariables, 242 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 90/96 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-09 22:55:53,159 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