./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum10.i --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/reducercommutativity/rangesum10.i', '-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', '43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652'] 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/reducercommutativity/rangesum10.i -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 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:19:19,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:19:19,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:19:19,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:19:19,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:19:19,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:19:19,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:19:19,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:19:19,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:19:19,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:19:19,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:19:19,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:19:19,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:19:19,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:19:19,919 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:19:19,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:19:19,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:19:19,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:19:19,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:19:19,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:19:19,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:19:19,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:19:19,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:19:19,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:19:19,921 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:19:19,921 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:19:19,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:19:19,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:19:19,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:19:19,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:19:19,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:19:19,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:19:19,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:19:19,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:19:19,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:19:19,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:19:19,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:19:19,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:19:19,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:19:19,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:19:19,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:19:19,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:19:19,924 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 -> 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 [2024-11-06 18:19:20,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:19:20,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:19:20,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:19:20,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:19:20,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:19:20,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-11-06 18:19:21,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:19:22,193 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:19:22,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2024-11-06 18:19:22,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35a3bd5c2/e7b7457fd18f490895960013c61f3753/FLAG4b1ebbf93 [2024-11-06 18:19:22,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35a3bd5c2/e7b7457fd18f490895960013c61f3753 [2024-11-06 18:19:22,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:19:22,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:19:22,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:19:22,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:19:22,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:19:22,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239bd9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22, skipping insertion in model container [2024-11-06 18:19:22,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:19:22,421 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/reducercommutativity/rangesum10.i[1465,1478] [2024-11-06 18:19:22,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:19:22,439 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:19:22,466 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/reducercommutativity/rangesum10.i[1465,1478] [2024-11-06 18:19:22,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:19:22,484 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:19:22,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22 WrapperNode [2024-11-06 18:19:22,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:19:22,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:19:22,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:19:22,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:19:22,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,516 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2024-11-06 18:19:22,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:19:22,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:19:22,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:19:22,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:19:22,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,554 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-06 18:19:22,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:19:22,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:19:22,583 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:19:22,583 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:19:22,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (1/1) ... [2024-11-06 18:19:22,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:19:22,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:22,624 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 18:19:22,631 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 18:19:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:19:22,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:19:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 18:19:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 18:19:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 18:19:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 18:19:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:19:22,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:19:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 18:19:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 18:19:22,655 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2024-11-06 18:19:22,656 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2024-11-06 18:19:22,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 18:19:22,722 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:19:22,723 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:19:22,878 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-06 18:19:22,878 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:19:22,888 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:19:22,889 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-06 18:19:22,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:19:22 BoogieIcfgContainer [2024-11-06 18:19:22,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:19:22,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:19:22,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:19:22,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:19:22,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:19:22" (1/3) ... [2024-11-06 18:19:22,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24575c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:19:22, skipping insertion in model container [2024-11-06 18:19:22,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:19:22" (2/3) ... [2024-11-06 18:19:22,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24575c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:19:22, skipping insertion in model container [2024-11-06 18:19:22,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:19:22" (3/3) ... [2024-11-06 18:19:22,903 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum10.i [2024-11-06 18:19:22,918 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:19:22,919 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:19:22,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:19:22,985 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;@2120ce9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:19:22,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:19:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-06 18:19:22,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:23,000 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:23,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:23,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:23,007 INFO L85 PathProgramCache]: Analyzing trace with hash -275565944, now seen corresponding path program 1 times [2024-11-06 18:19:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:23,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42198807] [2024-11-06 18:19:23,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-06 18:19:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 18:19:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-06 18:19:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:19:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42198807] [2024-11-06 18:19:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42198807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:19:23,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:19:23,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:19:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845152193] [2024-11-06 18:19:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:19:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:19:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:23,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:19:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:19:23,454 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:19:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:23,490 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2024-11-06 18:19:23,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:19:23,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2024-11-06 18:19:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:23,499 INFO L225 Difference]: With dead ends: 54 [2024-11-06 18:19:23,500 INFO L226 Difference]: Without dead ends: 26 [2024-11-06 18:19:23,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:19:23,508 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:23,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:23,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-06 18:19:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-06 18:19:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-11-06 18:19:23,540 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 29 [2024-11-06 18:19:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:23,541 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-11-06 18:19:23,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 18:19:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-11-06 18:19:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 18:19:23,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:23,544 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:23,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:19:23,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:23,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash -653100523, now seen corresponding path program 1 times [2024-11-06 18:19:23,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:23,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192355866] [2024-11-06 18:19:23,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 18:19:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-06 18:19:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-06 18:19:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:19:23,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:23,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192355866] [2024-11-06 18:19:23,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192355866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:23,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357297803] [2024-11-06 18:19:23,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:23,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:23,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:23,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:23,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 18:19:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:23,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:19:23,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 18:19:23,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:19:23,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357297803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:19:23,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:19:23,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 18:19:23,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924292914] [2024-11-06 18:19:23,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:19:23,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:19:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:23,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:19:23,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:19:23,944 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:23,973 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-06 18:19:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:19:23,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-06 18:19:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:23,975 INFO L225 Difference]: With dead ends: 46 [2024-11-06 18:19:23,975 INFO L226 Difference]: Without dead ends: 28 [2024-11-06 18:19:23,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:19:23,976 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:23,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-06 18:19:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-06 18:19:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-06 18:19:23,986 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 31 [2024-11-06 18:19:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:23,986 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-06 18:19:23,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-06 18:19:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 18:19:23,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:23,989 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:24,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 18:19:24,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:24,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:24,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1081404920, now seen corresponding path program 1 times [2024-11-06 18:19:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30454059] [2024-11-06 18:19:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 18:19:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:19:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-06 18:19:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-06 18:19:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30454059] [2024-11-06 18:19:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30454059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537546073] [2024-11-06 18:19:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:24,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:24,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 18:19:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:19:24,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-06 18:19:24,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:19:24,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537546073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:19:24,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:19:24,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-06 18:19:24,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628462563] [2024-11-06 18:19:24,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:19:24,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:19:24,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:24,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:19:24,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:19:24,579 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:24,598 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-11-06 18:19:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:19:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-06 18:19:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:24,602 INFO L225 Difference]: With dead ends: 44 [2024-11-06 18:19:24,602 INFO L226 Difference]: Without dead ends: 29 [2024-11-06 18:19:24,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:19:24,603 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:24,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-06 18:19:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-06 18:19:24,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-06 18:19:24,613 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 40 [2024-11-06 18:19:24,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:24,614 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-06 18:19:24,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-06 18:19:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:19:24,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:24,618 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:24,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 18:19:24,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:24,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:24,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:24,819 INFO L85 PathProgramCache]: Analyzing trace with hash -673301430, now seen corresponding path program 1 times [2024-11-06 18:19:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:24,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400103524] [2024-11-06 18:19:24,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:24,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 18:19:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:19:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 18:19:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:19:24,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:24,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400103524] [2024-11-06 18:19:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400103524] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:24,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018794519] [2024-11-06 18:19:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:24,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:24,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:24,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:24,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 18:19:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:19:25,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 18:19:25,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:19:25,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018794519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:19:25,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:19:25,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-06 18:19:25,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754415322] [2024-11-06 18:19:25,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:19:25,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:19:25,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:25,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:19:25,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:19:25,107 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:25,137 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-06 18:19:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:19:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-06 18:19:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:25,140 INFO L225 Difference]: With dead ends: 53 [2024-11-06 18:19:25,140 INFO L226 Difference]: Without dead ends: 32 [2024-11-06 18:19:25,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 18:19:25,142 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:25,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-06 18:19:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-06 18:19:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-06 18:19:25,152 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 42 [2024-11-06 18:19:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:25,152 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-06 18:19:25,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 18:19:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-06 18:19:25,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 18:19:25,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:25,154 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:25,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 18:19:25,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:25,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:25,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1042180377, now seen corresponding path program 1 times [2024-11-06 18:19:25,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852442553] [2024-11-06 18:19:25,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-06 18:19:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-06 18:19:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-06 18:19:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 18:19:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852442553] [2024-11-06 18:19:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852442553] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:25,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237004933] [2024-11-06 18:19:25,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:25,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:25,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:25,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:25,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 18:19:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 18:19:25,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-06 18:19:25,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-06 18:19:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237004933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:25,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-06 18:19:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486632886] [2024-11-06 18:19:25,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:25,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 18:19:25,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 18:19:25,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:19:25,616 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-06 18:19:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:25,681 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2024-11-06 18:19:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 18:19:25,682 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-11-06 18:19:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:25,683 INFO L225 Difference]: With dead ends: 69 [2024-11-06 18:19:25,683 INFO L226 Difference]: Without dead ends: 42 [2024-11-06 18:19:25,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 18:19:25,685 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:25,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:19:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-06 18:19:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-06 18:19:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-06 18:19:25,690 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2024-11-06 18:19:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:25,690 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-06 18:19:25,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-06 18:19:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-06 18:19:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 18:19:25,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:25,692 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:25,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 18:19:25,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:25,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:25,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -604386836, now seen corresponding path program 2 times [2024-11-06 18:19:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90789516] [2024-11-06 18:19:25,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:25,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-06 18:19:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-06 18:19:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-06 18:19:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-06 18:19:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90789516] [2024-11-06 18:19:25,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90789516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186243412] [2024-11-06 18:19:25,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:19:25,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:25,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:25,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:25,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 18:19:26,081 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:19:26,081 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:26,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 18:19:26,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-06 18:19:26,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-06 18:19:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186243412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:26,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:26,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2024-11-06 18:19:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009179294] [2024-11-06 18:19:26,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:26,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 18:19:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 18:19:26,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:19:26,260 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:26,319 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2024-11-06 18:19:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 18:19:26,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-11-06 18:19:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:26,320 INFO L225 Difference]: With dead ends: 86 [2024-11-06 18:19:26,320 INFO L226 Difference]: Without dead ends: 56 [2024-11-06 18:19:26,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-06 18:19:26,322 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:26,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-06 18:19:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-11-06 18:19:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2024-11-06 18:19:26,328 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 57 [2024-11-06 18:19:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:26,328 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2024-11-06 18:19:26,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2024-11-06 18:19:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-06 18:19:26,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:26,329 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:26,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 18:19:26,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:26,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash 948362870, now seen corresponding path program 1 times [2024-11-06 18:19:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149387897] [2024-11-06 18:19:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 18:19:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-06 18:19:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-06 18:19:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-06 18:19:26,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:26,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149387897] [2024-11-06 18:19:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149387897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458810366] [2024-11-06 18:19:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:26,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:26,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:26,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:26,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 18:19:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:26,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 18:19:26,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-06 18:19:26,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-06 18:19:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458810366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:26,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:26,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-06 18:19:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70728778] [2024-11-06 18:19:26,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:26,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 18:19:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:26,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 18:19:26,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:19:26,922 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:26,995 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2024-11-06 18:19:26,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:19:26,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2024-11-06 18:19:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:26,998 INFO L225 Difference]: With dead ends: 92 [2024-11-06 18:19:26,998 INFO L226 Difference]: Without dead ends: 66 [2024-11-06 18:19:26,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-06 18:19:26,998 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:26,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 133 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:19:26,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-06 18:19:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-11-06 18:19:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-06 18:19:27,011 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 78 [2024-11-06 18:19:27,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:27,011 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-06 18:19:27,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-06 18:19:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-06 18:19:27,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:27,016 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 10, 10, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:27,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 18:19:27,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-06 18:19:27,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:27,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash -142865288, now seen corresponding path program 2 times [2024-11-06 18:19:27,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:27,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369290654] [2024-11-06 18:19:27,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:27,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 18:19:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-06 18:19:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 18:19:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2024-11-06 18:19:27,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369290654] [2024-11-06 18:19:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369290654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645607134] [2024-11-06 18:19:27,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 18:19:27,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:27,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:27,441 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:27,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 18:19:27,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 18:19:27,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:27,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 18:19:27,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 326 proven. 70 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-11-06 18:19:27,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-11-06 18:19:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645607134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:27,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 15 [2024-11-06 18:19:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778621706] [2024-11-06 18:19:27,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:27,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-06 18:19:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:27,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-06 18:19:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:19:27,846 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:27,937 INFO L93 Difference]: Finished difference Result 117 states and 137 transitions. [2024-11-06 18:19:27,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 18:19:27,938 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-11-06 18:19:27,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:27,939 INFO L225 Difference]: With dead ends: 117 [2024-11-06 18:19:27,939 INFO L226 Difference]: Without dead ends: 77 [2024-11-06 18:19:27,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 222 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2024-11-06 18:19:27,940 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:27,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 174 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:19:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-06 18:19:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-06 18:19:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:27,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-11-06 18:19:27,955 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 116 [2024-11-06 18:19:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:27,956 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-11-06 18:19:27,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 states have internal predecessors, (70), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 18:19:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-11-06 18:19:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-06 18:19:27,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:27,961 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:27,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 18:19:28,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:28,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:28,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 681168413, now seen corresponding path program 3 times [2024-11-06 18:19:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:28,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014088512] [2024-11-06 18:19:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 18:19:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-06 18:19:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-06 18:19:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-06 18:19:28,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014088512] [2024-11-06 18:19:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014088512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060426552] [2024-11-06 18:19:28,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 18:19:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:28,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:28,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:28,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 18:19:28,542 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-06 18:19:28,543 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:28,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 18:19:28,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 650 proven. 9 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-06 18:19:28,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-06 18:19:28,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060426552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:28,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:28,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-06 18:19:28,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534879495] [2024-11-06 18:19:28,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:28,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 18:19:28,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:28,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 18:19:28,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:19:28,648 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:28,694 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2024-11-06 18:19:28,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 18:19:28,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 145 [2024-11-06 18:19:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:28,696 INFO L225 Difference]: With dead ends: 127 [2024-11-06 18:19:28,696 INFO L226 Difference]: Without dead ends: 86 [2024-11-06 18:19:28,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-06 18:19:28,697 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:28,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-06 18:19:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-06 18:19:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-11-06 18:19:28,706 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 145 [2024-11-06 18:19:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:28,706 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-11-06 18:19:28,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-11-06 18:19:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-06 18:19:28,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:28,708 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:28,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-06 18:19:28,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:28,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:28,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash 26761619, now seen corresponding path program 4 times [2024-11-06 18:19:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:28,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579484326] [2024-11-06 18:19:28,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:29,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-06 18:19:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-06 18:19:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:29,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-06 18:19:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:19:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-06 18:19:29,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:19:29,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579484326] [2024-11-06 18:19:29,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579484326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:19:29,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279876704] [2024-11-06 18:19:29,255 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 18:19:29,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:29,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:29,257 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:29,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 18:19:29,454 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 18:19:29,454 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 18:19:29,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-06 18:19:29,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:19:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 650 proven. 64 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2024-11-06 18:19:29,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 18:19:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2024-11-06 18:19:29,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279876704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 18:19:29,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 18:19:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 12 [2024-11-06 18:19:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906829656] [2024-11-06 18:19:29,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 18:19:29,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 18:19:29,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:19:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 18:19:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:19:29,629 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:29,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:19:29,666 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2024-11-06 18:19:29,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 18:19:29,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 155 [2024-11-06 18:19:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:19:29,667 INFO L225 Difference]: With dead ends: 129 [2024-11-06 18:19:29,667 INFO L226 Difference]: Without dead ends: 88 [2024-11-06 18:19:29,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 306 SyntacticMatches, 9 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-06 18:19:29,668 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 18:19:29,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 18:19:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-06 18:19:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-06 18:19:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0963855421686748) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 18:19:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-06 18:19:29,679 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 155 [2024-11-06 18:19:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:19:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-06 18:19:29,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 18:19:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-06 18:19:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-06 18:19:29,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:19:29,684 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:19:29,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-06 18:19:29,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:29,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:19:29,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:19:29,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1925080943, now seen corresponding path program 5 times [2024-11-06 18:19:29,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:19:29,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111373084] [2024-11-06 18:19:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:19:29,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:19:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-06 18:19:30,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424107419] [2024-11-06 18:19:30,156 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-06 18:19:30,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:30,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:19:30,159 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 18:19:30,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-06 18:19:35,912 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2024-11-06 18:19:35,912 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-06 18:19:35,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 18:19:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 18:19:36,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 18:19:36,400 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 18:19:36,401 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:19:36,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-06 18:19:36,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:19:36,607 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1] [2024-11-06 18:19:36,711 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:19:36,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:19:36 BoogieIcfgContainer [2024-11-06 18:19:36,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:19:36,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:19:36,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:19:36,717 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:19:36,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:19:22" (3/4) ... [2024-11-06 18:19:36,719 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 18:19:36,819 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:19:36,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:19:36,820 INFO L158 Benchmark]: Toolchain (without parser) took 14591.16ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.5MB in the beginning and 53.7MB in the end (delta: 22.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-06 18:19:36,821 INFO L158 Benchmark]: CDTParser took 1.29ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:19:36,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.45ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 65.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:19:36,821 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.51ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 63.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:19:36,821 INFO L158 Benchmark]: Boogie Preprocessor took 62.96ms. Allocated memory is still 100.7MB. Free memory was 63.9MB in the beginning and 62.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:19:36,821 INFO L158 Benchmark]: RCFGBuilder took 307.76ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 50.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:19:36,821 INFO L158 Benchmark]: TraceAbstraction took 13822.91ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 49.9MB in the beginning and 62.1MB in the end (delta: -12.2MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-06 18:19:36,822 INFO L158 Benchmark]: Witness Printer took 103.42ms. Allocated memory is still 125.8MB. Free memory was 62.1MB in the beginning and 53.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:19:36,827 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.29ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.45ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 65.2MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.51ms. Allocated memory is still 100.7MB. Free memory was 65.2MB in the beginning and 63.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.96ms. Allocated memory is still 100.7MB. Free memory was 63.9MB in the beginning and 62.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 307.76ms. Allocated memory is still 100.7MB. Free memory was 62.2MB in the beginning and 50.5MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13822.91ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 49.9MB in the beginning and 62.1MB in the end (delta: -12.2MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Witness Printer took 103.42ms. Allocated memory is still 125.8MB. Free memory was 62.1MB in the beginning and 53.7MB in the end (delta: 8.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: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[10]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND FALSE !(i < 10) VAL [x={3:0}] [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-2147483647, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-2147483647, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-2147483647, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=-2147483656, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-2147483656, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=-2147483656, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=-2147483666, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-2147483666, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=-2147483666, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-2147483661, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-2147483661, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-2147483661, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-536870915, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-2147483647, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-2147483647, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-2147483647, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=-2147483656, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-2147483656, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=-2147483656, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=-2147483666, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-2147483666, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=-2147483666, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-2147483661, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-2147483661, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-2147483661, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-536870915, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-536870915, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L54] COND FALSE !(i<10 -1) VAL [ret2=-536870915, ret=-536870915, temp=6, x={3:0}] [L57] x[10 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-9, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-9, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-9, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=-19, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=-19, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=-19, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=-14, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=-14, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=-14, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-8, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-8, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-8, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-2, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-536870915, ret=-536870915, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 11, TraceHistogramMax: 30, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 948 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 679 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 269 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1403 GetRequests, 1315 SyntacticMatches, 15 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=10, InterpolantAutomatonStates: 80, 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, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1755 NumberOfCodeBlocks, 1667 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2009 ConstructedInterpolants, 0 QuantifiedInterpolants, 2405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2157 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 12150/13043 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 18:19:36,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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