./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.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/heap-data/cart.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 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:38:51,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:38:51,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:38:51,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:38:51,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:38:51,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:38:51,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:38:51,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:38:51,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:38:51,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:38:51,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:38:51,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:38:51,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:38:51,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:38:51,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:51,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:51,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:38:51,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:38:51,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:38:51,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:38:51,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:38:51,344 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2025-01-09 02:38:51,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:38:51,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:38:51,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:38:51,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:38:51,613 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:38:51,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2025-01-09 02:38:52,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d495bd6de/674aaf0b0f974f08800717f304fc5df5/FLAG281eeaf9c [2025-01-09 02:38:53,165 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:38:53,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2025-01-09 02:38:53,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d495bd6de/674aaf0b0f974f08800717f304fc5df5/FLAG281eeaf9c [2025-01-09 02:38:53,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d495bd6de/674aaf0b0f974f08800717f304fc5df5 [2025-01-09 02:38:53,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:38:53,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:38:53,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:53,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:38:53,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:38:53,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425e4a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53, skipping insertion in model container [2025-01-09 02:38:53,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:38:53,434 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/heap-data/cart.i[23713,23726] [2025-01-09 02:38:53,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:53,447 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:38:53,492 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/heap-data/cart.i[23713,23726] [2025-01-09 02:38:53,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:38:53,519 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:38:53,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53 WrapperNode [2025-01-09 02:38:53,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:38:53,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:53,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:38:53,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:38:53,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,553 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2025-01-09 02:38:53,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:38:53,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:38:53,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:38:53,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:38:53,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,580 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-01-09 02:38:53,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:38:53,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:38:53,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:38:53,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:38:53,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (1/1) ... [2025-01-09 02:38:53,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:38:53,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:53,636 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-09 02:38:53,638 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-09 02:38:53,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:38:53,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:38:53,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:38:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:38:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:38:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:38:53,813 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:38:53,818 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:38:54,023 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 02:38:54,023 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:38:54,034 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:38:54,035 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:38:54,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:54 BoogieIcfgContainer [2025-01-09 02:38:54,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:38:54,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:38:54,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:38:54,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:38:54,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:38:53" (1/3) ... [2025-01-09 02:38:54,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55457687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:54, skipping insertion in model container [2025-01-09 02:38:54,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:38:53" (2/3) ... [2025-01-09 02:38:54,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55457687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:38:54, skipping insertion in model container [2025-01-09 02:38:54,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:38:54" (3/3) ... [2025-01-09 02:38:54,049 INFO L128 eAbstractionObserver]: Analyzing ICFG cart.i [2025-01-09 02:38:54,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:38:54,076 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cart.i that has 1 procedures, 20 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 02:38:54,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:38:54,169 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;@123d0ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:38:54,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:38:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 02:38:54,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:54,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:54,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 591303050, now seen corresponding path program 1 times [2025-01-09 02:38:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699045702] [2025-01-09 02:38:54,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:54,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 02:38:54,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 02:38:54,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:54,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:54,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699045702] [2025-01-09 02:38:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699045702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:54,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:54,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:38:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658481611] [2025-01-09 02:38:54,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:54,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:38:54,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:54,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:38:54,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:38:54,354 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:54,363 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2025-01-09 02:38:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:38:54,364 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 02:38:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:54,368 INFO L225 Difference]: With dead ends: 33 [2025-01-09 02:38:54,368 INFO L226 Difference]: Without dead ends: 17 [2025-01-09 02:38:54,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:38:54,373 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:54,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:38:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-01-09 02:38:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-01-09 02:38:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-01-09 02:38:54,397 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 8 [2025-01-09 02:38:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:54,397 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-01-09 02:38:54,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-01-09 02:38:54,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 02:38:54,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:54,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:54,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:38:54,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:54,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1261286604, now seen corresponding path program 1 times [2025-01-09 02:38:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946077160] [2025-01-09 02:38:54,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:54,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 02:38:54,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 02:38:54,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:54,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:54,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946077160] [2025-01-09 02:38:54,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946077160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:54,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:54,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:38:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906930106] [2025-01-09 02:38:54,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:54,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:38:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:54,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:38:54,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:38:54,564 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:54,620 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2025-01-09 02:38:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:38:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 02:38:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:54,621 INFO L225 Difference]: With dead ends: 34 [2025-01-09 02:38:54,621 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 02:38:54,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:38:54,622 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:54,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:38:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 02:38:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 02:38:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-01-09 02:38:54,627 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2025-01-09 02:38:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:54,627 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-01-09 02:38:54,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-01-09 02:38:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 02:38:54,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:54,628 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:54,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:38:54,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:54,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1750646660, now seen corresponding path program 1 times [2025-01-09 02:38:54,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:54,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623446752] [2025-01-09 02:38:54,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:54,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 02:38:54,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 02:38:54,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:54,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:54,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623446752] [2025-01-09 02:38:54,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623446752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:54,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:54,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:38:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226189910] [2025-01-09 02:38:54,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:54,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:38:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:54,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:38:54,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:38:54,715 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:54,778 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-01-09 02:38:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:38:54,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 02:38:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:54,779 INFO L225 Difference]: With dead ends: 36 [2025-01-09 02:38:54,779 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 02:38:54,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:38:54,784 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:54,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:38:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 02:38:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2025-01-09 02:38:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-01-09 02:38:54,788 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 15 [2025-01-09 02:38:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:54,788 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-01-09 02:38:54,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-01-09 02:38:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 02:38:54,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:54,788 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:54,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:38:54,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:54,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:54,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1105432294, now seen corresponding path program 1 times [2025-01-09 02:38:54,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:54,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499005807] [2025-01-09 02:38:54,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:54,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:54,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:38:54,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:38:54,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:54,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:38:54,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499005807] [2025-01-09 02:38:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499005807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:38:54,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:38:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:38:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878114653] [2025-01-09 02:38:54,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:38:54,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:38:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:54,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:38:54,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:38:54,893 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:54,908 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-01-09 02:38:54,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:38:54,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 02:38:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:54,910 INFO L225 Difference]: With dead ends: 33 [2025-01-09 02:38:54,911 INFO L226 Difference]: Without dead ends: 24 [2025-01-09 02:38:54,911 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-09 02:38:54,912 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:54,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:38:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-09 02:38:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-09 02:38:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-01-09 02:38:54,921 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2025-01-09 02:38:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:54,921 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-01-09 02:38:54,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-01-09 02:38:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 02:38:54,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:54,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:54,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:38:54,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:54,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1162690596, now seen corresponding path program 1 times [2025-01-09 02:38:54,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:54,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048508194] [2025-01-09 02:38:54,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:54,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:38:54,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:38:54,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:54,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:55,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:55,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048508194] [2025-01-09 02:38:55,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048508194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:55,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240110069] [2025-01-09 02:38:55,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:55,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:55,402 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-09 02:38:55,407 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-09 02:38:55,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:38:55,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:38:55,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:55,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:55,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 02:38:55,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:55,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2025-01-09 02:38:55,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:38:55,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-01-09 02:38:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:55,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:38:55,752 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-01-09 02:38:55,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 858 treesize of output 763 [2025-01-09 02:38:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:38:55,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240110069] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:38:55,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:38:55,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2025-01-09 02:38:55,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687166444] [2025-01-09 02:38:55,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:38:55,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 02:38:55,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:55,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 02:38:55,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:38:55,867 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:56,033 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2025-01-09 02:38:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 02:38:56,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 02:38:56,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:56,034 INFO L225 Difference]: With dead ends: 38 [2025-01-09 02:38:56,034 INFO L226 Difference]: Without dead ends: 36 [2025-01-09 02:38:56,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:38:56,035 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 65 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:56,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 110 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:38:56,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-09 02:38:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2025-01-09 02:38:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-01-09 02:38:56,038 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 19 [2025-01-09 02:38:56,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:56,038 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-01-09 02:38:56,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:56,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2025-01-09 02:38:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 02:38:56,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:56,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:56,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 02:38:56,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:56,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:56,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1191807990, now seen corresponding path program 1 times [2025-01-09 02:38:56,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:56,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54555077] [2025-01-09 02:38:56,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:56,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:56,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:38:56,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:38:56,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:56,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:38:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:56,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54555077] [2025-01-09 02:38:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54555077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:56,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383599636] [2025-01-09 02:38:56,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:38:56,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:56,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:56,385 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-09 02:38:56,388 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-09 02:38:56,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 02:38:56,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 02:38:56,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:38:56,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:56,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 02:38:56,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:56,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 02:38:56,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 02:38:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:56,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:38:56,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-01-09 02:38:56,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:38:56,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2025-01-09 02:38:56,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-01-09 02:38:56,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:38:56,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2025-01-09 02:38:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:38:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383599636] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:38:56,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:38:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 11 [2025-01-09 02:38:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800900811] [2025-01-09 02:38:56,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:38:56,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 02:38:56,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:56,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 02:38:56,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:38:56,689 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:56,781 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2025-01-09 02:38:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:38:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 02:38:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:56,782 INFO L225 Difference]: With dead ends: 42 [2025-01-09 02:38:56,782 INFO L226 Difference]: Without dead ends: 33 [2025-01-09 02:38:56,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-09 02:38:56,783 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:56,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 92 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:38:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-09 02:38:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2025-01-09 02:38:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-01-09 02:38:56,786 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 22 [2025-01-09 02:38:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:56,786 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-01-09 02:38:56,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-01-09 02:38:56,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 02:38:56,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:56,786 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:56,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:38:56,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:56,991 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:56,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1424282676, now seen corresponding path program 2 times [2025-01-09 02:38:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437315644] [2025-01-09 02:38:56,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:38:56,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:57,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 02:38:57,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:38:57,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:38:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:57,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:57,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437315644] [2025-01-09 02:38:57,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437315644] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:57,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621310817] [2025-01-09 02:38:57,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:38:57,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:57,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:57,262 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-09 02:38:57,267 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-09 02:38:57,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 02:38:57,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:38:57,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:38:57,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:57,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 02:38:57,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:57,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:38:57,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:38:57,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-01-09 02:38:57,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 02:38:57,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 02:38:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:57,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:38:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:57,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621310817] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:38:57,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:38:57,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-01-09 02:38:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368656013] [2025-01-09 02:38:57,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:38:57,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:38:57,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:57,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:38:57,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:38:57,554 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:57,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:57,650 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-01-09 02:38:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:38:57,651 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 02:38:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:57,651 INFO L225 Difference]: With dead ends: 51 [2025-01-09 02:38:57,651 INFO L226 Difference]: Without dead ends: 34 [2025-01-09 02:38:57,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:38:57,652 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:57,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 123 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:38:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-09 02:38:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-09 02:38:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2025-01-09 02:38:57,655 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2025-01-09 02:38:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:57,656 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2025-01-09 02:38:57,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2025-01-09 02:38:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 02:38:57,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:57,657 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:57,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 02:38:57,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:57,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:57,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash -920843388, now seen corresponding path program 3 times [2025-01-09 02:38:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494901879] [2025-01-09 02:38:57,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:38:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:57,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-09 02:38:57,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:38:57,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 02:38:57,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:38:58,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494901879] [2025-01-09 02:38:58,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494901879] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:38:58,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544693792] [2025-01-09 02:38:58,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:38:58,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:38:58,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:38:58,293 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-09 02:38:58,294 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-09 02:38:58,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-01-09 02:38:58,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 02:38:58,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 02:38:58,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:38:58,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 02:38:58,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:38:58,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:38:58,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:38:58,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2025-01-09 02:38:58,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-01-09 02:38:58,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2025-01-09 02:38:58,642 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:38:58,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-01-09 02:38:58,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-01-09 02:38:58,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:38:58,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2025-01-09 02:38:58,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:38:58,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-01-09 02:38:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:38:58,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:38:58,740 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1.base| Int)) (or (not (= (select (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) 0)) (let ((.cse0 (select (store |c_#memory_int#2| |ULTIMATE.start_main_~i~0#1.base| v_ArrVal_384) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1))))) is different from false [2025-01-09 02:38:58,777 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_~i~0#1.base_35| Int) (v_ArrVal_373 Int) (v_ArrVal_384 (Array Int Int)) (v_ArrVal_380 Int)) (let ((.cse2 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (or (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse0 v_ArrVal_373) .cse1 v_ArrVal_375)) |v_ULTIMATE.start_main_~i~0#1.base_35|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|)) 0)) (< v_ArrVal_380 (select .cse2 .cse1)) (let ((.cse3 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse2 .cse0 |c_ULTIMATE.start_main_~order~0#1|) .cse1 v_ArrVal_380)) |v_ULTIMATE.start_main_~i~0#1.base_35| v_ArrVal_384) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (+ (select .cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) 1)))))) |c_ULTIMATE.start_main_#t~short8#1|) is different from false [2025-01-09 02:38:58,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:38:58,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 50 [2025-01-09 02:38:58,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:38:58,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 79 [2025-01-09 02:38:58,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:38:58,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-01-09 02:38:58,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 902 treesize of output 886 [2025-01-09 02:38:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-01-09 02:38:59,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544693792] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:38:59,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:38:59,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-01-09 02:38:59,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556409508] [2025-01-09 02:38:59,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:38:59,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 02:38:59,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:38:59,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 02:38:59,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=324, Unknown=2, NotChecked=74, Total=462 [2025-01-09 02:38:59,003 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:38:59,374 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2025-01-09 02:38:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 02:38:59,374 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 02:38:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:38:59,375 INFO L225 Difference]: With dead ends: 53 [2025-01-09 02:38:59,375 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 02:38:59,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=606, Unknown=2, NotChecked=106, Total=870 [2025-01-09 02:38:59,375 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 118 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:38:59,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 350 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2025-01-09 02:38:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 02:38:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2025-01-09 02:38:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-01-09 02:38:59,379 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 28 [2025-01-09 02:38:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:38:59,379 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-01-09 02:38:59,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:38:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2025-01-09 02:38:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 02:38:59,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:38:59,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:38:59,386 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-09 02:38:59,584 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,SelfDestructingSolverStorable7 [2025-01-09 02:38:59,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:38:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:38:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash -885363542, now seen corresponding path program 2 times [2025-01-09 02:38:59,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:38:59,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506583258] [2025-01-09 02:38:59,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:38:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:38:59,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 02:38:59,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 02:38:59,611 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:38:59,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:39:00,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:39:00,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506583258] [2025-01-09 02:39:00,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506583258] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:39:00,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054662316] [2025-01-09 02:39:00,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:39:00,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:00,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:00,129 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-09 02:39:00,130 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-09 02:39:00,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 02:39:00,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 02:39:00,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:39:00,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:00,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 02:39:00,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:00,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:39:00,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:39:00,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:39:00,252 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 02:39:00,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 02:39:00,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2025-01-09 02:39:00,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-01-09 02:39:00,440 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 02:39:00,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 107 [2025-01-09 02:39:00,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 02:39:00,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 23 [2025-01-09 02:39:00,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2025-01-09 02:39:00,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:39:00,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:00,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-01-09 02:39:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:39:00,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:39:00,658 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2025-01-09 02:39:00,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 957 treesize of output 812 [2025-01-09 02:39:00,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:39:00,721 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_510 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|) (< (select v_ArrVal_510 |c_ULTIMATE.start_main_~i~0#1.offset|) 0))) (forall ((v_ArrVal_513 (Array Int Int))) (= |c_ULTIMATE.start_main_~i~0#1.base| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) is different from false [2025-01-09 02:39:00,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (and (forall ((v_ArrVal_507 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (let ((.cse0 (select v_ArrVal_507 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< (select v_ArrVal_510 .cse0) 0) (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_507) (select .cse1 |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_510) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse0) (not (= v_ArrVal_507 (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 (select v_ArrVal_507 .cse2)) .cse3 (select v_ArrVal_507 .cse3))))))) (forall ((v_ArrVal_509 (Array Int Int))) (or (not (= (store (store .cse1 .cse2 (select v_ArrVal_509 .cse2)) .cse3 (select v_ArrVal_509 .cse3)) v_ArrVal_509)) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse4 (select v_ArrVal_509 |c_ULTIMATE.start_main_~i~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_509) .cse4 v_ArrVal_513) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse4))))))) is different from false [2025-01-09 02:39:00,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (forall ((v_ArrVal_509 (Array Int Int))) (or (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse0 (select v_ArrVal_509 |c_ULTIMATE.start_main_~l~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_509) .cse0 v_ArrVal_513) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (not (= v_ArrVal_509 (store (store .cse1 .cse2 (select v_ArrVal_509 .cse2)) .cse3 (select v_ArrVal_509 .cse3)))))) (forall ((v_ArrVal_507 (Array Int Int)) (v_ArrVal_510 (Array Int Int))) (let ((.cse4 (select v_ArrVal_507 |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base| v_ArrVal_507) (select .cse1 |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_510) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse4) (not (= v_ArrVal_507 (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~l~0#1.base|) .cse2 (select v_ArrVal_507 .cse2)) .cse3 (select v_ArrVal_507 .cse3)))) (< (select v_ArrVal_510 .cse4) 0)))))) is different from false [2025-01-09 02:39:00,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 78 [2025-01-09 02:39:00,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:00,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 84 [2025-01-09 02:39:00,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:00,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 66 [2025-01-09 02:39:00,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2025-01-09 02:39:00,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:00,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 59 [2025-01-09 02:39:00,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-01-09 02:39:01,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2025-01-09 02:39:01,020 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-01-09 02:39:01,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:39:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2025-01-09 02:39:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054662316] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:39:01,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:39:01,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-01-09 02:39:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397000148] [2025-01-09 02:39:01,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:39:01,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 02:39:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:39:01,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 02:39:01,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=396, Unknown=3, NotChecked=126, Total=600 [2025-01-09 02:39:01,047 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 25 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:39:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:39:01,546 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2025-01-09 02:39:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 02:39:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-01-09 02:39:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:39:01,547 INFO L225 Difference]: With dead ends: 51 [2025-01-09 02:39:01,547 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 02:39:01,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=781, Unknown=3, NotChecked=180, Total=1122 [2025-01-09 02:39:01,548 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 62 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:39:01,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 345 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 265 Invalid, 0 Unknown, 146 Unchecked, 0.3s Time] [2025-01-09 02:39:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 02:39:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-01-09 02:39:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:39:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-01-09 02:39:01,551 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 31 [2025-01-09 02:39:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:39:01,551 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-01-09 02:39:01,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 25 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:39:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-01-09 02:39:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 02:39:01,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:39:01,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:39:01,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 02:39:01,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:01,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:39:01,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:39:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash -514439380, now seen corresponding path program 4 times [2025-01-09 02:39:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:39:01,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014936860] [2025-01-09 02:39:01,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:39:01,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:39:01,767 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-01-09 02:39:01,807 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:39:01,807 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:39:01,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:39:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:39:02,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014936860] [2025-01-09 02:39:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014936860] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:39:02,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817719296] [2025-01-09 02:39:02,706 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:39:02,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:39:02,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:39:02,712 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-09 02:39:02,713 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-09 02:39:02,780 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-01-09 02:39:02,921 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 02:39:02,921 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:39:02,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:39:02,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-01-09 02:39:02,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:39:02,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:39:02,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:39:03,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-01-09 02:39:03,048 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2025-01-09 02:39:03,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 31 [2025-01-09 02:39:03,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 02:39:03,081 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 02:39:03,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-01-09 02:39:03,254 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:39:03,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 32 [2025-01-09 02:39:03,268 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 02:39:03,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 25 [2025-01-09 02:39:03,484 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-01-09 02:39:03,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 61 [2025-01-09 02:39:03,500 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 02:39:03,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 70 [2025-01-09 02:39:03,547 INFO L349 Elim1Store]: treesize reduction 20, result has 67.2 percent of original size [2025-01-09 02:39:03,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 88 [2025-01-09 02:39:03,886 INFO L349 Elim1Store]: treesize reduction 74, result has 8.6 percent of original size [2025-01-09 02:39:03,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 68 [2025-01-09 02:39:03,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 02:39:03,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 02:39:03,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 02:39:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:39:03,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:39:03,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 02:39:10,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:10,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2025-01-09 02:39:10,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:10,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2025-01-09 02:39:10,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:10,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2025-01-09 02:39:10,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:10,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2025-01-09 02:39:10,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:10,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2025-01-09 02:39:10,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:10,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2025-01-09 02:39:10,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:10,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2025-01-09 02:39:10,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:10,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 6 [2025-01-09 02:39:10,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse4 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~l~0#1.offset| 0) (and (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_23| Int) (v_ArrVal_676 (Array Int Int))) (let ((.cse1 (select v_ArrVal_669 0))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~l~0#1.base_23| v_ArrVal_669)) (.cse0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~l~0#1.base_23| v_arrayElimArr_5) .cse1) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (= .cse0 0) (not (= (select v_arrayElimArr_5 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= .cse1 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_676 (store (store (select .cse2 .cse1) .cse3 (select v_ArrVal_676 .cse3)) .cse4 (select v_ArrVal_676 .cse4)))) (not (= (select (select (store .cse2 .cse1 v_ArrVal_676) (select v_ArrVal_676 |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse0) 0)))))) (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_23| Int) (v_prenex_3 (Array Int Int))) (let ((.cse5 (select v_prenex_3 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~l~0#1.base_23| v_ArrVal_669)) (.cse6 (select v_ArrVal_669 0))) (or (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (= .cse5 0) (not (= .cse6 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select (select (store .cse7 .cse6 v_prenex_3) .cse5) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~l~0#1.base_23| v_arrayElimArr_6) .cse6) |c_ULTIMATE.start_main_~l~0#1.offset|)) 0)) (not (= (store (store (select .cse7 .cse6) .cse3 (select v_prenex_3 .cse3)) .cse4 (select v_prenex_3 .cse4)) v_prenex_3))))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_23| Int) (v_prenex_3 (Array Int Int))) (let ((.cse8 (select v_prenex_3 |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse10 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~l~0#1.base_23| v_ArrVal_669)) (.cse9 (select v_ArrVal_669 0))) (or (= .cse8 0) (= .cse9 0) (not (= .cse9 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= (select v_arrayElimArr_7 0) |c_ULTIMATE.start_main_~l~0#1.offset|)) (not (= (select (select (store .cse10 .cse9 v_prenex_3) .cse8) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~l~0#1.base_23| v_arrayElimArr_7) .cse9) |c_ULTIMATE.start_main_~l~0#1.offset|)) 0)) (not (= (store (store (select .cse10 .cse9) .cse3 (select v_prenex_3 .cse3)) .cse4 (select v_prenex_3 .cse4)) v_prenex_3))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~l~0#1.base_23| Int) (v_ArrVal_676 (Array Int Int))) (let ((.cse13 (select v_ArrVal_669 0))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~l~0#1.base_23| v_arrayElimArr_8) .cse13) |c_ULTIMATE.start_main_~l~0#1.offset|)) (.cse12 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~l~0#1.base_23| v_ArrVal_669))) (or (= .cse11 0) (not (= (select (select (store .cse12 .cse13 v_ArrVal_676) (select v_ArrVal_676 |c_ULTIMATE.start_main_~l~0#1.offset|)) .cse11) 0)) (= .cse13 0) (not (= |c_ULTIMATE.start_main_~l~0#1.offset| (select v_arrayElimArr_8 0))) (not (= .cse13 |c_ULTIMATE.start_main_~l~0#1.base|)) (not (= v_ArrVal_676 (store (store (select .cse12 .cse13) .cse3 (select v_ArrVal_676 .cse3)) .cse4 (select v_ArrVal_676 .cse4)))))))))) is different from false [2025-01-09 02:39:11,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:11,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 50 [2025-01-09 02:39:11,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:11,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 272 treesize of output 259 [2025-01-09 02:39:11,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 192 [2025-01-09 02:39:11,588 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 02:39:11,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:11,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 103 [2025-01-09 02:39:11,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 93 [2025-01-09 02:39:11,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 02:39:11,684 INFO L349 Elim1Store]: treesize reduction 98, result has 30.0 percent of original size [2025-01-09 02:39:11,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 368 treesize of output 343 [2025-01-09 02:39:11,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:11,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 121 [2025-01-09 02:39:11,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 171 [2025-01-09 02:39:11,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2025-01-09 02:39:11,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:39:11,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 81 [2025-01-09 02:39:11,749 INFO L349 Elim1Store]: treesize reduction 17, result has 26.1 percent of original size [2025-01-09 02:39:11,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 33 [2025-01-09 02:39:11,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 02:39:11,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2025-01-09 02:39:11,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:39:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 3 times theorem prover too weak. 0 trivial. 8 not checked. [2025-01-09 02:39:11,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817719296] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:39:11,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:39:11,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2025-01-09 02:39:11,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407753690] [2025-01-09 02:39:11,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:39:11,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 02:39:11,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:39:11,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 02:39:11,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=4, NotChecked=54, Total=870 [2025-01-09 02:39:11,819 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:39:21,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:39:25,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:39:26,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:39:28,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:39:45,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:39:49,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:39:54,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:39:58,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:02,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:06,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:08,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:10,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:16,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:20,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:24,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:29,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:30,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:34,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-01-09 02:40:35,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]