./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_max_incorrect.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/verifythis/tree_max_incorrect.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '4f9d3bc4199d475d16a98f98af89b165bc24fe0a085f06600e60f95805b0186f'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_max_incorrect.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4f9d3bc4199d475d16a98f98af89b165bc24fe0a085f06600e60f95805b0186f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:56:03,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:56:03,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:56:03,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:56:03,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:56:03,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:56:03,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:56:03,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:56:03,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:56:03,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:56:03,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:56:03,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:56:03,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:56:03,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:56:03,790 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:56:03,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:56:03,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:56:03,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:56:03,791 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:56:03,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:56:03,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:56:03,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:56:03,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:56:03,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:56:03,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:56:03,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:56:03,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:56:03,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:56:03,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:56:03,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:56:03,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:56:03,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:56:03,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:56:03,793 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 4f9d3bc4199d475d16a98f98af89b165bc24fe0a085f06600e60f95805b0186f [2024-11-06 23:56:04,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:56:04,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:56:04,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:56:04,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:56:04,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:56:04,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max_incorrect.c [2024-11-06 23:56:05,386 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:56:05,608 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:56:05,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c [2024-11-06 23:56:05,615 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5b1e9b27/2c5900f3b9304d0b9c69a2d3297ed545/FLAGe6ad438cf [2024-11-06 23:56:05,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5b1e9b27/2c5900f3b9304d0b9c69a2d3297ed545 [2024-11-06 23:56:05,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:56:05,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:56:05,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:56:05,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:56:05,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:56:05,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ccb8a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05, skipping insertion in model container [2024-11-06 23:56:05,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:56:05,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c[466,479] [2024-11-06 23:56:05,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:56:05,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:56:05,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max_incorrect.c[466,479] [2024-11-06 23:56:05,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:56:05,839 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:56:05,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05 WrapperNode [2024-11-06 23:56:05,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:56:05,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:56:05,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:56:05,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:56:05,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,871 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2024-11-06 23:56:05,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:56:05,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:56:05,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:56:05,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:56:05,882 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,910 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-11-06 23:56:05,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:56:05,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:56:05,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:56:05,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:56:05,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (1/1) ... [2024-11-06 23:56:05,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:56:05,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:56:05,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 23:56:05,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 23:56:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 23:56:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 23:56:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:56:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure max [2024-11-06 23:56:06,001 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2024-11-06 23:56:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2024-11-06 23:56:06,001 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2024-11-06 23:56:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:56:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 23:56:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-06 23:56:06,002 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-06 23:56:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 23:56:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 23:56:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 23:56:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 23:56:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 23:56:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:56:06,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:56:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 23:56:06,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 23:56:06,107 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:56:06,109 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:56:06,290 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-06 23:56:06,290 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:56:06,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:56:06,299 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-06 23:56:06,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:56:06 BoogieIcfgContainer [2024-11-06 23:56:06,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:56:06,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:56:06,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:56:06,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:56:06,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:56:05" (1/3) ... [2024-11-06 23:56:06,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81a4da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:56:06, skipping insertion in model container [2024-11-06 23:56:06,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:56:05" (2/3) ... [2024-11-06 23:56:06,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81a4da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:56:06, skipping insertion in model container [2024-11-06 23:56:06,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:56:06" (3/3) ... [2024-11-06 23:56:06,310 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_max_incorrect.c [2024-11-06 23:56:06,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:56:06,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:56:06,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:56:06,380 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;@a45c1c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:56:06,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:56:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-06 23:56:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 23:56:06,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:56:06,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:56:06,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:56:06,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:56:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1678766983, now seen corresponding path program 1 times [2024-11-06 23:56:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:56:06,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429720862] [2024-11-06 23:56:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:56:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:56:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:56:06,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:56:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:56:06,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:56:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:56:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:56:06,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:56:06,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429720862] [2024-11-06 23:56:06,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429720862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:56:06,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:56:06,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:56:06,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676138086] [2024-11-06 23:56:06,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:56:06,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:56:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:56:06,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:56:06,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:56:06,973 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 23:56:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:56:07,381 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2024-11-06 23:56:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 23:56:07,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-11-06 23:56:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:56:07,391 INFO L225 Difference]: With dead ends: 69 [2024-11-06 23:56:07,392 INFO L226 Difference]: Without dead ends: 35 [2024-11-06 23:56:07,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:56:07,398 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:56:07,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 114 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 23:56:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-06 23:56:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-06 23:56:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-06 23:56:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-11-06 23:56:07,444 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 19 [2024-11-06 23:56:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:56:07,445 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-11-06 23:56:07,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-06 23:56:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-11-06 23:56:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 23:56:07,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:56:07,448 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] [2024-11-06 23:56:07,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:56:07,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:56:07,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:56:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1642559178, now seen corresponding path program 1 times [2024-11-06 23:56:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:56:07,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004926782] [2024-11-06 23:56:07,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:56:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:56:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:56:07,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:56:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:56:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:56:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:56:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-06 23:56:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:56:07,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 23:56:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:56:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 23:56:07,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:56:07,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004926782] [2024-11-06 23:56:07,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004926782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:56:07,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:56:07,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-06 23:56:07,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268677135] [2024-11-06 23:56:07,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:56:07,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 23:56:07,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:56:07,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 23:56:07,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:56:07,845 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 23:56:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:56:08,051 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-11-06 23:56:08,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 23:56:08,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-11-06 23:56:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:56:08,053 INFO L225 Difference]: With dead ends: 48 [2024-11-06 23:56:08,053 INFO L226 Difference]: Without dead ends: 37 [2024-11-06 23:56:08,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:56:08,055 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:56:08,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 115 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:56:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-06 23:56:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-06 23:56:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 27 states have internal predecessors, (28), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-06 23:56:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-11-06 23:56:08,062 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 31 [2024-11-06 23:56:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:56:08,062 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-06 23:56:08,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 23:56:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-11-06 23:56:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 23:56:08,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:56:08,064 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] [2024-11-06 23:56:08,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:56:08,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:56:08,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:56:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash -207997582, now seen corresponding path program 1 times [2024-11-06 23:56:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:56:08,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655783241] [2024-11-06 23:56:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:56:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:56:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:56:08,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 23:56:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:56:08,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 23:56:08,153 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 23:56:08,154 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location checkErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 23:56:08,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:56:08,158 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-06 23:56:08,185 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 23:56:08,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:56:08 BoogieIcfgContainer [2024-11-06 23:56:08,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 23:56:08,189 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 23:56:08,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 23:56:08,190 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 23:56:08,190 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:56:06" (3/4) ... [2024-11-06 23:56:08,191 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 23:56:08,238 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 23:56:08,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 23:56:08,239 INFO L158 Benchmark]: Toolchain (without parser) took 2600.09ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 38.3MB in the end (delta: 53.2MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2024-11-06 23:56:08,239 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:56:08,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.24ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 80.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:56:08,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.32ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 79.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:56:08,239 INFO L158 Benchmark]: Boogie Preprocessor took 59.84ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 77.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:56:08,240 INFO L158 Benchmark]: RCFGBuilder took 362.40ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 64.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:56:08,240 INFO L158 Benchmark]: TraceAbstraction took 1886.14ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 40.7MB in the end (delta: 23.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-06 23:56:08,240 INFO L158 Benchmark]: Witness Printer took 49.08ms. Allocated memory is still 117.4MB. Free memory was 40.7MB in the beginning and 38.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:56:08,241 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.50ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.24ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 80.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.32ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 79.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.84ms. Allocated memory is still 117.4MB. Free memory was 79.1MB in the beginning and 77.3MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 362.40ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 64.3MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1886.14ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 40.7MB in the end (delta: 23.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 49.08ms. Allocated memory is still 117.4MB. Free memory was 40.7MB in the beginning and 38.3MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. 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: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L60] CALL, EXPR nondet_tree() [L20] COND FALSE !(__VERIFIER_nondet_bool()) [L23] struct node *n = (struct node *)malloc(sizeof(struct node)); [L24] n->data = __VERIFIER_nondet_int() [L25] CALL, EXPR nondet_tree() [L20] COND TRUE __VERIFIER_nondet_bool() [L21] return 0; VAL [\result={0:0}] [L25] RET, EXPR nondet_tree() VAL [n={-1:0}] [L25] n->left = nondet_tree() [L26] CALL, EXPR nondet_tree() [L20] COND TRUE __VERIFIER_nondet_bool() [L21] return 0; VAL [\result={0:0}] [L26] RET, EXPR nondet_tree() VAL [n={-1:0}] [L26] n->right = nondet_tree() [L27] return n; VAL [\result={-1:0}] [L60] RET, EXPR nondet_tree() [L60] CALL task(nondet_tree()) [L55] CALL, EXPR max(n) VAL [\old(n)={-1:0}] [L32] COND FALSE !(!n) [L35] EXPR n->left VAL [\old(n)={-1:0}, n={-1:0}] [L35] CALL, EXPR max(n->left) VAL [\old(n)={0:0}] [L32] COND TRUE !n [L33] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L35] RET, EXPR max(n->left) VAL [\old(n)={-1:0}, n={-1:0}] [L35] int a = max(n->left); [L36] EXPR n->right VAL [\old(n)={-1:0}, a=-2147483648] [L36] CALL, EXPR max(n->right) VAL [\old(n)={0:0}] [L32] COND TRUE !n [L33] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L36] RET, EXPR max(n->right) VAL [\old(n)={-1:0}, a=-2147483648] [L36] int b = max(n->right); [L37] COND TRUE a >= b [L37] return a; VAL [\old(n)={-1:0}, \result=-2147483648] [L55] RET, EXPR max(n) VAL [n={-1:0}] [L55] int a = max(n); [L56] CALL check(n, a) [L43] COND TRUE \read(*n) [L44] EXPR n->data [L44] CALL __VERIFIER_assert(n->data <= a) [L11] COND TRUE !cond [L11] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 38 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-06 23:56:08,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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