./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_rec.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 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:27:10,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:27:10,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:27:10,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:27:10,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:27:10,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:27:10,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:27:10,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:27:10,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:27:10,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:27:10,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:27:10,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:27:10,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:27:10,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:27:10,333 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:27:10,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:27:10,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:27:10,334 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:27:10,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:27:10,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:27:10,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:27:10,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:27:10,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:27:10,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:27:10,336 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:27:10,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:27:10,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:27:10,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:27:10,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:27:10,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:27:10,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:27:10,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:27:10,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:27:10,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:27:10,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:27:10,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:27:10,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:27:10,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:27:10,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:27:10,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:27:10,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:27:10,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:27:10,345 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 -> 448d6e9f7f0c094a8335d652a2766ae983308e33ec1a543ceaed97ae79744722 [2024-11-08 15:27:10,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:27:10,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:27:10,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:27:10,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:27:10,657 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:27:10,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_rec.c [2024-11-08 15:27:12,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:27:12,396 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:27:12,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec.c [2024-11-08 15:27:12,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9eca64c/919931a45cae41159fd00d3573c91bc2/FLAG1316ed9fb [2024-11-08 15:27:12,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c9eca64c/919931a45cae41159fd00d3573c91bc2 [2024-11-08 15:27:12,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:27:12,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:27:12,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:27:12,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:27:12,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:27:12,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d10b184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12, skipping insertion in model container [2024-11-08 15:27:12,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:27:12,679 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_rec.c[585,598] [2024-11-08 15:27:12,703 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-08 15:27:12,705 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-08 15:27:12,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:27:12,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:27:12,749 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_rec.c[585,598] [2024-11-08 15:27:12,756 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-08 15:27:12,757 WARN L1674 CHandler]: Possible shadowing of function min [2024-11-08 15:27:12,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:27:12,785 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:27:12,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12 WrapperNode [2024-11-08 15:27:12,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:27:12,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:27:12,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:27:12,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:27:12,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,825 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-11-08 15:27:12,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:27:12,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:27:12,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:27:12,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:27:12,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,876 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 2, 5, 16]. 64 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, 2, 4]. [2024-11-08 15:27:12,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:27:12,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:27:12,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:27:12,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:27:12,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (1/1) ... [2024-11-08 15:27:12,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:27:12,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:27:12,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:27:12,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:27:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:27:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 15:27:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 15:27:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 15:27:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 15:27:12,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-08 15:27:12,993 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2024-11-08 15:27:12,993 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2024-11-08 15:27:12,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 15:27:12,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 15:27:12,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 15:27:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 15:27:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-11-08 15:27:12,994 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-11-08 15:27:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 15:27:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 15:27:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 15:27:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 15:27:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-08 15:27:12,995 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-08 15:27:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 15:27:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 15:27:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 15:27:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-08 15:27:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-08 15:27:12,995 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-08 15:27:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:27:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 15:27:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 15:27:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 15:27:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 15:27:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-11-08 15:27:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-11-08 15:27:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:27:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:27:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 15:27:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 15:27:12,997 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-11-08 15:27:12,997 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-11-08 15:27:12,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 15:27:13,138 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:27:13,139 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:27:13,442 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-08 15:27:13,442 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:27:13,457 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:27:13,458 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:27:13,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:27:13 BoogieIcfgContainer [2024-11-08 15:27:13,458 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:27:13,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:27:13,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:27:13,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:27:13,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:27:12" (1/3) ... [2024-11-08 15:27:13,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254aec9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:27:13, skipping insertion in model container [2024-11-08 15:27:13,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:27:12" (2/3) ... [2024-11-08 15:27:13,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254aec9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:27:13, skipping insertion in model container [2024-11-08 15:27:13,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:27:13" (3/3) ... [2024-11-08 15:27:13,470 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2024-11-08 15:27:13,486 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:27:13,486 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:27:13,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:27:13,551 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;@18e9817b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:27:13,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:27:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 15:27:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 15:27:13,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:13,567 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:13,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:13,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1856867306, now seen corresponding path program 1 times [2024-11-08 15:27:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995321890] [2024-11-08 15:27:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:14,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:27:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:14,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 15:27:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 15:27:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:27:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995321890] [2024-11-08 15:27:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995321890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:27:14,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:27:14,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:27:14,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545088164] [2024-11-08 15:27:14,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:27:14,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:27:14,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:27:14,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:27:14,293 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 56 states have internal predecessors, (69), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:27:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:15,006 INFO L93 Difference]: Finished difference Result 153 states and 208 transitions. [2024-11-08 15:27:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:27:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-11-08 15:27:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:15,020 INFO L225 Difference]: With dead ends: 153 [2024-11-08 15:27:15,021 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 15:27:15,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:27:15,031 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 116 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:15,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 189 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 15:27:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 15:27:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2024-11-08 15:27:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 22 states have call successors, (22), 7 states have call predecessors, (22), 8 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2024-11-08 15:27:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 106 transitions. [2024-11-08 15:27:15,090 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 106 transitions. Word has length 37 [2024-11-08 15:27:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:15,091 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 106 transitions. [2024-11-08 15:27:15,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 15:27:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 106 transitions. [2024-11-08 15:27:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 15:27:15,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:15,096 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:15,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:27:15,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash 187896899, now seen corresponding path program 1 times [2024-11-08 15:27:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:15,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93726268] [2024-11-08 15:27:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:15,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:15,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:15,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:27:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:15,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:27:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:15,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 15:27:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:27:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:15,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93726268] [2024-11-08 15:27:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93726268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:27:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556377876] [2024-11-08 15:27:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:15,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:27:15,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:27:15,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:27:15,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:27:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:15,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 15:27:15,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:27:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:27:16,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:27:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:27:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556377876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:27:16,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:27:16,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2024-11-08 15:27:16,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371106731] [2024-11-08 15:27:16,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:27:16,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:27:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:27:16,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:27:16,298 INFO L87 Difference]: Start difference. First operand 82 states and 106 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-08 15:27:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:17,048 INFO L93 Difference]: Finished difference Result 148 states and 194 transitions. [2024-11-08 15:27:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:27:17,049 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 49 [2024-11-08 15:27:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:17,051 INFO L225 Difference]: With dead ends: 148 [2024-11-08 15:27:17,051 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 15:27:17,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:27:17,056 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 115 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:17,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 271 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 15:27:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 15:27:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-08 15:27:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 54 states have internal predecessors, (60), 22 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (27), 22 states have call predecessors, (27), 22 states have call successors, (27) [2024-11-08 15:27:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2024-11-08 15:27:17,079 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 49 [2024-11-08 15:27:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:17,080 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2024-11-08 15:27:17,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 9 states have internal predecessors, (44), 5 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-08 15:27:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2024-11-08 15:27:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 15:27:17,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:17,082 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:17,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 15:27:17,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:27:17,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:17,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:17,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1042989096, now seen corresponding path program 1 times [2024-11-08 15:27:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:17,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25302322] [2024-11-08 15:27:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:17,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:27:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 15:27:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-08 15:27:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 15:27:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 15:27:17,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25302322] [2024-11-08 15:27:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25302322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:27:17,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:27:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 15:27:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425878995] [2024-11-08 15:27:17,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:27:17,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 15:27:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:17,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 15:27:17,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:27:17,627 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-08 15:27:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:18,181 INFO L93 Difference]: Finished difference Result 148 states and 194 transitions. [2024-11-08 15:27:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:27:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2024-11-08 15:27:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:18,184 INFO L225 Difference]: With dead ends: 148 [2024-11-08 15:27:18,184 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 15:27:18,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:27:18,186 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 130 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:18,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 233 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:27:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 15:27:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-08 15:27:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.150943396226415) internal successors, (61), 56 states have internal predecessors, (61), 22 states have call successors, (22), 7 states have call predecessors, (22), 10 states have return successors, (29), 22 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-08 15:27:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2024-11-08 15:27:18,210 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 61 [2024-11-08 15:27:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:18,211 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-08 15:27:18,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-08 15:27:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2024-11-08 15:27:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 15:27:18,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:18,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:18,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:27:18,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:18,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:18,218 INFO L85 PathProgramCache]: Analyzing trace with hash 783016298, now seen corresponding path program 1 times [2024-11-08 15:27:18,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:18,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730766757] [2024-11-08 15:27:18,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:18,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:27:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 15:27:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:27:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 15:27:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:27:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:27:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 15:27:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:27:18,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730766757] [2024-11-08 15:27:18,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730766757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:27:18,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458895124] [2024-11-08 15:27:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:18,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:27:18,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:27:18,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:27:18,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:27:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:27:18,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 15:27:18,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:27:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 15:27:19,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:27:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 15:27:19,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458895124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:27:19,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:27:19,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 19 [2024-11-08 15:27:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133167108] [2024-11-08 15:27:19,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:27:19,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 15:27:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:27:19,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 15:27:19,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:27:19,236 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-11-08 15:27:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:27:20,310 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2024-11-08 15:27:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 15:27:20,310 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) Word has length 74 [2024-11-08 15:27:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:27:20,312 INFO L225 Difference]: With dead ends: 142 [2024-11-08 15:27:20,312 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 15:27:20,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 15:27:20,314 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 111 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:27:20,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 401 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 15:27:20,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 15:27:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-08 15:27:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 59 states have internal predecessors, (64), 22 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (30), 22 states have call predecessors, (30), 22 states have call successors, (30) [2024-11-08 15:27:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2024-11-08 15:27:20,326 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 74 [2024-11-08 15:27:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:27:20,327 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2024-11-08 15:27:20,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 15 states have internal predecessors, (56), 8 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2024-11-08 15:27:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2024-11-08 15:27:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 15:27:20,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:27:20,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:27:20,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:27:20,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 15:27:20,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:27:20,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:27:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash 391333821, now seen corresponding path program 1 times [2024-11-08 15:27:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:27:20,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009567957] [2024-11-08 15:27:20,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:27:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:27:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:27:20,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:27:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:27:20,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:27:20,622 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:27:20,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:27:20,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:27:20,628 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 15:27:20,691 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:27:20,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:27:20 BoogieIcfgContainer [2024-11-08 15:27:20,695 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:27:20,696 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:27:20,696 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:27:20,696 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:27:20,696 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:27:13" (3/4) ... [2024-11-08 15:27:20,697 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:27:20,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:27:20,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:27:20,776 INFO L158 Benchmark]: Toolchain (without parser) took 8350.74ms. Allocated memory was 153.1MB in the beginning and 188.7MB in the end (delta: 35.7MB). Free memory was 124.9MB in the beginning and 79.5MB in the end (delta: 45.5MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-08 15:27:20,776 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 125.8MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:27:20,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.38ms. Allocated memory is still 153.1MB. Free memory was 124.7MB in the beginning and 111.8MB in the end (delta: 12.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-08 15:27:20,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.05ms. Allocated memory is still 153.1MB. Free memory was 111.8MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:27:20,777 INFO L158 Benchmark]: Boogie Preprocessor took 84.87ms. Allocated memory is still 153.1MB. Free memory was 109.8MB in the beginning and 106.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:27:20,777 INFO L158 Benchmark]: RCFGBuilder took 546.50ms. Allocated memory is still 153.1MB. Free memory was 106.6MB in the beginning and 82.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 15:27:20,777 INFO L158 Benchmark]: TraceAbstraction took 7232.16ms. Allocated memory was 153.1MB in the beginning and 188.7MB in the end (delta: 35.7MB). Free memory was 81.4MB in the beginning and 83.6MB in the end (delta: -2.2MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-11-08 15:27:20,777 INFO L158 Benchmark]: Witness Printer took 79.59ms. Allocated memory is still 188.7MB. Free memory was 83.6MB in the beginning and 79.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 15:27:20,779 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.18ms. Allocated memory is still 125.8MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.38ms. Allocated memory is still 153.1MB. Free memory was 124.7MB in the beginning and 111.8MB in the end (delta: 12.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.05ms. Allocated memory is still 153.1MB. Free memory was 111.8MB in the beginning and 109.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.87ms. Allocated memory is still 153.1MB. Free memory was 109.8MB in the beginning and 106.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 546.50ms. Allocated memory is still 153.1MB. Free memory was 106.6MB in the beginning and 82.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7232.16ms. Allocated memory was 153.1MB in the beginning and 188.7MB in the end (delta: 35.7MB). Free memory was 81.4MB in the beginning and 83.6MB in the end (delta: -2.2MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Witness Printer took 79.59ms. Allocated memory is still 188.7MB. Free memory was 83.6MB in the beginning and 79.5MB 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: [L102] 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}] [L102] RET, EXPR nondet_tree() [L102] CALL task(nondet_tree()) [L78] 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] [L78] RET, EXPR min(t) VAL [t={-1:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L81] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L74] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\old(t)={0:0}, \result=0] [L74] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L74] EXPR t->right VAL [\old(t)={-1:0}] [L74] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\old(t)={0:0}, \result=0] [L74] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L82] RET assume_cycle_if_not(n != 0) [L83] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L83] int *x = calloc(n, sizeof(int)); [L84] CALL tree_inorder(t, x, n) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-2:0}] [L65] 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}] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-2:0}] [L67] 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] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-2:0}, i=2] [L84] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-2:0}] [L85] EXPR x[0] [L85] 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 8 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 502 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 1094 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 920 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2528 IncrementalHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 174 mSDtfsCounter, 2528 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=4, 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, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 SizeOfPredicates, 6 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 156/168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:27:20,806 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