./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/alternating_list-1.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/list-properties/alternating_list-1.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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:45:38,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:45:38,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:45:38,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:45:38,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:45:38,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:45:38,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:45:38,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:45:38,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:45:38,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:45:38,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:45:38,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:45:38,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:45:38,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:45:38,408 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:45:38,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:45:38,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:45:38,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:45:38,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:45:38,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:45:38,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:45:38,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:45:38,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:45:38,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:45:38,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:45:38,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:45:38,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:45:38,412 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2025-01-09 02:45:38,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:45:38,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:45:38,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:45:38,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:45:38,661 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:45:38,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/alternating_list-1.i [2025-01-09 02:45:39,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e90f8b204/5ac6774f0e054496a5c0f57d91f3e889/FLAG2dbc4edd9 [2025-01-09 02:45:40,109 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:45:40,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-properties/alternating_list-1.i [2025-01-09 02:45:40,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e90f8b204/5ac6774f0e054496a5c0f57d91f3e889/FLAG2dbc4edd9 [2025-01-09 02:45:40,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e90f8b204/5ac6774f0e054496a5c0f57d91f3e889 [2025-01-09 02:45:40,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:45:40,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:45:40,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:45:40,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:45:40,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:45:40,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e025fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40, skipping insertion in model container [2025-01-09 02:45:40,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:45:40,654 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/list-properties/alternating_list-1.i[23574,23587] [2025-01-09 02:45:40,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:45:40,667 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:45:40,704 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/list-properties/alternating_list-1.i[23574,23587] [2025-01-09 02:45:40,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:45:40,731 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:45:40,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40 WrapperNode [2025-01-09 02:45:40,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:45:40,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:45:40,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:45:40,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:45:40,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,761 INFO L138 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2025-01-09 02:45:40,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:45:40,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:45:40,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:45:40,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:45:40,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,771 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,781 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-09 02:45:40,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:45:40,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:45:40,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:45:40,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:45:40,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (1/1) ... [2025-01-09 02:45:40,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:45:40,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:40,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:45:40,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:45:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-01-09 02:45:40,838 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-01-09 02:45:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:45:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:45:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:45:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:45:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:45:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:45:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:45:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:45:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:45:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:45:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:45:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:45:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:45:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:45:40,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:45:40,909 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:45:40,911 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:45:40,926 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-01-09 02:45:41,028 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 02:45:41,028 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:45:41,034 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:45:41,034 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 02:45:41,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:41 BoogieIcfgContainer [2025-01-09 02:45:41,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:45:41,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:45:41,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:45:41,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:45:41,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:45:40" (1/3) ... [2025-01-09 02:45:41,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27176612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:41, skipping insertion in model container [2025-01-09 02:45:41,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:40" (2/3) ... [2025-01-09 02:45:41,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27176612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:41, skipping insertion in model container [2025-01-09 02:45:41,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:41" (3/3) ... [2025-01-09 02:45:41,041 INFO L128 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2025-01-09 02:45:41,052 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:45:41,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG alternating_list-1.i that has 2 procedures, 32 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 02:45:41,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:45:41,104 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;@3d944cb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:45:41,104 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:45:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:45:41,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:41,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:41,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:45:41,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash 929956591, now seen corresponding path program 1 times [2025-01-09 02:45:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908342047] [2025-01-09 02:45:41,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:41,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:45:41,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:45:41,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:41,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:41,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:41,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908342047] [2025-01-09 02:45:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908342047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:45:41,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:45:41,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:45:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893672470] [2025-01-09 02:45:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:45:41,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:45:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:41,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:45:41,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:45:41,268 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 29 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:41,280 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2025-01-09 02:45:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:45:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 02:45:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:41,287 INFO L225 Difference]: With dead ends: 48 [2025-01-09 02:45:41,287 INFO L226 Difference]: Without dead ends: 19 [2025-01-09 02:45:41,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:45:41,293 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:41,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:45:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-09 02:45:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-01-09 02:45:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-01-09 02:45:41,316 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2025-01-09 02:45:41,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:41,317 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-09 02:45:41,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-01-09 02:45:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 02:45:41,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:41,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:41,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:45:41,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:45:41,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 941036052, now seen corresponding path program 1 times [2025-01-09 02:45:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:41,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262023700] [2025-01-09 02:45:41,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:41,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:41,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 02:45:41,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:45:41,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:41,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:41,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262023700] [2025-01-09 02:45:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262023700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:45:41,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:45:41,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:45:41,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875862172] [2025-01-09 02:45:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:45:41,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:45:41,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:41,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:45:41,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:45:41,445 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:41,461 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-01-09 02:45:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:45:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 02:45:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:41,462 INFO L225 Difference]: With dead ends: 47 [2025-01-09 02:45:41,462 INFO L226 Difference]: Without dead ends: 32 [2025-01-09 02:45:41,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:45:41,463 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:41,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:45:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-01-09 02:45:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-01-09 02:45:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-01-09 02:45:41,470 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 12 [2025-01-09 02:45:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:41,470 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-01-09 02:45:41,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-01-09 02:45:41,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 02:45:41,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:41,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:41,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:45:41,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:45:41,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash 941029108, now seen corresponding path program 1 times [2025-01-09 02:45:41,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:41,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67353379] [2025-01-09 02:45:41,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:41,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 02:45:41,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:45:41,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:41,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:41,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:41,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67353379] [2025-01-09 02:45:41,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67353379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:45:41,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:45:41,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:45:41,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758939051] [2025-01-09 02:45:41,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:45:41,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:45:41,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:41,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:45:41,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:45:41,654 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:41,715 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-01-09 02:45:41,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:45:41,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 02:45:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:41,716 INFO L225 Difference]: With dead ends: 57 [2025-01-09 02:45:41,716 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 02:45:41,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:45:41,717 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:41,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:45:41,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 02:45:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2025-01-09 02:45:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-01-09 02:45:41,721 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 12 [2025-01-09 02:45:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:41,721 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-01-09 02:45:41,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-01-09 02:45:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 02:45:41,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:41,721 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:41,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:45:41,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:45:41,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1361115555, now seen corresponding path program 1 times [2025-01-09 02:45:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154149770] [2025-01-09 02:45:41,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:41,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:41,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 02:45:41,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 02:45:41,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:41,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:42,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:42,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154149770] [2025-01-09 02:45:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154149770] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:42,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983024806] [2025-01-09 02:45:42,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:42,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:42,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:42,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:45:42,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:45:42,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 02:45:42,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 02:45:42,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:42,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:42,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 02:45:42,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:42,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:45:42,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:45:42,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 02:45:42,336 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 11 treesize of output 11 [2025-01-09 02:45:42,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 02:45:42,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 02:45:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:42,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:45:42,426 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_75 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2025-01-09 02:45:42,454 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_74 (Array Int Int)) (v_ArrVal_75 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_74 .cse0))) v_ArrVal_74)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_74) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2025-01-09 02:45:42,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:42,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2025-01-09 02:45:42,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-01-09 02:45:42,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 02:45:42,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2025-01-09 02:45:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 02:45:42,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983024806] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:45:42,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:45:42,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-01-09 02:45:42,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954391806] [2025-01-09 02:45:42,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:45:42,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 02:45:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:42,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 02:45:42,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=165, Unknown=4, NotChecked=54, Total=272 [2025-01-09 02:45:42,675 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:42,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse2 (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_9| Int)) (or (forall ((v_ArrVal_74 (Array Int Int)) (v_ArrVal_75 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_74 .cse1)) v_ArrVal_74)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_74) |v_ULTIMATE.start_main_~t~0#1.base_9| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_9|))))) (= .cse2 1) (forall ((v_ArrVal_74 (Array Int Int)) (v_ArrVal_75 (Array Int Int))) (or (not (= (store .cse0 .cse1 (select v_ArrVal_74 .cse1)) v_ArrVal_74)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_74) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_75) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~flag~0#1| .cse2))) is different from false [2025-01-09 02:45:43,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:43,114 INFO L93 Difference]: Finished difference Result 99 states and 114 transitions. [2025-01-09 02:45:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 02:45:43,115 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 02:45:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:43,115 INFO L225 Difference]: With dead ends: 99 [2025-01-09 02:45:43,115 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 02:45:43,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=588, Unknown=8, NotChecked=162, Total=930 [2025-01-09 02:45:43,116 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 41 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:43,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 171 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 196 Invalid, 9 Unknown, 252 Unchecked, 0.2s Time] [2025-01-09 02:45:43,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 02:45:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 53. [2025-01-09 02:45:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-01-09 02:45:43,127 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 18 [2025-01-09 02:45:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:43,128 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-01-09 02:45:43,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-01-09 02:45:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 02:45:43,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:43,129 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:43,136 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-09 02:45:43,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:43,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:45:43,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:43,334 INFO L85 PathProgramCache]: Analyzing trace with hash -386224880, now seen corresponding path program 1 times [2025-01-09 02:45:43,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:43,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077061719] [2025-01-09 02:45:43,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:43,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:43,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:45:43,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:45:43,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:43,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:43,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077061719] [2025-01-09 02:45:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077061719] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671102812] [2025-01-09 02:45:43,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:43,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:43,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:43,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:45:43,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:45:43,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 02:45:43,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 02:45:43,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:43,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:43,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 02:45:43,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:43,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:45:43,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:45:43,946 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2025-01-09 02:45:43,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2025-01-09 02:45:43,952 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 9 [2025-01-09 02:45:43,962 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 02:45:43,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2025-01-09 02:45:43,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 02:45:44,093 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 19 treesize of output 11 [2025-01-09 02:45:44,098 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 7 treesize of output 3 [2025-01-09 02:45:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:44,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:45:44,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:44,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 97 [2025-01-09 02:45:44,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:44,327 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2025-01-09 02:45:44,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:44,333 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-01-09 02:45:44,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:44,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-01-09 02:45:44,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:44,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2025-01-09 02:45:44,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2025-01-09 02:45:44,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2025-01-09 02:45:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:44,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671102812] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:45:44,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:45:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2025-01-09 02:45:44,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530257637] [2025-01-09 02:45:44,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:45:44,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 02:45:44,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:44,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 02:45:44,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-01-09 02:45:44,454 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:44,793 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2025-01-09 02:45:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 02:45:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 02:45:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:44,795 INFO L225 Difference]: With dead ends: 80 [2025-01-09 02:45:44,795 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 02:45:44,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 02:45:44,796 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 54 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:44,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 199 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:45:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 02:45:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2025-01-09 02:45:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-01-09 02:45:44,806 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 23 [2025-01-09 02:45:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:44,806 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-01-09 02:45:44,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-01-09 02:45:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:45:44,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:44,807 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:44,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 02:45:45,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:45,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:45:45,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1975521799, now seen corresponding path program 2 times [2025-01-09 02:45:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:45,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505811031] [2025-01-09 02:45:45,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:45:45,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:45,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 02:45:45,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:45:45,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:45:45,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 02:45:45,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:45,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505811031] [2025-01-09 02:45:45,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505811031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:45:45,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:45:45,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:45:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043043270] [2025-01-09 02:45:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:45:45,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:45:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:45:45,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:45:45,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:45:45,052 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:45:45,067 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2025-01-09 02:45:45,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:45:45,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 02:45:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:45:45,068 INFO L225 Difference]: With dead ends: 86 [2025-01-09 02:45:45,068 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 02:45:45,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:45:45,069 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:45:45,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:45:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 02:45:45,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-01-09 02:45:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-01-09 02:45:45,077 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29 [2025-01-09 02:45:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:45:45,077 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-01-09 02:45:45,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:45:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-01-09 02:45:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 02:45:45,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:45:45,078 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:45:45,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:45:45,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:45:45,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:45:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash 387173897, now seen corresponding path program 1 times [2025-01-09 02:45:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:45:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025439785] [2025-01-09 02:45:45,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:45:45,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:45:45,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:45:45,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:45,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:45,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:45:45,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025439785] [2025-01-09 02:45:45,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025439785] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:45:45,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241046469] [2025-01-09 02:45:45,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:45:45,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:45:45,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:45:45,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:45:45,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:45:45,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 02:45:45,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 02:45:45,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:45:45,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:45:45,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-09 02:45:45,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:45:45,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 02:45:45,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 02:45:45,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:45:45,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 02:45:45,950 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:45,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2025-01-09 02:45:45,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 02:45:45,971 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 02:45:45,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 02:45:46,030 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-01-09 02:45:46,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2025-01-09 02:45:46,136 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-09 02:45:46,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-01-09 02:45:46,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 02:45:46,157 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 02:45:46,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-01-09 02:45:46,294 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2025-01-09 02:45:46,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 76 [2025-01-09 02:45:46,317 INFO L349 Elim1Store]: treesize reduction 38, result has 41.5 percent of original size [2025-01-09 02:45:46,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 76 [2025-01-09 02:45:46,340 INFO L349 Elim1Store]: treesize reduction 38, result has 37.7 percent of original size [2025-01-09 02:45:46,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 66 [2025-01-09 02:45:46,444 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:45:46,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2025-01-09 02:45:46,737 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 02:45:46,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 28 [2025-01-09 02:45:46,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 02:45:46,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 02:45:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:45:46,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:45:47,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:47,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2025-01-09 02:45:47,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:47,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 866 treesize of output 894 [2025-01-09 02:45:47,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:45:47,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 522 treesize of output 490 [2025-01-09 02:45:47,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 02:45:47,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-01-09 02:45:47,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-01-09 02:46:58,299 WARN L286 SmtUtils]: Spent 1.16m on a formula simplification that was a NOOP. DAG size: 2423 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-09 02:46:58,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:46:58,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 34 select indices, 34 select index equivalence classes, 0 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 561 case distinctions, treesize of input 21793 treesize of output 42170 [2025-01-09 02:47:08,020 INFO L224 Elim1Store]: Index analysis took 5820 ms