./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:05:32,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:05:32,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:05:32,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:05:32,409 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:05:32,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:05:32,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:05:32,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:05:32,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:05:32,436 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:05:32,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:05:32,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:05:32,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:05:32,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:05:32,436 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:05:32,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:05:32,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:32,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:05:32,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:05:32,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:05:32,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:05:32,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:05:32,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:05:32,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:05:32,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:05:32,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:05:32,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:05:32,438 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2025-02-07 20:05:32,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:05:32,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:05:32,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:05:32,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:05:32,691 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:05:32,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2025-02-07 20:05:33,960 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aeb22f2dd/b7351366e9184f5580e2e88ed3330705/FLAG9fcb8d47c [2025-02-07 20:05:34,332 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:05:34,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2025-02-07 20:05:34,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aeb22f2dd/b7351366e9184f5580e2e88ed3330705/FLAG9fcb8d47c [2025-02-07 20:05:34,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aeb22f2dd/b7351366e9184f5580e2e88ed3330705 [2025-02-07 20:05:34,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:05:34,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:05:34,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:34,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:05:34,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:05:34,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a751b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34, skipping insertion in model container [2025-02-07 20:05:34,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:05:34,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2025-02-07 20:05:34,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:34,758 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:05:34,797 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2025-02-07 20:05:34,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:34,838 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:05:34,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34 WrapperNode [2025-02-07 20:05:34,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:34,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:34,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:05:34,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:05:34,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,877 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 186 [2025-02-07 20:05:34,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:34,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:05:34,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:05:34,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:05:34,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,915 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 6, 8, 18, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0, 0]. The 10 writes are split as follows [0, 1, 1, 7, 1]. [2025-02-07 20:05:34,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:05:34,934 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:05:34,934 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:05:34,934 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:05:34,935 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (1/1) ... [2025-02-07 20:05:34,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:34,966 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-02-07 20:05:34,971 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-02-07 20:05:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-07 20:05:34,994 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-07 20:05:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:05:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:05:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 20:05:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:05:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:05:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 20:05:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 20:05:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 20:05:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:05:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:05:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 20:05:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 20:05:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 20:05:34,995 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2025-02-07 20:05:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2025-02-07 20:05:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2025-02-07 20:05:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2025-02-07 20:05:34,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:05:34,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:05:35,136 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:05:35,138 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:05:35,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: call ULTIMATE.dealloc(main_~#p1~0#1.base, main_~#p1~0#1.offset);havoc main_~#p1~0#1.base, main_~#p1~0#1.offset;call ULTIMATE.dealloc(main_~#p2~0#1.base, main_~#p2~0#1.offset);havoc main_~#p2~0#1.base, main_~#p2~0#1.offset; [2025-02-07 20:05:35,444 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L600: havoc create_sll_#t~mem11#1.base, create_sll_#t~mem11#1.offset;call ULTIMATE.dealloc(create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset);havoc create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset; [2025-02-07 20:05:35,459 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-02-07 20:05:35,460 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:05:35,472 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:05:35,474 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:05:35,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:35 BoogieIcfgContainer [2025-02-07 20:05:35,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:05:35,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:05:35,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:05:35,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:05:35,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:05:34" (1/3) ... [2025-02-07 20:05:35,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efeea1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:35, skipping insertion in model container [2025-02-07 20:05:35,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:34" (2/3) ... [2025-02-07 20:05:35,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efeea1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:35, skipping insertion in model container [2025-02-07 20:05:35,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:35" (3/3) ... [2025-02-07 20:05:35,485 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2025-02-07 20:05:35,496 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:05:35,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_to_dll_rev-2.i that has 5 procedures, 104 locations, 1 initial locations, 21 loop locations, and 1 error locations. [2025-02-07 20:05:35,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:05:35,551 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;@5a53f367, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:05:35,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:05:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 80 states have (on average 1.5875) internal successors, (127), 90 states have internal predecessors, (127), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-07 20:05:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 20:05:35,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:35,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:35,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:35,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 168249840, now seen corresponding path program 1 times [2025-02-07 20:05:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:35,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658196898] [2025-02-07 20:05:35,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:35,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 20:05:35,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 20:05:35,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:35,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658196898] [2025-02-07 20:05:35,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658196898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:35,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:05:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396422958] [2025-02-07 20:05:35,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:35,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:05:35,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:35,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:05:35,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:05:35,766 INFO L87 Difference]: Start difference. First operand has 104 states, 80 states have (on average 1.5875) internal successors, (127), 90 states have internal predecessors, (127), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 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-02-07 20:05:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:35,784 INFO L93 Difference]: Finished difference Result 162 states and 256 transitions. [2025-02-07 20:05:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:05:35,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 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) Word has length 16 [2025-02-07 20:05:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:35,789 INFO L225 Difference]: With dead ends: 162 [2025-02-07 20:05:35,789 INFO L226 Difference]: Without dead ends: 54 [2025-02-07 20:05:35,791 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-02-07 20:05:35,794 INFO L435 NwaCegarLoop]: 69 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, 69 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-02-07 20:05:35,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-07 20:05:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-07 20:05:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 46 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:05:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2025-02-07 20:05:35,825 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 16 [2025-02-07 20:05:35,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:35,825 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2025-02-07 20:05:35,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 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-02-07 20:05:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2025-02-07 20:05:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 20:05:35,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:35,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:35,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:05:35,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:35,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:35,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1348791875, now seen corresponding path program 1 times [2025-02-07 20:05:35,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:35,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331460090] [2025-02-07 20:05:35,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:35,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 20:05:35,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 20:05:35,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:35,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:05:36,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331460090] [2025-02-07 20:05:36,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331460090] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:36,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403463320] [2025-02-07 20:05:36,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:36,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:36,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:36,780 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-02-07 20:05:36,781 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-02-07 20:05:36,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 20:05:36,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 20:05:36,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:36,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:36,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-07 20:05:36,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:37,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 20:05:37,060 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 24 treesize of output 16 [2025-02-07 20:05:37,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 20:05:37,125 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 16 treesize of output 8 [2025-02-07 20:05:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:05:37,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:37,171 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 34 treesize of output 30 [2025-02-07 20:05:37,242 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 30 treesize of output 26 [2025-02-07 20:05:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:05:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403463320] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:37,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 11 [2025-02-07 20:05:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614007785] [2025-02-07 20:05:37,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:37,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:05:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:37,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:05:37,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:05:37,281 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:05:41,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:05:45,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:05:49,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:05:53,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:05:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:53,524 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-02-07 20:05:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:05:53,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-02-07 20:05:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:53,526 INFO L225 Difference]: With dead ends: 66 [2025-02-07 20:05:53,528 INFO L226 Difference]: Without dead ends: 63 [2025-02-07 20:05:53,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:05:53,529 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 70 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 11 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:53,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 342 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-02-07 20:05:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-07 20:05:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2025-02-07 20:05:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 49 states have internal predecessors, (53), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:05:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2025-02-07 20:05:53,542 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 41 [2025-02-07 20:05:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:53,542 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2025-02-07 20:05:53,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:05:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2025-02-07 20:05:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 20:05:53,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:53,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:53,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:05:53,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:53,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:53,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:53,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1944292659, now seen corresponding path program 1 times [2025-02-07 20:05:53,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:53,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078200447] [2025-02-07 20:05:53,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:53,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:53,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 20:05:53,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:05:53,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:53,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:54,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:05:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:54,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078200447] [2025-02-07 20:05:54,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078200447] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:54,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853603090] [2025-02-07 20:05:54,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:54,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:54,113 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-02-07 20:05:54,115 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-02-07 20:05:54,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 20:05:54,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 20:05:54,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:54,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:54,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-07 20:05:54,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:54,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 20:05:54,288 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 24 treesize of output 16 [2025-02-07 20:05:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 20:05:54,392 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 16 treesize of output 8 [2025-02-07 20:05:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 20:05:54,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:54,440 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 34 treesize of output 30 [2025-02-07 20:05:54,542 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 30 treesize of output 26 [2025-02-07 20:05:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:05:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853603090] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:54,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 11 [2025-02-07 20:05:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892453161] [2025-02-07 20:05:54,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:54,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 20:05:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:54,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 20:05:54,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:05:54,560 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:05:58,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:02,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:06,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:06,772 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2025-02-07 20:06:06,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 20:06:06,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-02-07 20:06:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:06,773 INFO L225 Difference]: With dead ends: 70 [2025-02-07 20:06:06,773 INFO L226 Difference]: Without dead ends: 67 [2025-02-07 20:06:06,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:06:06,774 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 66 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:06,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 366 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 3 Unknown, 0 Unchecked, 12.1s Time] [2025-02-07 20:06:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-07 20:06:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2025-02-07 20:06:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-07 20:06:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2025-02-07 20:06:06,787 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 44 [2025-02-07 20:06:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:06,787 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2025-02-07 20:06:06,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:06:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2025-02-07 20:06:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 20:06:06,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:06,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:06,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 20:06:06,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:06,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:06,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1923947138, now seen corresponding path program 1 times [2025-02-07 20:06:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:06,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207137433] [2025-02-07 20:06:06,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:07,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 20:06:07,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 20:06:07,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:07,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207137433] [2025-02-07 20:06:08,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207137433] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:08,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268890489] [2025-02-07 20:06:08,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:08,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:08,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:06:08,288 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-02-07 20:06:08,292 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-02-07 20:06:08,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 20:06:08,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 20:06:08,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:08,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:08,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-07 20:06:08,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:06:08,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-07 20:06:08,543 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 19 treesize of output 11 [2025-02-07 20:06:08,577 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 11 [2025-02-07 20:06:08,585 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-02-07 20:06:08,647 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 11 treesize of output 7 [2025-02-07 20:06:08,744 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-02-07 20:06:08,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-02-07 20:06:08,974 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 19 treesize of output 11 [2025-02-07 20:06:08,986 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 42 treesize of output 19 [2025-02-07 20:06:09,128 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-02-07 20:06:09,144 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 40 treesize of output 28 [2025-02-07 20:06:09,160 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-02-07 20:06:09,237 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 15 treesize of output 7 [2025-02-07 20:06:09,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 9 treesize of output 3 [2025-02-07 20:06:09,364 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_9|) 0)) (exists ((|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_8|) 0)) (exists ((|v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_9| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_9|) |v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_9|) 0)) (exists ((|v_chain_node_~node~0#1.base_28| Int)) (and (= (select |c_old(#valid)| |v_chain_node_~node~0#1.base_28|) 0) (= (store |c_old(#memory_$Pointer$#3.base)| |v_chain_node_~node~0#1.base_28| (select |c_#memory_$Pointer$#3.base| |v_chain_node_~node~0#1.base_28|)) |c_#memory_$Pointer$#3.base|)))) is different from true [2025-02-07 20:06:09,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:09,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-02-07 20:06:09,394 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-07 20:06:09,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-07 20:06:09,541 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 23 treesize of output 15 [2025-02-07 20:06:09,546 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-02-07 20:06:09,727 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 16 treesize of output 8 [2025-02-07 20:06:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-07 20:06:09,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:06:10,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268890489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:10,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:06:10,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2025-02-07 20:06:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951361835] [2025-02-07 20:06:10,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:06:10,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-07 20:06:10,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:10,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-07 20:06:10,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1595, Unknown=1, NotChecked=80, Total=1806 [2025-02-07 20:06:10,054 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 38 states, 36 states have (on average 2.111111111111111) internal successors, (76), 30 states have internal predecessors, (76), 9 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 20:06:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:11,478 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2025-02-07 20:06:11,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-07 20:06:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.111111111111111) internal successors, (76), 30 states have internal predecessors, (76), 9 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2025-02-07 20:06:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:11,480 INFO L225 Difference]: With dead ends: 125 [2025-02-07 20:06:11,480 INFO L226 Difference]: Without dead ends: 122 [2025-02-07 20:06:11,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=342, Invalid=3201, Unknown=1, NotChecked=116, Total=3660 [2025-02-07 20:06:11,482 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 178 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:11,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 668 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 975 Invalid, 0 Unknown, 128 Unchecked, 0.7s Time] [2025-02-07 20:06:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-07 20:06:11,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 109. [2025-02-07 20:06:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 94 states have internal predecessors, (100), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:06:11,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2025-02-07 20:06:11,519 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 49 [2025-02-07 20:06:11,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:11,520 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2025-02-07 20:06:11,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.111111111111111) internal successors, (76), 30 states have internal predecessors, (76), 9 states have call successors, (9), 9 states have call predecessors, (9), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 20:06:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2025-02-07 20:06:11,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-07 20:06:11,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:11,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:11,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 20:06:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:11,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1522187991, now seen corresponding path program 1 times [2025-02-07 20:06:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-02-07 20:06:11,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:11,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:11,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-07 20:06:11,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-07 20:06:11,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:11,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295655933] [2025-02-07 20:06:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295655933] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770822907] [2025-02-07 20:06:13,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:13,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:13,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:06:13,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:06:13,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:06:13,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-07 20:06:13,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-07 20:06:13,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:13,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:13,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-02-07 20:06:13,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:06:13,296 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-02-07 20:06:13,329 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-02-07 20:06:13,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2025-02-07 20:06:13,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2025-02-07 20:06:13,344 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-02-07 20:06:13,433 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 50 treesize of output 38 [2025-02-07 20:06:13,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 20:06:13,443 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 11 [2025-02-07 20:06:13,487 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 55 treesize of output 39 [2025-02-07 20:06:13,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-02-07 20:06:13,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2025-02-07 20:06:13,496 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 9 treesize of output 3 [2025-02-07 20:06:13,609 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 70 treesize of output 39 [2025-02-07 20:06:13,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:13,615 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 34 treesize of output 21 [2025-02-07 20:06:13,619 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 26 treesize of output 14 [2025-02-07 20:06:13,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:13,622 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 26 treesize of output 21 [2025-02-07 20:06:13,635 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-07 20:06:13,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-07 20:06:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 20:06:13,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:06:14,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770822907] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:14,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:06:14,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 28 [2025-02-07 20:06:14,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031785658] [2025-02-07 20:06:14,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:06:14,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 20:06:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:14,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 20:06:14,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2025-02-07 20:06:14,012 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 28 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 7 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-07 20:06:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:14,877 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2025-02-07 20:06:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 20:06:14,877 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 7 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 52 [2025-02-07 20:06:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:14,879 INFO L225 Difference]: With dead ends: 118 [2025-02-07 20:06:14,879 INFO L226 Difference]: Without dead ends: 115 [2025-02-07 20:06:14,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=1377, Unknown=0, NotChecked=0, Total=1560 [2025-02-07 20:06:14,884 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 99 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:14,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 365 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 20:06:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-07 20:06:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2025-02-07 20:06:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.1123595505617978) internal successors, (99), 93 states have internal predecessors, (99), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:06:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2025-02-07 20:06:14,917 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 52 [2025-02-07 20:06:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:14,917 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-02-07 20:06:14,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 25 states have internal predecessors, (82), 7 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-07 20:06:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2025-02-07 20:06:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-07 20:06:14,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:14,920 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:14,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:06:15,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:15,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:15,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash -602199761, now seen corresponding path program 1 times [2025-02-07 20:06:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-02-07 20:06:15,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:15,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:15,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-07 20:06:15,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 20:06:15,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:15,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 20:06:16,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:16,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235247854] [2025-02-07 20:06:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235247854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:16,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875317280] [2025-02-07 20:06:16,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:16,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:16,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:06:16,364 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:06:16,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:06:16,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-07 20:06:16,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 20:06:16,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:16,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:16,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 133 conjuncts are in the unsatisfiable core [2025-02-07 20:06:16,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:06:16,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-07 20:06:16,558 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-02-07 20:06:16,591 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-02-07 20:06:16,595 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 11 [2025-02-07 20:06:16,609 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 11 treesize of output 7 [2025-02-07 20:06:16,645 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-02-07 20:06:16,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2025-02-07 20:06:16,710 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 16 treesize of output 1 [2025-02-07 20:06:16,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2025-02-07 20:06:16,790 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 19 treesize of output 11 [2025-02-07 20:06:16,798 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 42 treesize of output 19 [2025-02-07 20:06:16,901 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-02-07 20:06:16,906 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 51 treesize of output 35 [2025-02-07 20:06:16,909 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-02-07 20:06:16,917 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-02-07 20:06:16,993 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 15 treesize of output 7 [2025-02-07 20:06:16,998 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 11 treesize of output 3 [2025-02-07 20:06:17,001 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 9 treesize of output 3 [2025-02-07 20:06:17,138 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_11| Int) (|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_11| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_11|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_11|) 0)) (exists ((|v_chain_node_~node~0#1.base_50| Int)) (and (= (store |c_old(#memory_$Pointer$#3.offset)| |v_chain_node_~node~0#1.base_50| (select |c_#memory_$Pointer$#3.offset| |v_chain_node_~node~0#1.base_50|)) |c_#memory_$Pointer$#3.offset|) (= (select |c_old(#valid)| |v_chain_node_~node~0#1.base_50|) 0) (= (store |c_old(#memory_$Pointer$#3.base)| |v_chain_node_~node~0#1.base_50| (select |c_#memory_$Pointer$#3.base| |v_chain_node_~node~0#1.base_50|)) |c_#memory_$Pointer$#3.base|))) (exists ((|v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_17| Int) (|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_17| Int)) (= (select (select |c_#memory_$Pointer$#4.offset| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_17|) |v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_17|) 0)) (exists ((|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_12| Int)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_12|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_12|)))) is different from true [2025-02-07 20:06:17,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:17,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-02-07 20:06:17,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:17,169 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 20 treesize of output 15 [2025-02-07 20:06:17,176 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-07 20:06:17,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-07 20:06:17,378 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 34 treesize of output 22 [2025-02-07 20:06:17,384 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-02-07 20:06:17,552 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 15 treesize of output 7 [2025-02-07 20:06:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-02-07 20:06:17,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:06:17,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875317280] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:17,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:06:17,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2025-02-07 20:06:17,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162852570] [2025-02-07 20:06:17,893 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:06:17,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-07 20:06:17,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:17,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-07 20:06:17,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1225, Unknown=1, NotChecked=70, Total=1406 [2025-02-07 20:06:17,894 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 32 states, 30 states have (on average 2.4) internal successors, (72), 25 states have internal predecessors, (72), 7 states have call successors, (8), 8 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-07 20:06:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:19,532 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2025-02-07 20:06:19,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 20:06:19,532 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.4) internal successors, (72), 25 states have internal predecessors, (72), 7 states have call successors, (8), 8 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 54 [2025-02-07 20:06:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:19,537 INFO L225 Difference]: With dead ends: 129 [2025-02-07 20:06:19,537 INFO L226 Difference]: Without dead ends: 110 [2025-02-07 20:06:19,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=249, Invalid=2406, Unknown=1, NotChecked=100, Total=2756 [2025-02-07 20:06:19,539 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 133 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:19,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 516 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 825 Invalid, 0 Unknown, 110 Unchecked, 0.9s Time] [2025-02-07 20:06:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-07 20:06:19,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2025-02-07 20:06:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 86 states have internal predecessors, (89), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-07 20:06:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2025-02-07 20:06:19,566 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 54 [2025-02-07 20:06:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:19,567 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2025-02-07 20:06:19,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.4) internal successors, (72), 25 states have internal predecessors, (72), 7 states have call successors, (8), 8 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-07 20:06:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2025-02-07 20:06:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-07 20:06:19,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:19,568 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:19,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 20:06:19,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:19,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:19,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1264104716, now seen corresponding path program 1 times [2025-02-07 20:06:19,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:19,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546442298] [2025-02-07 20:06:19,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:19,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:19,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 20:06:19,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 20:06:19,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:19,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:22,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:22,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546442298] [2025-02-07 20:06:22,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546442298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:22,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727487237] [2025-02-07 20:06:22,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:22,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:22,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:06:22,211 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:06:22,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:06:22,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-07 20:06:22,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-07 20:06:22,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:22,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:22,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-02-07 20:06:22,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:06:22,443 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-02-07 20:06:22,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2025-02-07 20:06:22,496 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 19 [2025-02-07 20:06:22,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2025-02-07 20:06:22,507 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 31 treesize of output 11 [2025-02-07 20:06:22,633 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 11 [2025-02-07 20:06:22,638 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-02-07 20:06:22,742 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 43 treesize of output 27 [2025-02-07 20:06:22,749 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 11 treesize of output 3 [2025-02-07 20:06:22,758 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 9 treesize of output 3 [2025-02-07 20:06:22,761 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 11 treesize of output 3 [2025-02-07 20:06:23,095 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 58 treesize of output 27 [2025-02-07 20:06:23,112 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-02-07 20:06:23,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 29 treesize of output 37 [2025-02-07 20:06:23,126 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 28 treesize of output 15 [2025-02-07 20:06:23,133 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 28 treesize of output 15 [2025-02-07 20:06:23,149 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-02-07 20:06:23,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-07 20:06:23,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-07 20:06:23,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-07 20:06:23,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-07 20:06:23,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-07 20:06:23,532 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_15| Int) (|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_15| Int)) (and (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_15|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_15|) 0) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_15|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_15|) (select (select |c_#memory_$Pointer$#4.base| |v_ULTIMATE.start_main_~#p1~0#1.base_BEFORE_CALL_20|) |v_ULTIMATE.start_main_~#p1~0#1.offset_BEFORE_CALL_20|))))) (exists ((|v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_14| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#p2~0#1.base_BEFORE_CALL_14|) |v_ULTIMATE.start_main_~#p2~0#1.offset_BEFORE_CALL_14|) 0)) (exists ((|v_chain_node_~node~0#1.base_60| Int)) (and (= |c_#memory_$Pointer$#3.base| (store |c_old(#memory_$Pointer$#3.base)| |v_chain_node_~node~0#1.base_60| (select |c_#memory_$Pointer$#3.base| |v_chain_node_~node~0#1.base_60|))) (= (store |c_old(#memory_$Pointer$#3.offset)| |v_chain_node_~node~0#1.base_60| (select |c_#memory_$Pointer$#3.offset| |v_chain_node_~node~0#1.base_60|)) |c_#memory_$Pointer$#3.offset|) (= (select |c_old(#valid)| |v_chain_node_~node~0#1.base_60|) 0)))) is different from true [2025-02-07 20:06:23,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-07 20:06:23,590 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-07 20:06:23,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-02-07 20:06:23,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-07 20:06:23,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-07 20:06:24,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:06:24,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 72 [2025-02-07 20:06:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-07 20:06:24,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:06:24,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727487237] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:24,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:06:24,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2025-02-07 20:06:24,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793859987] [2025-02-07 20:06:24,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:06:24,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-07 20:06:24,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:06:24,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-07 20:06:24,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1831, Unknown=1, NotChecked=86, Total=2070 [2025-02-07 20:06:24,950 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 44 states, 42 states have (on average 2.142857142857143) internal successors, (90), 37 states have internal predecessors, (90), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-07 20:06:29,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:37,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:45,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:50,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:54,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:07:02,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:07:10,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]