./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bAnd5.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/array-crafted/bAnd5.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 d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:22:29,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:22:29,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:22:29,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:22:29,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:22:29,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:22:29,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:22:29,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:22:29,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:22:29,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:22:29,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:22:29,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:22:29,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:22:29,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:22:29,215 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:22:29,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:22:29,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:22:29,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:22:29,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:22:29,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:22:29,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:22:29,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:22:29,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:22:29,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:22:29,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:22:29,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:22:29,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:22:29,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:22:29,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:22:29,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:22:29,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:22:29,219 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:22:29,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:22:29,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:22:29,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:22:29,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:22:29,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:22:29,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:22:29,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:22:29,220 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 -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2025-01-08 22:22:29,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:22:29,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:22:29,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:22:29,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:22:29,517 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:22:29,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2025-01-08 22:22:30,831 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f54ea397/79c87e5a61b54dafa912be7b535bd512/FLAG841284e74 [2025-01-08 22:22:31,080 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:22:31,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2025-01-08 22:22:31,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f54ea397/79c87e5a61b54dafa912be7b535bd512/FLAG841284e74 [2025-01-08 22:22:31,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7f54ea397/79c87e5a61b54dafa912be7b535bd512 [2025-01-08 22:22:31,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:22:31,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:22:31,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:22:31,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:22:31,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:22:31,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171e3fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31, skipping insertion in model container [2025-01-08 22:22:31,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:22:31,272 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/array-crafted/bAnd5.i[1369,1382] [2025-01-08 22:22:31,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:22:31,287 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:22:31,312 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/array-crafted/bAnd5.i[1369,1382] [2025-01-08 22:22:31,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:22:31,329 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:22:31,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31 WrapperNode [2025-01-08 22:22:31,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:22:31,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:22:31,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:22:31,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:22:31,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,368 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2025-01-08 22:22:31,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:22:31,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:22:31,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:22:31,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:22:31,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,397 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-01-08 22:22:31,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,414 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:22:31,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:22:31,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:22:31,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:22:31,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (1/1) ... [2025-01-08 22:22:31,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:22:31,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:22:31,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:22:31,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:22:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:22:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:22:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:22:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:22:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:22:31,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:22:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:22:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:22:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2025-01-08 22:22:31,481 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2025-01-08 22:22:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:22:31,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:22:31,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:22:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:22:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:22:31,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:22:31,550 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:22:31,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:22:31,716 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-08 22:22:31,716 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:22:31,729 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:22:31,730 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:22:31,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:22:31 BoogieIcfgContainer [2025-01-08 22:22:31,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:22:31,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:22:31,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:22:31,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:22:31,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:22:31" (1/3) ... [2025-01-08 22:22:31,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23748cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:22:31, skipping insertion in model container [2025-01-08 22:22:31,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:22:31" (2/3) ... [2025-01-08 22:22:31,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23748cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:22:31, skipping insertion in model container [2025-01-08 22:22:31,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:22:31" (3/3) ... [2025-01-08 22:22:31,741 INFO L128 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2025-01-08 22:22:31,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:22:31,756 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bAnd5.i that has 2 procedures, 27 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-08 22:22:31,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:22:31,813 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;@79604eff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:22:31,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:22:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:22:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:22:31,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:22:31,826 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:22:31,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:22:31,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:22:31,831 INFO L85 PathProgramCache]: Analyzing trace with hash -925213730, now seen corresponding path program 1 times [2025-01-08 22:22:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:22:31,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216378201] [2025-01-08 22:22:31,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:22:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:22:31,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:22:31,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:22:31,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:22:31,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:22:32,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:22:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216378201] [2025-01-08 22:22:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216378201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:22:32,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:22:32,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:22:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937800573] [2025-01-08 22:22:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:22:32,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:22:32,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:22:32,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:22:32,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:22:32,172 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:22:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:22:32,226 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-01-08 22:22:32,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:22:32,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-01-08 22:22:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:22:32,236 INFO L225 Difference]: With dead ends: 51 [2025-01-08 22:22:32,236 INFO L226 Difference]: Without dead ends: 23 [2025-01-08 22:22:32,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:22:32,244 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:22:32,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:22:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-08 22:22:32,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-08 22:22:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:22:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-01-08 22:22:32,275 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 25 [2025-01-08 22:22:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:22:32,275 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-01-08 22:22:32,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:22:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-01-08 22:22:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-08 22:22:32,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:22:32,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:22:32,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:22:32,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:22:32,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:22:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1280415406, now seen corresponding path program 1 times [2025-01-08 22:22:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:22:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790752378] [2025-01-08 22:22:32,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:22:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:22:32,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:22:32,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:22:32,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:22:32,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:22:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:22:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790752378] [2025-01-08 22:22:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790752378] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:22:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358929413] [2025-01-08 22:22:32,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:22:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:22:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:22:32,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:22:32,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:22:32,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-08 22:22:32,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-08 22:22:32,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:22:32,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:32,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:22:32,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:22:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:22:32,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:22:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:22:32,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358929413] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:22:32,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:22:32,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-01-08 22:22:32,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773439137] [2025-01-08 22:22:32,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:22:32,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:22:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:22:32,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:22:32,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:22:32,668 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:22:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:22:32,745 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2025-01-08 22:22:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:22:32,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 26 [2025-01-08 22:22:32,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:22:32,746 INFO L225 Difference]: With dead ends: 47 [2025-01-08 22:22:32,746 INFO L226 Difference]: Without dead ends: 29 [2025-01-08 22:22:32,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:22:32,747 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:22:32,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 65 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:22:32,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-08 22:22:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2025-01-08 22:22:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:22:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-01-08 22:22:32,756 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 26 [2025-01-08 22:22:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:22:32,756 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-01-08 22:22:32,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:22:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-01-08 22:22:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 22:22:32,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:22:32,757 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:22:32,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:22:32,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:22:32,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:22:32,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:22:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash 48618972, now seen corresponding path program 1 times [2025-01-08 22:22:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:22:32,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960886300] [2025-01-08 22:22:32,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:22:32,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:22:32,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-08 22:22:32,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:22:32,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:22:32,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-08 22:22:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:22:33,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960886300] [2025-01-08 22:22:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960886300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:22:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:22:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:22:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851031649] [2025-01-08 22:22:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:22:33,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:22:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:22:33,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:22:33,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:22:33,143 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:22:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:22:33,187 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-01-08 22:22:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:22:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2025-01-08 22:22:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:22:33,189 INFO L225 Difference]: With dead ends: 40 [2025-01-08 22:22:33,190 INFO L226 Difference]: Without dead ends: 26 [2025-01-08 22:22:33,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:22:33,191 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:22:33,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:22:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-08 22:22:33,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-08 22:22:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:22:33,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-01-08 22:22:33,200 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 36 [2025-01-08 22:22:33,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:22:33,201 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-01-08 22:22:33,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:22:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-01-08 22:22:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-08 22:22:33,203 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:22:33,203 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:22:33,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:22:33,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:22:33,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:22:33,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1892879730, now seen corresponding path program 1 times [2025-01-08 22:22:33,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:22:33,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352608406] [2025-01-08 22:22:33,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:22:33,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:22:33,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-08 22:22:33,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:22:33,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:22:33,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:22:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:22:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352608406] [2025-01-08 22:22:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352608406] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:22:33,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793622658] [2025-01-08 22:22:33,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:22:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:22:33,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:22:33,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:22:33,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:22:33,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-08 22:22:34,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-08 22:22:34,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:22:34,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:34,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-08 22:22:34,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:22:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:22:34,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:22:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:22:34,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793622658] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:22:34,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:22:34,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 17 [2025-01-08 22:22:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470395239] [2025-01-08 22:22:34,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:22:34,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 22:22:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:22:34,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 22:22:34,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:22:34,501 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-08 22:22:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:22:34,619 INFO L93 Difference]: Finished difference Result 66 states and 94 transitions. [2025-01-08 22:22:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:22:34,619 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2025-01-08 22:22:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:22:34,621 INFO L225 Difference]: With dead ends: 66 [2025-01-08 22:22:34,621 INFO L226 Difference]: Without dead ends: 45 [2025-01-08 22:22:34,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-01-08 22:22:34,623 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:22:34,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:22:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-08 22:22:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2025-01-08 22:22:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-08 22:22:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-01-08 22:22:34,641 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 37 [2025-01-08 22:22:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:22:34,641 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-01-08 22:22:34,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-08 22:22:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-01-08 22:22:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 22:22:34,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:22:34,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:22:34,652 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-08 22:22:34,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:22:34,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:22:34,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:22:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash 160745858, now seen corresponding path program 1 times [2025-01-08 22:22:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:22:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449373084] [2025-01-08 22:22:34,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:22:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:22:34,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-08 22:22:34,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 22:22:34,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:22:34,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:22:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:22:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449373084] [2025-01-08 22:22:36,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449373084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:22:36,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765982162] [2025-01-08 22:22:36,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:22:36,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:22:36,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:22:36,417 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:22:36,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:22:36,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-08 22:22:36,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 22:22:36,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:22:36,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:36,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-01-08 22:22:36,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:22:36,557 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-08 22:22:36,596 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-08 22:22:36,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:22:36,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 22 [2025-01-08 22:22:37,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:22:37,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 38 treesize of output 25 [2025-01-08 22:22:37,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:22:37,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2025-01-08 22:22:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:22:37,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:22:38,988 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 256 treesize of output 236 [2025-01-08 22:22:39,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:22:39,002 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 392 treesize of output 378 [2025-01-08 22:22:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:22:39,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765982162] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:22:39,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:22:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 18] total 57 [2025-01-08 22:22:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793799449] [2025-01-08 22:22:39,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:22:39,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-01-08 22:22:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:22:39,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-01-08 22:22:39,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2876, Unknown=0, NotChecked=0, Total=3192 [2025-01-08 22:22:39,142 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 57 states, 51 states have (on average 1.607843137254902) internal successors, (82), 52 states have internal predecessors, (82), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-08 22:22:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:22:41,699 INFO L93 Difference]: Finished difference Result 204 states and 302 transitions. [2025-01-08 22:22:41,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-08 22:22:41,699 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 51 states have (on average 1.607843137254902) internal successors, (82), 52 states have internal predecessors, (82), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) Word has length 38 [2025-01-08 22:22:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:22:41,702 INFO L225 Difference]: With dead ends: 204 [2025-01-08 22:22:41,702 INFO L226 Difference]: Without dead ends: 172 [2025-01-08 22:22:41,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=889, Invalid=7301, Unknown=0, NotChecked=0, Total=8190 [2025-01-08 22:22:41,708 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 336 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:22:41,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 405 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 22:22:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-08 22:22:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 132. [2025-01-08 22:22:41,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 112 states have internal predecessors, (137), 16 states have call successors, (16), 4 states have call predecessors, (16), 11 states have return successors, (55), 15 states have call predecessors, (55), 16 states have call successors, (55) [2025-01-08 22:22:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 208 transitions. [2025-01-08 22:22:41,760 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 208 transitions. Word has length 38 [2025-01-08 22:22:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:22:41,760 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 208 transitions. [2025-01-08 22:22:41,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 51 states have (on average 1.607843137254902) internal successors, (82), 52 states have internal predecessors, (82), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-08 22:22:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 208 transitions. [2025-01-08 22:22:41,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 22:22:41,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:22:41,768 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:22:41,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:22:41,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:22:41,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:22:41,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:22:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash 85507074, now seen corresponding path program 2 times [2025-01-08 22:22:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:22:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848771426] [2025-01-08 22:22:41,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:22:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:22:41,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:22:42,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 22:22:42,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:22:42,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:22:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:22:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848771426] [2025-01-08 22:22:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848771426] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:22:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689722927] [2025-01-08 22:22:42,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:22:42,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:22:42,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:22:42,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:22:42,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:22:42,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:22:42,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-08 22:22:42,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:22:42,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:22:42,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-08 22:22:42,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:22:42,569 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-08 22:22:42,587 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-08 22:22:42,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:22:42,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2025-01-08 22:22:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:22:42,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:22:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:22:43,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689722927] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:22:43,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:22:43,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 10] total 30 [2025-01-08 22:22:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223197487] [2025-01-08 22:22:43,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:22:43,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-08 22:22:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:22:43,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-08 22:22:43,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2025-01-08 22:22:43,212 INFO L87 Difference]: Start difference. First operand 132 states and 208 transitions. Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 29 states have internal predecessors, (69), 6 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-08 22:22:47,236 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] [2025-01-08 22:22:51,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:22:55,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:22:59,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:03,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:05,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:09,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:13,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:15,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:23:15,173 INFO L93 Difference]: Finished difference Result 292 states and 422 transitions. [2025-01-08 22:23:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-08 22:23:15,175 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 29 states have internal predecessors, (69), 6 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2025-01-08 22:23:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:23:15,177 INFO L225 Difference]: With dead ends: 292 [2025-01-08 22:23:15,177 INFO L226 Difference]: Without dead ends: 187 [2025-01-08 22:23:15,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1533, Unknown=0, NotChecked=0, Total=1806 [2025-01-08 22:23:15,178 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 74 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 24 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:23:15,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 377 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 777 Invalid, 9 Unknown, 0 Unchecked, 31.6s Time] [2025-01-08 22:23:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-08 22:23:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 163. [2025-01-08 22:23:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 131 states have (on average 1.297709923664122) internal successors, (170), 139 states have internal predecessors, (170), 17 states have call successors, (17), 7 states have call predecessors, (17), 14 states have return successors, (50), 16 states have call predecessors, (50), 17 states have call successors, (50) [2025-01-08 22:23:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 237 transitions. [2025-01-08 22:23:15,208 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 237 transitions. Word has length 38 [2025-01-08 22:23:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:23:15,208 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 237 transitions. [2025-01-08 22:23:15,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 29 states have internal predecessors, (69), 6 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-08 22:23:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 237 transitions. [2025-01-08 22:23:15,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-08 22:23:15,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:23:15,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:23:15,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:23:15,415 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,SelfDestructingSolverStorable5 [2025-01-08 22:23:15,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:23:15,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:23:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1273909550, now seen corresponding path program 3 times [2025-01-08 22:23:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:23:15,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429909573] [2025-01-08 22:23:15,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:23:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:23:15,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-01-08 22:23:15,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-01-08 22:23:15,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:23:15,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:23:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:23:16,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:23:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429909573] [2025-01-08 22:23:16,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429909573] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:23:16,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396050115] [2025-01-08 22:23:16,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:23:16,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:23:16,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:23:16,556 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:23:16,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:23:16,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-01-08 22:23:16,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 39 of 39 statements. [2025-01-08 22:23:16,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-08 22:23:16,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:23:16,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-01-08 22:23:16,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:23:16,671 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-08 22:23:16,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:23:16,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2025-01-08 22:23:17,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:23:17,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 25 [2025-01-08 22:23:17,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:23:17,324 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-08 22:23:17,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 33 [2025-01-08 22:23:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:23:17,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:23:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:23:18,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396050115] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:23:18,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:23:18,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 15] total 56 [2025-01-08 22:23:18,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336778537] [2025-01-08 22:23:18,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:23:18,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-08 22:23:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:23:18,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-08 22:23:18,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2781, Unknown=0, NotChecked=0, Total=3080 [2025-01-08 22:23:18,470 INFO L87 Difference]: Start difference. First operand 163 states and 237 transitions. Second operand has 56 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 51 states have internal predecessors, (86), 7 states have call successors, (9), 4 states have call predecessors, (9), 9 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-08 22:23:22,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:26,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:31,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:32,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:35,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:40,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:44,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:48,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:52,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:23:56,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:24:01,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:24:02,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]