./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:52:39,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:52:39,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:52:39,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:52:39,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:52:39,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:52:39,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:52:39,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:52:39,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:52:39,590 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:52:39,590 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:52:39,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:52:39,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:52:39,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:52:39,593 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:52:39,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:52:39,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:52:39,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:52:39,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:52:39,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:52:39,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:52:39,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:52:39,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:52:39,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:52:39,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:52:39,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:52:39,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:52:39,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:52:39,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:52:39,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:52:39,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:52:39,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:52:39,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:52:39,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:52:39,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:52:39,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:52:39,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:52:39,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:52:39,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:52:39,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:52:39,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:52:39,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:52:39,606 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-10-12 19:52:39,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:52:39,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:52:39,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:52:39,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:52:39,879 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:52:39,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec.c [2024-10-12 19:52:41,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:52:41,510 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:52:41,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_rec.c [2024-10-12 19:52:41,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60df91246/0796ae149ded45a2901d826897b93c3b/FLAG2b1462832 [2024-10-12 19:52:41,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60df91246/0796ae149ded45a2901d826897b93c3b [2024-10-12 19:52:41,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:52:41,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:52:41,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:52:41,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:52:41,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:52:41,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f391c44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41, skipping insertion in model container [2024-10-12 19:52:41,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:52:41,736 WARN L248 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-10-12 19:52:41,757 WARN L1659 CHandler]: Possible shadowing of function min [2024-10-12 19:52:41,759 WARN L1659 CHandler]: Possible shadowing of function min [2024-10-12 19:52:41,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:52:41,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:52:41,811 WARN L248 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-10-12 19:52:41,818 WARN L1659 CHandler]: Possible shadowing of function min [2024-10-12 19:52:41,822 WARN L1659 CHandler]: Possible shadowing of function min [2024-10-12 19:52:41,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:52:41,859 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:52:41,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41 WrapperNode [2024-10-12 19:52:41,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:52:41,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:52:41,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:52:41,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:52:41,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,900 INFO L138 Inliner]: procedures = 29, calls = 61, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2024-10-12 19:52:41,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:52:41,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:52:41,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:52:41,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:52:41,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,942 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 16, 5, 2]. 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, 4, 2, 1]. [2024-10-12 19:52:41,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:52:41,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:52:41,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:52:41,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:52:41,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (1/1) ... [2024-10-12 19:52:41,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:52:41,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:52:42,005 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-10-12 19:52:42,007 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-10-12 19:52:42,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:52:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 19:52:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-12 19:52:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-12 19:52:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-12 19:52:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-12 19:52:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2024-10-12 19:52:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2024-10-12 19:52:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 19:52:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 19:52:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-12 19:52:42,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-12 19:52:42,062 INFO L130 BoogieDeclarations]: Found specification of procedure min [2024-10-12 19:52:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2024-10-12 19:52:42,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 19:52:42,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 19:52:42,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 19:52:42,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-12 19:52:42,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-12 19:52:42,062 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-10-12 19:52:42,063 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:52:42,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 19:52:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure size [2024-10-12 19:52:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2024-10-12 19:52:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:52:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:52:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 19:52:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 19:52:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2024-10-12 19:52:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2024-10-12 19:52:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 19:52:42,200 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:52:42,202 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:52:42,529 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-12 19:52:42,529 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:52:42,556 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:52:42,556 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:52:42,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:52:42 BoogieIcfgContainer [2024-10-12 19:52:42,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:52:42,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:52:42,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:52:42,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:52:42,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:52:41" (1/3) ... [2024-10-12 19:52:42,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36306d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:52:42, skipping insertion in model container [2024-10-12 19:52:42,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:52:41" (2/3) ... [2024-10-12 19:52:42,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36306d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:52:42, skipping insertion in model container [2024-10-12 19:52:42,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:52:42" (3/3) ... [2024-10-12 19:52:42,565 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2024-10-12 19:52:42,578 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:52:42,578 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:52:42,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:52:42,632 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;@3149ae1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:52:42,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:52:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 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-10-12 19:52:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-12 19:52:42,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:52:42,645 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] [2024-10-12 19:52:42,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:52:42,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:52:42,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1569702549, now seen corresponding path program 1 times [2024-10-12 19:52:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:52:42,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801018625] [2024-10-12 19:52:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:52:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:52:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:52:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:52:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:52:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:43,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:52:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:43,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:52:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:52:43,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:52:43,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801018625] [2024-10-12 19:52:43,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801018625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:52:43,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:52:43,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:52:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127379871] [2024-10-12 19:52:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:52:43,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:52:43,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:52:43,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:52:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:52:43,285 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 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.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-12 19:52:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:52:43,836 INFO L93 Difference]: Finished difference Result 144 states and 199 transitions. [2024-10-12 19:52:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:52:43,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 4 states have internal predecessors, (24), 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 35 [2024-10-12 19:52:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:52:43,851 INFO L225 Difference]: With dead ends: 144 [2024-10-12 19:52:43,851 INFO L226 Difference]: Without dead ends: 85 [2024-10-12 19:52:43,855 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-10-12 19:52:43,860 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 77 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:52:43,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 172 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:52:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-12 19:52:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2024-10-12 19:52:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 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-10-12 19:52:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2024-10-12 19:52:43,913 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 35 [2024-10-12 19:52:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:52:43,914 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2024-10-12 19:52:43,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-12 19:52:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2024-10-12 19:52:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 19:52:43,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:52:43,916 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] [2024-10-12 19:52:43,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:52:43,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:52:43,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:52:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1164948578, now seen corresponding path program 1 times [2024-10-12 19:52:43,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:52:43,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324681100] [2024-10-12 19:52:43,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:52:43,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:52:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:52:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:44,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:52:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:44,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:52:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:44,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:52:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:44,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:52:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:52:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:52:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:52:44,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:52:44,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324681100] [2024-10-12 19:52:44,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324681100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:52:44,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090567861] [2024-10-12 19:52:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:52:44,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:52:44,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:52:44,319 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-10-12 19:52:44,322 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-10-12 19:52:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:44,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 19:52:44,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:52:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:52:44,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:52:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:52:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090567861] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:52:44,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:52:44,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 11 [2024-10-12 19:52:44,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425082313] [2024-10-12 19:52:44,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:52:44,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:52:44,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:52:44,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:52:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:52:44,765 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-12 19:52:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:52:45,355 INFO L93 Difference]: Finished difference Result 145 states and 191 transitions. [2024-10-12 19:52:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:52:45,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 47 [2024-10-12 19:52:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:52:45,358 INFO L225 Difference]: With dead ends: 145 [2024-10-12 19:52:45,358 INFO L226 Difference]: Without dead ends: 85 [2024-10-12 19:52:45,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:52:45,360 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 76 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:52:45,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 240 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:52:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-12 19:52:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-10-12 19:52:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.16) internal successors, (58), 52 states have internal predecessors, (58), 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-10-12 19:52:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2024-10-12 19:52:45,381 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 47 [2024-10-12 19:52:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:52:45,381 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2024-10-12 19:52:45,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-10-12 19:52:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2024-10-12 19:52:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:52:45,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:52:45,383 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] [2024-10-12 19:52:45,401 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-10-12 19:52:45,587 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-10-12 19:52:45,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:52:45,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:52:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash 146784617, now seen corresponding path program 1 times [2024-10-12 19:52:45,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:52:45,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607698697] [2024-10-12 19:52:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:52:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:52:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:52:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:52:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:52:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:52:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:52:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:52:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:52:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:52:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:52:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 19:52:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:52:45,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607698697] [2024-10-12 19:52:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607698697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:52:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:52:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 19:52:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681540386] [2024-10-12 19:52:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:52:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:52:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:52:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:52:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:52:45,898 INFO L87 Difference]: Start difference. First operand 82 states and 107 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 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-10-12 19:52:46,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:52:46,407 INFO L93 Difference]: Finished difference Result 145 states and 191 transitions. [2024-10-12 19:52:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:52:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 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 59 [2024-10-12 19:52:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:52:46,410 INFO L225 Difference]: With dead ends: 145 [2024-10-12 19:52:46,410 INFO L226 Difference]: Without dead ends: 87 [2024-10-12 19:52:46,414 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-10-12 19:52:46,415 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 91 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:52:46,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 230 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:52:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-12 19:52:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-12 19:52:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 54 states have internal predecessors, (59), 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-10-12 19:52:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2024-10-12 19:52:46,441 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 59 [2024-10-12 19:52:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:52:46,441 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2024-10-12 19:52:46,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 7 states have internal predecessors, (31), 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-10-12 19:52:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2024-10-12 19:52:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-12 19:52:46,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:52:46,444 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] [2024-10-12 19:52:46,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:52:46,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:52:46,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:52:46,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1976244599, now seen corresponding path program 1 times [2024-10-12 19:52:46,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:52:46,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628866009] [2024-10-12 19:52:46,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:52:46,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:52:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:52:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:52:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:52:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:52:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:52:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:52:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:52:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:52:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:52:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:52:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:52:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:52:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:52:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628866009] [2024-10-12 19:52:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628866009] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:52:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732357282] [2024-10-12 19:52:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:52:46,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:52:46,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:52:46,940 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-10-12 19:52:46,941 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-10-12 19:52:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:52:47,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 19:52:47,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:52:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:52:47,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:52:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:52:47,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732357282] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:52:47,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:52:47,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 19 [2024-10-12 19:52:47,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404287317] [2024-10-12 19:52:47,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:52:47,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 19:52:47,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:52:47,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 19:52:47,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:52:47,389 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 15 states have internal predecessors, (54), 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-10-12 19:52:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:52:48,377 INFO L93 Difference]: Finished difference Result 139 states and 182 transitions. [2024-10-12 19:52:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:52:48,377 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 15 states have internal predecessors, (54), 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 72 [2024-10-12 19:52:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:52:48,381 INFO L225 Difference]: With dead ends: 139 [2024-10-12 19:52:48,381 INFO L226 Difference]: Without dead ends: 89 [2024-10-12 19:52:48,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2024-10-12 19:52:48,387 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 110 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:52:48,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 345 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:52:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-12 19:52:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-10-12 19:52:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 57 states have internal predecessors, (62), 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-10-12 19:52:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2024-10-12 19:52:48,403 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 72 [2024-10-12 19:52:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:52:48,404 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2024-10-12 19:52:48,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 15 states have internal predecessors, (54), 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-10-12 19:52:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2024-10-12 19:52:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 19:52:48,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:52:48,409 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] [2024-10-12 19:52:48,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:52:48,609 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-10-12 19:52:48,610 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:52:48,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:52:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1845875786, now seen corresponding path program 1 times [2024-10-12 19:52:48,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:52:48,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488218992] [2024-10-12 19:52:48,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:52:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:52:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:52:48,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 19:52:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:52:48,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 19:52:48,714 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 19:52:48,715 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:52:48,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:52:48,719 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-12 19:52:48,768 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:52:48,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:52:48 BoogieIcfgContainer [2024-10-12 19:52:48,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:52:48,774 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:52:48,774 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:52:48,774 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:52:48,774 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:52:42" (3/4) ... [2024-10-12 19:52:48,775 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 19:52:48,840 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:52:48,840 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:52:48,841 INFO L158 Benchmark]: Toolchain (without parser) took 7309.83ms. Allocated memory was 140.5MB in the beginning and 249.6MB in the end (delta: 109.1MB). Free memory was 87.5MB in the beginning and 125.3MB in the end (delta: -37.9MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2024-10-12 19:52:48,841 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 140.5MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:52:48,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.10ms. Allocated memory is still 140.5MB. Free memory was 87.5MB in the beginning and 73.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 19:52:48,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.55ms. Allocated memory is still 140.5MB. Free memory was 73.1MB in the beginning and 71.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:52:48,842 INFO L158 Benchmark]: Boogie Preprocessor took 62.68ms. Allocated memory is still 140.5MB. Free memory was 71.1MB in the beginning and 67.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:52:48,842 INFO L158 Benchmark]: RCFGBuilder took 591.93ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 67.7MB in the beginning and 167.6MB in the end (delta: -99.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-10-12 19:52:48,842 INFO L158 Benchmark]: TraceAbstraction took 6214.19ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 167.6MB in the beginning and 129.6MB in the end (delta: 38.0MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-10-12 19:52:48,843 INFO L158 Benchmark]: Witness Printer took 66.49ms. Allocated memory is still 249.6MB. Free memory was 129.6MB in the beginning and 125.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:52:48,844 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 140.5MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.10ms. Allocated memory is still 140.5MB. Free memory was 87.5MB in the beginning and 73.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.55ms. Allocated memory is still 140.5MB. Free memory was 73.1MB in the beginning and 71.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.68ms. Allocated memory is still 140.5MB. Free memory was 71.1MB in the beginning and 67.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 591.93ms. Allocated memory was 140.5MB in the beginning and 207.6MB in the end (delta: 67.1MB). Free memory was 67.7MB in the beginning and 167.6MB in the end (delta: -99.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6214.19ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 167.6MB in the beginning and 129.6MB in the end (delta: 38.0MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * Witness Printer took 66.49ms. Allocated memory is still 249.6MB. Free memory was 129.6MB in the beginning and 125.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 987 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 825 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2463 IncrementalHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 162 mSDtfsCounter, 2463 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred 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.2s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 1268 SizeOfPredicates, 6 NumberOfNonLiveVariables, 630 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-10-12 19:52:48,877 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