./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/rangesum.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 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:14:39,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:14:39,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:14:39,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:14:39,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:14:39,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:14:39,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:14:39,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:14:39,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:14:39,794 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:14:39,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:14:39,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:14:39,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:14:39,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:14:39,795 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:14:39,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:14:39,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:14:39,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:14:39,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:14:39,797 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 -> 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 [2025-01-08 22:14:40,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:14:40,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:14:40,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:14:40,014 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:14:40,015 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:14:40,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum.i [2025-01-08 22:14:41,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df4f1c4ae/d96a37ae7ccb4c79907a390dc4cab4bf/FLAG0d2e178b5 [2025-01-08 22:14:41,409 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:14:41,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2025-01-08 22:14:41,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df4f1c4ae/d96a37ae7ccb4c79907a390dc4cab4bf/FLAG0d2e178b5 [2025-01-08 22:14:41,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/df4f1c4ae/d96a37ae7ccb4c79907a390dc4cab4bf [2025-01-08 22:14:41,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:14:41,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:14:41,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:14:41,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:14:41,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:14:41,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e05c42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41, skipping insertion in model container [2025-01-08 22:14:41,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:14:41,569 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/rangesum.i[1544,1557] [2025-01-08 22:14:41,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:14:41,584 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:14:41,600 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/rangesum.i[1544,1557] [2025-01-08 22:14:41,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:14:41,613 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:14:41,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41 WrapperNode [2025-01-08 22:14:41,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:14:41,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:14:41,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:14:41,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:14:41,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,641 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-01-08 22:14:41,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:14:41,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:14:41,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:14:41,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:14:41,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,668 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]. [2025-01-08 22:14:41,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:14:41,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:14:41,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:14:41,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:14:41,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (1/1) ... [2025-01-08 22:14:41,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:14:41,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:41,710 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) [2025-01-08 22:14:41,715 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 [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:14:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2025-01-08 22:14:41,731 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2025-01-08 22:14:41,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:14:41,799 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:14:41,800 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:14:41,897 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-08 22:14:41,897 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:14:41,903 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:14:41,903 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:14:41,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:14:41 BoogieIcfgContainer [2025-01-08 22:14:41,904 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:14:41,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:14:41,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:14:41,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:14:41,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:14:41" (1/3) ... [2025-01-08 22:14:41,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e30a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:14:41, skipping insertion in model container [2025-01-08 22:14:41,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:14:41" (2/3) ... [2025-01-08 22:14:41,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e30a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:14:41, skipping insertion in model container [2025-01-08 22:14:41,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:14:41" (3/3) ... [2025-01-08 22:14:41,910 INFO L128 eAbstractionObserver]: Analyzing ICFG rangesum.i [2025-01-08 22:14:41,920 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:14:41,922 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rangesum.i that has 2 procedures, 27 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-08 22:14:41,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:14:41,959 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;@b7d8a9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:14:41,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:14:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 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) [2025-01-08 22:14:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:14:41,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:41,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:41,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:41,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:41,976 INFO L85 PathProgramCache]: Analyzing trace with hash -695841833, now seen corresponding path program 1 times [2025-01-08 22:14:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:41,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646582329] [2025-01-08 22:14:41,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:41,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:42,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:14:42,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:14:42,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:42,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:14:42,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:42,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646582329] [2025-01-08 22:14:42,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646582329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:14:42,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:14:42,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:14:42,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310452362] [2025-01-08 22:14:42,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:14:42,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:14:42,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:42,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:14:42,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:14:42,207 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 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) [2025-01-08 22:14:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:42,236 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-01-08 22:14:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:14:42,237 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 [2025-01-08 22:14:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:42,240 INFO L225 Difference]: With dead ends: 51 [2025-01-08 22:14:42,240 INFO L226 Difference]: Without dead ends: 23 [2025-01-08 22:14:42,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:14:42,246 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:42,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:14:42,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-08 22:14:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-08 22:14:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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) [2025-01-08 22:14:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-01-08 22:14:42,265 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 29 [2025-01-08 22:14:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:42,266 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-01-08 22:14:42,266 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) [2025-01-08 22:14:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-01-08 22:14:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:14:42,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:42,267 INFO L218 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] [2025-01-08 22:14:42,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:14:42,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:42,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:42,268 INFO L85 PathProgramCache]: Analyzing trace with hash -182875492, now seen corresponding path program 1 times [2025-01-08 22:14:42,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:42,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287760016] [2025-01-08 22:14:42,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:42,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:14:42,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:14:42,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:42,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:14:42,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:42,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287760016] [2025-01-08 22:14:42,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287760016] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:42,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622245553] [2025-01-08 22:14:42,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:42,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:42,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:42,443 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) [2025-01-08 22:14:42,448 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 [2025-01-08 22:14:42,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:14:42,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:14:42,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:42,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:42,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:14:42,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:14:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:14:42,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:14:42,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622245553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:14:42,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:14:42,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-08 22:14:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194837043] [2025-01-08 22:14:42,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:14:42,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:14:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:42,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:14:42,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:14:42,565 INFO L87 Difference]: Start difference. First operand 23 states and 29 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) [2025-01-08 22:14:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:42,580 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2025-01-08 22:14:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:14:42,580 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 30 [2025-01-08 22:14:42,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:42,581 INFO L225 Difference]: With dead ends: 43 [2025-01-08 22:14:42,581 INFO L226 Difference]: Without dead ends: 27 [2025-01-08 22:14:42,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:14:42,582 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 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 [2025-01-08 22:14:42,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:14:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-08 22:14:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-08 22:14:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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) [2025-01-08 22:14:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-01-08 22:14:42,589 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 30 [2025-01-08 22:14:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:42,590 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-01-08 22:14:42,590 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) [2025-01-08 22:14:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-01-08 22:14:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-08 22:14:42,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:42,590 INFO L218 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] [2025-01-08 22:14:42,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:14:42,796 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 [2025-01-08 22:14:42,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:42,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:42,798 INFO L85 PathProgramCache]: Analyzing trace with hash -448454053, now seen corresponding path program 1 times [2025-01-08 22:14:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:42,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324090053] [2025-01-08 22:14:42,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:42,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:14:42,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:14:42,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:42,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:14:42,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324090053] [2025-01-08 22:14:42,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324090053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416320279] [2025-01-08 22:14:42,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:42,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:42,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:42,889 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) [2025-01-08 22:14:42,891 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 [2025-01-08 22:14:42,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-08 22:14:42,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-08 22:14:42,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:42,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:42,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:14:42,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:14:42,975 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:14:42,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:14:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:14:43,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416320279] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:14:43,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:14:43,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-01-08 22:14:43,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788952336] [2025-01-08 22:14:43,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:14:43,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:14:43,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:43,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:14:43,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:14:43,011 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:14:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:43,092 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2025-01-08 22:14:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:14:43,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2025-01-08 22:14:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:43,093 INFO L225 Difference]: With dead ends: 53 [2025-01-08 22:14:43,093 INFO L226 Difference]: Without dead ends: 31 [2025-01-08 22:14:43,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:14:43,094 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:43,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:14:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-08 22:14:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-01-08 22:14:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 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) [2025-01-08 22:14:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-01-08 22:14:43,097 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 30 [2025-01-08 22:14:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:43,097 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-01-08 22:14:43,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:14:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-01-08 22:14:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-08 22:14:43,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:43,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:43,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:14:43,298 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 [2025-01-08 22:14:43,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1065664210, now seen corresponding path program 1 times [2025-01-08 22:14:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273680449] [2025-01-08 22:14:43,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:43,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-08 22:14:43,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-08 22:14:43,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:43,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-08 22:14:43,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:43,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273680449] [2025-01-08 22:14:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273680449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:14:43,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:14:43,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:14:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132567023] [2025-01-08 22:14:43,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:14:43,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:14:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:43,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:14:43,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:14:43,399 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:14:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:43,438 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2025-01-08 22:14:43,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:14:43,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-01-08 22:14:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:43,439 INFO L225 Difference]: With dead ends: 49 [2025-01-08 22:14:43,439 INFO L226 Difference]: Without dead ends: 31 [2025-01-08 22:14:43,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:14:43,440 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:43,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:14:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-08 22:14:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-01-08 22:14:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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) [2025-01-08 22:14:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-01-08 22:14:43,446 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 40 [2025-01-08 22:14:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:43,447 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-01-08 22:14:43,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:14:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-01-08 22:14:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 22:14:43,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:43,449 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:43,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:14:43,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:43,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1779343495, now seen corresponding path program 1 times [2025-01-08 22:14:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:43,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36552697] [2025-01-08 22:14:43,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:43,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:43,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-08 22:14:43,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-08 22:14:43,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-08 22:14:43,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:43,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36552697] [2025-01-08 22:14:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36552697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:14:43,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:14:43,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-08 22:14:43,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088832592] [2025-01-08 22:14:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:14:43,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:14:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:43,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:14:43,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:14:43,664 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-01-08 22:14:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:43,727 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2025-01-08 22:14:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:14:43,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 41 [2025-01-08 22:14:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:43,730 INFO L225 Difference]: With dead ends: 51 [2025-01-08 22:14:43,731 INFO L226 Difference]: Without dead ends: 47 [2025-01-08 22:14:43,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:14:43,731 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 148 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.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:43,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 148 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:14:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-08 22:14:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2025-01-08 22:14:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-08 22:14:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2025-01-08 22:14:43,745 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 41 [2025-01-08 22:14:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:43,745 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-01-08 22:14:43,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 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) [2025-01-08 22:14:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2025-01-08 22:14:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:14:43,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:43,746 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:43,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:14:43,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:43,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:43,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1079297130, now seen corresponding path program 1 times [2025-01-08 22:14:43,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:43,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144083655] [2025-01-08 22:14:43,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:43,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:43,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:14:43,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:14:43,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:43,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-08 22:14:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144083655] [2025-01-08 22:14:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144083655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616313759] [2025-01-08 22:14:43,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:43,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:43,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:43,861 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) [2025-01-08 22:14:43,862 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 [2025-01-08 22:14:43,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:14:43,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:14:43,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:43,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:43,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:14:43,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:14:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-08 22:14:43,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:14:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-08 22:14:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616313759] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:14:44,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:14:44,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-01-08 22:14:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585144434] [2025-01-08 22:14:44,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:14:44,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:14:44,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:44,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:14:44,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:14:44,065 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-08 22:14:44,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:44,148 INFO L93 Difference]: Finished difference Result 74 states and 110 transitions. [2025-01-08 22:14:44,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:14:44,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2025-01-08 22:14:44,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:44,150 INFO L225 Difference]: With dead ends: 74 [2025-01-08 22:14:44,150 INFO L226 Difference]: Without dead ends: 43 [2025-01-08 22:14:44,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:14:44,151 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:44,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 66 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:14:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-08 22:14:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-01-08 22:14:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-08 22:14:44,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-01-08 22:14:44,160 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 44 [2025-01-08 22:14:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:44,160 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-01-08 22:14:44,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-08 22:14:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2025-01-08 22:14:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-08 22:14:44,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:44,163 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:44,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:14:44,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:44,364 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:44,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:44,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1477795056, now seen corresponding path program 2 times [2025-01-08 22:14:44,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:44,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381209138] [2025-01-08 22:14:44,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:14:44,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:44,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-08 22:14:44,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:14:44,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:14:44,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:44,529 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 55 proven. 14 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:14:44,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:44,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381209138] [2025-01-08 22:14:44,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381209138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:44,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227559077] [2025-01-08 22:14:44,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:14:44,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:44,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:44,534 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) [2025-01-08 22:14:44,540 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 [2025-01-08 22:14:44,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-08 22:14:44,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:14:44,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:14:44,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:44,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:14:44,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:14:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:14:44,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:14:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 66 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:14:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227559077] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:14:44,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:14:44,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2025-01-08 22:14:44,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942017489] [2025-01-08 22:14:44,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:14:44,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 22:14:44,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:44,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 22:14:44,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:14:44,827 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-08 22:14:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:44,936 INFO L93 Difference]: Finished difference Result 114 states and 154 transitions. [2025-01-08 22:14:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-08 22:14:44,936 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2025-01-08 22:14:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:44,937 INFO L225 Difference]: With dead ends: 114 [2025-01-08 22:14:44,937 INFO L226 Difference]: Without dead ends: 61 [2025-01-08 22:14:44,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-01-08 22:14:44,938 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:44,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 129 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:14:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-08 22:14:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-01-08 22:14:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-08 22:14:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2025-01-08 22:14:44,951 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 53 [2025-01-08 22:14:44,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:44,951 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2025-01-08 22:14:44,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-08 22:14:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2025-01-08 22:14:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-08 22:14:44,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:44,952 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:44,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:14:45,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-08 22:14:45,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:45,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1766793941, now seen corresponding path program 3 times [2025-01-08 22:14:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439975479] [2025-01-08 22:14:45,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:14:45,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:45,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 6 equivalence classes. [2025-01-08 22:14:45,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 54 statements. [2025-01-08 22:14:45,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:14:45,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-08 22:14:45,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439975479] [2025-01-08 22:14:45,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439975479] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585936946] [2025-01-08 22:14:45,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:14:45,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:45,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:45,231 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) [2025-01-08 22:14:45,232 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 [2025-01-08 22:14:45,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 6 equivalence classes. [2025-01-08 22:14:45,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 54 statements. [2025-01-08 22:14:45,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:14:45,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:45,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 22:14:45,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:14:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 59 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-08 22:14:45,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:14:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-08 22:14:45,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585936946] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:14:45,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:14:45,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2025-01-08 22:14:45,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119588156] [2025-01-08 22:14:45,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:14:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:14:45,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:45,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:14:45,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:14:45,417 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-08 22:14:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:45,502 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2025-01-08 22:14:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:14:45,503 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 54 [2025-01-08 22:14:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:45,503 INFO L225 Difference]: With dead ends: 99 [2025-01-08 22:14:45,504 INFO L226 Difference]: Without dead ends: 63 [2025-01-08 22:14:45,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:14:45,504 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:45,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 98 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:14:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-08 22:14:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-08 22:14:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 states have internal predecessors, (62), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-01-08 22:14:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2025-01-08 22:14:45,516 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 54 [2025-01-08 22:14:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:45,517 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2025-01-08 22:14:45,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.076923076923077) internal successors, (53), 14 states have internal predecessors, (53), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-08 22:14:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2025-01-08 22:14:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-08 22:14:45,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:45,519 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:45,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:14:45,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:45,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:45,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1704028788, now seen corresponding path program 4 times [2025-01-08 22:14:45,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:45,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521664992] [2025-01-08 22:14:45,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:14:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:45,729 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-08 22:14:45,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 45 of 55 statements. [2025-01-08 22:14:45,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:14:45,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 32 proven. 59 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:14:45,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:45,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521664992] [2025-01-08 22:14:45,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521664992] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:45,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146282836] [2025-01-08 22:14:45,834 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:14:45,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:45,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:45,839 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) [2025-01-08 22:14:45,846 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 [2025-01-08 22:14:45,884 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-08 22:14:45,898 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 45 of 55 statements. [2025-01-08 22:14:45,899 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:14:45,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:45,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:14:45,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:14:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 51 proven. 39 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:14:45,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:14:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 39 proven. 52 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-08 22:14:46,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146282836] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:14:46,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:14:46,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 16 [2025-01-08 22:14:46,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285775946] [2025-01-08 22:14:46,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:14:46,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-08 22:14:46,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:46,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-08 22:14:46,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:14:46,097 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:14:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:46,240 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2025-01-08 22:14:46,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:14:46,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-01-08 22:14:46,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:46,241 INFO L225 Difference]: With dead ends: 108 [2025-01-08 22:14:46,241 INFO L226 Difference]: Without dead ends: 58 [2025-01-08 22:14:46,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2025-01-08 22:14:46,242 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 29 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:46,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 154 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:14:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-08 22:14:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2025-01-08 22:14:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-08 22:14:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2025-01-08 22:14:46,250 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 55 [2025-01-08 22:14:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:46,251 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2025-01-08 22:14:46,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 16 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:14:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2025-01-08 22:14:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-08 22:14:46,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:46,252 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:46,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-08 22:14:46,453 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,SelfDestructingSolverStorable8 [2025-01-08 22:14:46,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:46,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 36355374, now seen corresponding path program 1 times [2025-01-08 22:14:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:46,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472516923] [2025-01-08 22:14:46,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:46,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-08 22:14:46,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-08 22:14:46,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:46,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:14:46,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723059844] [2025-01-08 22:14:46,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:46,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:46,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:46,543 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) [2025-01-08 22:14:46,549 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 [2025-01-08 22:14:46,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-08 22:14:46,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-08 22:14:46,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:46,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:14:46,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-08 22:14:46,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-08 22:14:46,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-08 22:14:46,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:46,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-08 22:14:46,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-08 22:14:46,680 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-08 22:14:46,681 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:14:46,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-08 22:14:46,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:46,885 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:46,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:14:46,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:14:46 BoogieIcfgContainer [2025-01-08 22:14:46,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:14:46,918 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:14:46,918 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:14:46,918 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:14:46,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:14:41" (3/4) ... [2025-01-08 22:14:46,919 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-08 22:14:46,969 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 42. [2025-01-08 22:14:47,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:14:47,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:14:47,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:14:47,020 INFO L158 Benchmark]: Toolchain (without parser) took 5589.59ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 80.1MB in the end (delta: 33.0MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2025-01-08 22:14:47,020 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:14:47,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.73ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 101.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:14:47,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.21ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.5MB in the end (delta: 991.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:14:47,021 INFO L158 Benchmark]: Boogie Preprocessor took 34.92ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:14:47,021 INFO L158 Benchmark]: RCFGBuilder took 222.06ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 85.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:14:47,021 INFO L158 Benchmark]: TraceAbstraction took 5011.95ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 89.5MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:14:47,022 INFO L158 Benchmark]: Witness Printer took 102.16ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 80.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:14:47,022 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.73ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 101.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.21ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.5MB in the end (delta: 991.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.92ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 222.06ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 85.7MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5011.95ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 89.5MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 102.16ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 80.1MB in the end (delta: 9.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: 64]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L15] int N; VAL [N=0] [L43] N = __VERIFIER_nondet_int() [L44] COND TRUE N > 1 [L45] int x[N]; [L46] CALL init_nondet(x) [L17] int i; [L18] i = 0 VAL [N=3, i=0, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=1, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=2, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=3, x={3:0}] [L18] COND FALSE !(i < N) VAL [N=3] [L46] RET init_nondet(x) [L47] int temp; [L48] int ret; [L49] int ret2; [L50] int ret5; VAL [N=3, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=-2147483646, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=-2147483646, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=-2147483646, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=-2147483646, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [N=3, x={3:0}] [L52] ret = rangesum(x) [L54] EXPR x[0] [L54] temp=x[0] [L54] EXPR x[1] [L54] x[0] = x[1] [L54] x[1] = temp VAL [N=3] [L55] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=-2147483646, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=-2147483646, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=-2147483646, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=-2147483646, x={3:0}] [L55] RET, EXPR rangesum(x) VAL [N=3, ret=-2147483646, x={3:0}] [L55] ret2 = rangesum(x) [L56] EXPR x[0] [L56] temp=x[0] [L57] int i =0 ; VAL [N=3, i=0, ret2=-2147483646, ret=-2147483646, temp=1, x={3:0}] [L57] COND TRUE i N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=1, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=1, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=1, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=1, x={3:0}] [L61] RET, EXPR rangesum(x) VAL [N=3, ret2=-2147483646, ret=-2147483646, x={3:0}] [L61] ret5 = rangesum(x) [L63] COND TRUE ret != ret2 || ret !=ret5 VAL [N=3, x={3:0}] [L64] reach_error() VAL [N=3, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 10, TraceHistogramMax: 9, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 158 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 795 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 572 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 223 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 578 GetRequests, 469 SyntacticMatches, 17 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=8, InterpolantAutomatonStates: 74, 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, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 764 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 1728 SizeOfPredicates, 5 NumberOfNonLiveVariables, 998 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 1022/1266 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-08 22:14:47,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE