/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 23:01:52,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 23:01:52,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 23:01:52,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 23:01:52,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 23:01:52,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 23:01:52,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 23:01:52,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 23:01:52,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 23:01:52,260 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 23:01:52,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 23:01:52,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 23:01:52,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 23:01:52,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 23:01:52,262 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 23:01:52,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 23:01:52,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 23:01:52,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 23:01:52,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 23:01:52,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 23:01:52,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 23:01:52,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 23:01:52,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 23:01:52,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 23:01:52,264 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 23:01:52,264 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 23:01:52,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 23:01:52,265 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 23:01:52,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 23:01:52,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 23:01:52,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 23:01:52,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 23:01:52,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:01:52,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 23:01:52,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 23:01:52,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 23:01:52,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 23:01:52,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 23:01:52,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 23:01:52,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 23:01:52,267 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 23:01:52,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 23:01:52,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 23:01:52,268 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: Use bitabs translation -> true [2023-12-15 23:01:52,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 23:01:52,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 23:01:52,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 23:01:52,480 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 23:01:52,480 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 23:01:52,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2023-12-15 23:01:53,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 23:01:53,669 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 23:01:53,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c [2023-12-15 23:01:53,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db278d39/8533c84e4736404fae09b84d72f85979/FLAG0c4b7c229 [2023-12-15 23:01:53,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db278d39/8533c84e4736404fae09b84d72f85979 [2023-12-15 23:01:53,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 23:01:53,695 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 23:01:53,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 23:01:53,698 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 23:01:53,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 23:01:53,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8ca87b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53, skipping insertion in model container [2023-12-15 23:01:53,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,723 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 23:01:53,813 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c[618,631] [2023-12-15 23:01:53,825 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-15 23:01:53,826 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-15 23:01:53,837 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:01:53,849 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 23:01:53,857 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c[618,631] [2023-12-15 23:01:53,860 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-15 23:01:53,860 WARN L1574 CHandler]: Possible shadowing of function min [2023-12-15 23:01:53,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:01:53,877 INFO L206 MainTranslator]: Completed translation [2023-12-15 23:01:53,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53 WrapperNode [2023-12-15 23:01:53,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 23:01:53,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 23:01:53,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 23:01:53,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 23:01:53,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,911 INFO L138 Inliner]: procedures = 29, calls = 58, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2023-12-15 23:01:53,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 23:01:53,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 23:01:53,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 23:01:53,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 23:01:53,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,945 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 2, 5, 15]. 63 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]. [2023-12-15 23:01:53,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,954 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 23:01:53,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 23:01:53,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 23:01:53,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 23:01:53,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (1/1) ... [2023-12-15 23:01:53,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:01:53,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:01:54,001 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) [2023-12-15 23:01:54,011 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 [2023-12-15 23:01:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 23:01:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-15 23:01:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 23:01:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2023-12-15 23:01:54,029 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure min [2023-12-15 23:01:54,029 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 23:01:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 23:01:54,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 23:01:54,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 23:01:54,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-12-15 23:01:54,030 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-12-15 23:01:54,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 23:01:54,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 23:01:54,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-15 23:01:54,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-15 23:01:54,032 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-12-15 23:01:54,032 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-12-15 23:01:54,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 23:01:54,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 23:01:54,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 23:01:54,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 23:01:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 23:01:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure size [2023-12-15 23:01:54,033 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2023-12-15 23:01:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 23:01:54,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 23:01:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-15 23:01:54,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-15 23:01:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2023-12-15 23:01:54,033 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2023-12-15 23:01:54,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 23:01:54,149 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 23:01:54,150 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 23:01:54,394 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 23:01:54,413 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 23:01:54,413 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 23:01:54,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:01:54 BoogieIcfgContainer [2023-12-15 23:01:54,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 23:01:54,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 23:01:54,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 23:01:54,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 23:01:54,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:01:53" (1/3) ... [2023-12-15 23:01:54,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f36fcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:01:54, skipping insertion in model container [2023-12-15 23:01:54,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:01:53" (2/3) ... [2023-12-15 23:01:54,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f36fcd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:01:54, skipping insertion in model container [2023-12-15 23:01:54,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:01:54" (3/3) ... [2023-12-15 23:01:54,420 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c [2023-12-15 23:01:54,432 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 23:01:54,433 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 23:01:54,470 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 23:01:54,474 INFO L357 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, mHoare=true, 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;@291027cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 23:01:54,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 23:01:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 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) [2023-12-15 23:01:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 23:01:54,501 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:01:54,501 INFO L195 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] [2023-12-15 23:01:54,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:01:54,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:01:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1984045083, now seen corresponding path program 1 times [2023-12-15 23:01:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:01:54,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154140398] [2023-12-15 23:01:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:01:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:01:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:54,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:01:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:54,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 23:01:54,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 23:01:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:54,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 23:01:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:54,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 23:01:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:01:54,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:01:54,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154140398] [2023-12-15 23:01:54,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154140398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:01:54,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:01:54,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 23:01:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189709608] [2023-12-15 23:01:54,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:01:54,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:01:54,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:01:54,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:01:54,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:01:54,810 INFO L87 Difference]: Start difference. First operand has 79 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 49 states have internal predecessors, (59), 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 5 states, 5 states have (on average 4.8) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 23:01:55,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:01:55,117 INFO L93 Difference]: Finished difference Result 138 states and 186 transitions. [2023-12-15 23:01:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:01:55,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2023-12-15 23:01:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:01:55,127 INFO L225 Difference]: With dead ends: 138 [2023-12-15 23:01:55,127 INFO L226 Difference]: Without dead ends: 82 [2023-12-15 23:01:55,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 23:01:55,136 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 71 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:01:55,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 87 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 23:01:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-15 23:01:55,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2023-12-15 23:01:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 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) [2023-12-15 23:01:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2023-12-15 23:01:55,189 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 35 [2023-12-15 23:01:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:01:55,190 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2023-12-15 23:01:55,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-15 23:01:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2023-12-15 23:01:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 23:01:55,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:01:55,194 INFO L195 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] [2023-12-15 23:01:55,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 23:01:55,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:01:55,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:01:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1289853859, now seen corresponding path program 1 times [2023-12-15 23:01:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:01:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14051773] [2023-12-15 23:01:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:01:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:01:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:01:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:55,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 23:01:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:55,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 23:01:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:55,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 23:01:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:55,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 23:01:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 23:01:55,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:01:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14051773] [2023-12-15 23:01:55,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14051773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:01:55,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:01:55,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 23:01:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633568875] [2023-12-15 23:01:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:01:55,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:01:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:01:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:01:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:01:55,454 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. 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) [2023-12-15 23:01:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:01:55,755 INFO L93 Difference]: Finished difference Result 138 states and 180 transitions. [2023-12-15 23:01:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 23:01:55,760 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 [2023-12-15 23:01:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:01:55,764 INFO L225 Difference]: With dead ends: 138 [2023-12-15 23:01:55,764 INFO L226 Difference]: Without dead ends: 84 [2023-12-15 23:01:55,765 INFO L412 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 [2023-12-15 23:01:55,766 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 109 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:01:55,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 145 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 23:01:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-15 23:01:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2023-12-15 23:01:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 49 states have internal predecessors, (55), 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) [2023-12-15 23:01:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2023-12-15 23:01:55,787 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 35 [2023-12-15 23:01:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:01:55,787 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2023-12-15 23:01:55,787 INFO L496 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) [2023-12-15 23:01:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2023-12-15 23:01:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-15 23:01:55,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:01:55,793 INFO L195 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] [2023-12-15 23:01:55,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 23:01:55,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:01:55,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:01:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1627645274, now seen corresponding path program 1 times [2023-12-15 23:01:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:01:55,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559486742] [2023-12-15 23:01:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:01:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:01:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:55,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:01:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 23:01:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:56,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 23:01:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 23:01:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:56,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 23:01:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:56,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-15 23:01:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:56,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 23:01:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 23:01:56,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:01:56,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559486742] [2023-12-15 23:01:56,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559486742] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:01:56,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811661361] [2023-12-15 23:01:56,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:01:56,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:01:56,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:01:56,131 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) [2023-12-15 23:01:56,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 23:01:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:56,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 23:01:56,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:01:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 23:01:56,343 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 23:01:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-15 23:01:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811661361] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 23:01:56,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 23:01:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 13 [2023-12-15 23:01:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862922714] [2023-12-15 23:01:56,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 23:01:56,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 23:01:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:01:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 23:01:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-15 23:01:56,493 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 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) [2023-12-15 23:01:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:01:56,879 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2023-12-15 23:01:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 23:01:56,881 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 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 47 [2023-12-15 23:01:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:01:56,884 INFO L225 Difference]: With dead ends: 144 [2023-12-15 23:01:56,884 INFO L226 Difference]: Without dead ends: 84 [2023-12-15 23:01:56,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-12-15 23:01:56,889 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 83 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:01:56,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 187 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 23:01:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-15 23:01:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2023-12-15 23:01:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 51 states have internal predecessors, (56), 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) [2023-12-15 23:01:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2023-12-15 23:01:56,907 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 47 [2023-12-15 23:01:56,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:01:56,907 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2023-12-15 23:01:56,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 9 states have internal predecessors, (41), 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) [2023-12-15 23:01:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2023-12-15 23:01:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-15 23:01:56,908 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:01:56,909 INFO L195 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] [2023-12-15 23:01:56,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 23:01:57,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:01:57,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:01:57,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:01:57,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1568532159, now seen corresponding path program 1 times [2023-12-15 23:01:57,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:01:57,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127579376] [2023-12-15 23:01:57,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:01:57,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:01:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:01:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 23:01:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 23:01:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 23:01:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 23:01:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 23:01:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 23:01:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 23:01:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 23:01:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-15 23:01:57,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:01:57,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127579376] [2023-12-15 23:01:57,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127579376] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:01:57,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:01:57,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 23:01:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244637244] [2023-12-15 23:01:57,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:01:57,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 23:01:57,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:01:57,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 23:01:57,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-15 23:01:57,409 INFO L87 Difference]: Start difference. First operand 81 states and 105 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) [2023-12-15 23:01:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:01:57,774 INFO L93 Difference]: Finished difference Result 144 states and 189 transitions. [2023-12-15 23:01:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 23:01:57,775 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 [2023-12-15 23:01:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:01:57,777 INFO L225 Difference]: With dead ends: 144 [2023-12-15 23:01:57,777 INFO L226 Difference]: Without dead ends: 86 [2023-12-15 23:01:57,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2023-12-15 23:01:57,778 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 112 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:01:57,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 214 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 23:01:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-15 23:01:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2023-12-15 23:01:57,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 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) [2023-12-15 23:01:57,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2023-12-15 23:01:57,796 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 59 [2023-12-15 23:01:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:01:57,797 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2023-12-15 23:01:57,798 INFO L496 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) [2023-12-15 23:01:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2023-12-15 23:01:57,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-15 23:01:57,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:01:57,799 INFO L195 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] [2023-12-15 23:01:57,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 23:01:57,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:01:57,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:01:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2046686025, now seen corresponding path program 1 times [2023-12-15 23:01:57,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:01:57,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851942999] [2023-12-15 23:01:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:01:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:01:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 23:01:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 23:01:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 23:01:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 23:01:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 23:01:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:58,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 23:01:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 23:01:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 23:01:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 23:01:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:58,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 23:01:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 23:01:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-15 23:01:58,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:01:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851942999] [2023-12-15 23:01:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851942999] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 23:01:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863849401] [2023-12-15 23:01:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:01:58,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:01:58,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:01:58,109 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) [2023-12-15 23:01:58,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 23:01:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:01:58,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-15 23:01:58,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 23:01:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-15 23:01:58,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 23:01:58,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863849401] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:01:58,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 23:01:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 18 [2023-12-15 23:01:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100964602] [2023-12-15 23:01:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:01:58,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:01:58,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:01:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:01:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2023-12-15 23:01:58,316 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:01:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:01:58,403 INFO L93 Difference]: Finished difference Result 135 states and 176 transitions. [2023-12-15 23:01:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 23:01:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 72 [2023-12-15 23:01:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:01:58,405 INFO L225 Difference]: With dead ends: 135 [2023-12-15 23:01:58,405 INFO L226 Difference]: Without dead ends: 85 [2023-12-15 23:01:58,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:01:58,406 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 34 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 23:01:58,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 544 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 23:01:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-15 23:01:58,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-15 23:01:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 22 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (31), 22 states have call predecessors, (31), 22 states have call successors, (31) [2023-12-15 23:01:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2023-12-15 23:01:58,412 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 72 [2023-12-15 23:01:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:01:58,412 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2023-12-15 23:01:58,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-15 23:01:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2023-12-15 23:01:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-15 23:01:58,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:01:58,415 INFO L195 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] [2023-12-15 23:01:58,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 23:01:58,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 23:01:58,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 23:01:58,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:01:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1573299318, now seen corresponding path program 1 times [2023-12-15 23:01:58,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:01:58,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124550231] [2023-12-15 23:01:58,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:01:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:01:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 23:01:58,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 23:01:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 23:01:58,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 23:01:58,683 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 23:01:58,684 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 23:01:58,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 23:01:58,687 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-15 23:01:58,690 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 23:01:58,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:01:58 BoogieIcfgContainer [2023-12-15 23:01:58,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 23:01:58,727 INFO L158 Benchmark]: Toolchain (without parser) took 5032.30ms. Allocated memory is still 408.9MB. Free memory was 354.4MB in the beginning and 181.4MB in the end (delta: 173.0MB). Peak memory consumption was 174.6MB. Max. memory is 8.0GB. [2023-12-15 23:01:58,727 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 23:01:58,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.76ms. Allocated memory is still 408.9MB. Free memory was 353.9MB in the beginning and 341.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 23:01:58,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.06ms. Allocated memory is still 408.9MB. Free memory was 341.3MB in the beginning and 339.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 23:01:58,728 INFO L158 Benchmark]: Boogie Preprocessor took 50.28ms. Allocated memory is still 408.9MB. Free memory was 339.7MB in the beginning and 336.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 23:01:58,728 INFO L158 Benchmark]: RCFGBuilder took 450.80ms. Allocated memory is still 408.9MB. Free memory was 336.1MB in the beginning and 313.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-15 23:01:58,728 INFO L158 Benchmark]: TraceAbstraction took 4311.31ms. Allocated memory is still 408.9MB. Free memory was 313.0MB in the beginning and 181.4MB in the end (delta: 131.6MB). Peak memory consumption was 133.7MB. Max. memory is 8.0GB. [2023-12-15 23:01:58,729 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.09ms. Allocated memory is still 209.7MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.76ms. Allocated memory is still 408.9MB. Free memory was 353.9MB in the beginning and 341.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.06ms. Allocated memory is still 408.9MB. Free memory was 341.3MB in the beginning and 339.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.28ms. Allocated memory is still 408.9MB. Free memory was 339.7MB in the beginning and 336.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 450.80ms. Allocated memory is still 408.9MB. Free memory was 336.1MB in the beginning and 313.5MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 4311.31ms. Allocated memory is still 408.9MB. Free memory was 313.0MB in the beginning and 181.4MB in the end (delta: 131.6MB). Peak memory consumption was 133.7MB. Max. memory is 8.0GB. * 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: [L98] 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}, n={-1:0}] [L98] RET, EXPR nondet_tree() [L98] CALL task(nondet_tree()) [L76] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->left VAL [n={-1:0}, n={-1:0}] [L40] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->left) VAL [n={-1:0}, n={-1:0}] [L40] int a = min(n->left); [L41] EXPR n->right VAL [a=2147483647, n={-1:0}, n={-1:0}] [L41] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->right) VAL [a=2147483647, n={-1:0}, n={-1:0}] [L41] int b = min(n->right); [L42] COND TRUE a <= b [L42] return a; VAL [\result=2147483647, a=2147483647, b=2147483647, n={-1:0}, n={-1:0}] [L76] RET, EXPR min(t) VAL [t={-1:0}, t={-1:0}] [L76] int a = min(t); [L77] int b; VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L79] CALL, EXPR size(t) VAL [t={-1:0}] [L71] COND FALSE !(!t) [L72] EXPR t->left VAL [t={-1:0}, t={-1:0}] [L72] CALL, EXPR size(t->left) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->left) VAL [t={-1:0}, t={-1:0}] [L72] EXPR t->right VAL [t={-1:0}, t={-1:0}] [L72] CALL, EXPR size(t->right) VAL [t={0:0}] [L71] COND TRUE !t [L71] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L72] RET, EXPR size(t->right) VAL [t={-1:0}, t={-1:0}] [L72] return size(t->left) + size(t->right) + 1; [L79] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}, t={-1:0}] [L79] int n = size(t); [L80] CALL assume_abort_if_not(n != 0) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L80] RET assume_abort_if_not(n != 0) [L81] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}] [L81] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}, x={-3:0}] [L82] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-3:0}, t={-1:0}] [L60] COND FALSE !(!t) [L63] EXPR t->left VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-1:0}, t={-1:0}] [L63] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=1, \result=1, a={-3:0}, a={-3:0}, i=1, t={0:0}, t={0:0}] [L63] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=1, t={-1:0}, t={-1:0}] [L63] i = tree_inorder(t->left, a, i) [L64] EXPR i++ [L64] EXPR t->data [L64] a[i++] = t->data [L65] EXPR t->right VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}] [L65] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-3:0}, t={0:0}] [L60] COND TRUE !t [L61] return i; VAL [\old(i)=2, \result=2, a={-3:0}, a={-3:0}, i=2, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}] [L65] i = tree_inorder(t->right, a, i) [L66] return i; VAL [\old(i)=1, \result=2, a={-3:0}, a={-3:0}, i=2, t={-1:0}, t={-1:0}] [L82] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, t={-1:0}, x={-3:0}] [L83] EXPR x[0] [L83] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 1177 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 925 mSDsCounter, 316 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1498 IncrementalHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 316 mSolverCounterUnsat, 252 mSDtfsCounter, 1498 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 1113 SizeOfPredicates, 10 NumberOfNonLiveVariables, 627 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 124/132 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! [2023-12-15 23:01:58,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...