./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash f80b27594aadcdaa93090b35b429df9d0a90b0252fa7b12ed0563c83d3b4cc77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 18:11:27,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 18:11:27,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 18:11:27,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 18:11:27,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 18:11:27,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 18:11:27,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 18:11:27,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 18:11:27,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 18:11:27,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 18:11:27,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 18:11:27,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 18:11:27,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 18:11:27,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 18:11:27,392 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 18:11:27,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 18:11:27,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 18:11:27,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 18:11:27,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 18:11:27,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 18:11:27,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 18:11:27,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 18:11:27,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:11:27,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 18:11:27,394 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 18:11:27,394 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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f80b27594aadcdaa93090b35b429df9d0a90b0252fa7b12ed0563c83d3b4cc77 [2025-03-08 18:11:27,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 18:11:27,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 18:11:27,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 18:11:27,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 18:11:27,621 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 18:11:27,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i [2025-03-08 18:11:28,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969b5cb6c/3f452322a5134778aee34ef08ffad26a/FLAG2be29a869 [2025-03-08 18:11:29,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 18:11:29,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i [2025-03-08 18:11:29,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969b5cb6c/3f452322a5134778aee34ef08ffad26a/FLAG2be29a869 [2025-03-08 18:11:29,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/969b5cb6c/3f452322a5134778aee34ef08ffad26a [2025-03-08 18:11:29,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 18:11:29,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 18:11:29,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 18:11:29,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 18:11:29,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 18:11:29,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:11:29" (1/1) ... [2025-03-08 18:11:29,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1795bdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:29, skipping insertion in model container [2025-03-08 18:11:29,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:11:29" (1/1) ... [2025-03-08 18:11:29,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 18:11:29,534 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[4494,4507] [2025-03-08 18:11:29,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[4554,4567] [2025-03-08 18:11:29,935 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,935 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,936 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,936 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,937 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,948 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,948 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,950 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,950 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,951 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,953 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,953 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:29,953 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[150678,150691] [2025-03-08 18:11:30,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:11:30,297 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 18:11:30,306 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[4494,4507] [2025-03-08 18:11:30,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[4554,4567] [2025-03-08 18:11:30,350 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,351 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,351 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,351 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,354 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,359 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,359 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,362 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,362 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-08 18:11:30,420 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i[150678,150691] [2025-03-08 18:11:30,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 18:11:30,548 INFO L204 MainTranslator]: Completed translation [2025-03-08 18:11:30,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30 WrapperNode [2025-03-08 18:11:30,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 18:11:30,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 18:11:30,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 18:11:30,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 18:11:30,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,603 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,632 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 131 [2025-03-08 18:11:30,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 18:11:30,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 18:11:30,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 18:11:30,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 18:11:30,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,658 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2025-03-08 18:11:30,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,669 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 18:11:30,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 18:11:30,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 18:11:30,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 18:11:30,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (1/1) ... [2025-03-08 18:11:30,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 18:11:30,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:30,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 18:11:30,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 18:11:30,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 18:11:30,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:11:30,727 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-08 18:11:30,727 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 18:11:30,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 18:11:30,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 18:11:30,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-08 18:11:30,728 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 18:11:30,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 18:11:30,899 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 18:11:30,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 18:11:30,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-08 18:11:30,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-08 18:11:31,104 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-08 18:11:31,124 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-08 18:11:31,124 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 18:11:31,131 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 18:11:31,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 18:11:31,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:11:31 BoogieIcfgContainer [2025-03-08 18:11:31,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 18:11:31,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 18:11:31,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 18:11:31,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 18:11:31,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:11:29" (1/3) ... [2025-03-08 18:11:31,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a1a9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:11:31, skipping insertion in model container [2025-03-08 18:11:31,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:11:30" (2/3) ... [2025-03-08 18:11:31,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a1a9ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:11:31, skipping insertion in model container [2025-03-08 18:11:31,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:11:31" (3/3) ... [2025-03-08 18:11:31,140 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness_negated.i [2025-03-08 18:11:31,152 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 18:11:31,153 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rend_harness_negated.i that has 6 procedures, 67 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 18:11:31,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 18:11:31,193 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;@1fa0af57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 18:11:31,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 18:11:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 18:11:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:11:31,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:31,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:11:31,206 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:31,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1130872929, now seen corresponding path program 1 times [2025-03-08 18:11:31,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:31,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929893955] [2025-03-08 18:11:31,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:31,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:31,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:31,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:31,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 18:11:31,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929893955] [2025-03-08 18:11:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929893955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865362617] [2025-03-08 18:11:31,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:31,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:31,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:31,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:31,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 18:11:31,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:31,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:31,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:31,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:31,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 18:11:31,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 18:11:31,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:31,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865362617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:31,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:31,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 18:11:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857953275] [2025-03-08 18:11:31,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:31,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 18:11:31,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:31,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 18:11:31,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 18:11:31,719 INFO L87 Difference]: Start difference. First operand has 67 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:31,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:31,738 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2025-03-08 18:11:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 18:11:31,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-08 18:11:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:31,744 INFO L225 Difference]: With dead ends: 126 [2025-03-08 18:11:31,744 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 18:11:31,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-03-08 18:11:31,750 INFO L435 NwaCegarLoop]: 86 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, 86 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-03-08 18:11:31,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:11:31,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 18:11:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 18:11:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 44 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-08 18:11:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-03-08 18:11:31,775 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 70 [2025-03-08 18:11:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:31,775 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-03-08 18:11:31,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:31,775 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-03-08 18:11:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 18:11:31,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:31,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 18:11:31,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 18:11:31,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 18:11:31,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:31,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash -624638336, now seen corresponding path program 1 times [2025-03-08 18:11:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:31,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702709375] [2025-03-08 18:11:31,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:32,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 18:11:32,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 18:11:32,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:32,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-08 18:11:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702709375] [2025-03-08 18:11:32,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702709375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:32,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:32,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 18:11:32,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144935757] [2025-03-08 18:11:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:32,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:11:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:32,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:11:32,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 18:11:32,561 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 18:11:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:32,617 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2025-03-08 18:11:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:11:32,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2025-03-08 18:11:32,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:32,620 INFO L225 Difference]: With dead ends: 72 [2025-03-08 18:11:32,620 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 18:11:32,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:11:32,621 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:32,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 382 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:11:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 18:11:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-08 18:11:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 49 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 18:11:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-03-08 18:11:32,634 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2025-03-08 18:11:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:32,634 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-08 18:11:32,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 18:11:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-03-08 18:11:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 18:11:32,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:32,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:32,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 18:11:32,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:32,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:32,636 INFO L85 PathProgramCache]: Analyzing trace with hash 511756480, now seen corresponding path program 1 times [2025-03-08 18:11:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:32,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553922669] [2025-03-08 18:11:32,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:32,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:32,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 18:11:32,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 18:11:32,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:32,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:32,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:32,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553922669] [2025-03-08 18:11:32,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553922669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:32,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:32,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:11:32,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646170373] [2025-03-08 18:11:32,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:32,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:11:32,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:32,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:11:32,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:11:32,863 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:32,972 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2025-03-08 18:11:32,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:11:32,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-08 18:11:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:32,974 INFO L225 Difference]: With dead ends: 131 [2025-03-08 18:11:32,974 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 18:11:32,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:11:32,975 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 22 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:32,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 350 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:11:32,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 18:11:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-08 18:11:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 49 states have internal predecessors, (59), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 18:11:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-08 18:11:32,985 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 71 [2025-03-08 18:11:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:32,985 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-08 18:11:32,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-08 18:11:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 18:11:32,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:32,986 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:32,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 18:11:32,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:32,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:32,987 INFO L85 PathProgramCache]: Analyzing trace with hash 211973896, now seen corresponding path program 1 times [2025-03-08 18:11:32,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:32,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039045733] [2025-03-08 18:11:32,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:32,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:33,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 18:11:33,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 18:11:33,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:33,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:33,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:33,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039045733] [2025-03-08 18:11:33,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039045733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:33,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:33,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:11:33,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857244939] [2025-03-08 18:11:33,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:33,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:11:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:33,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:11:33,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:11:33,203 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:33,326 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2025-03-08 18:11:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:11:33,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-08 18:11:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:33,328 INFO L225 Difference]: With dead ends: 137 [2025-03-08 18:11:33,328 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 18:11:33,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 18:11:33,329 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:33,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 395 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:11:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 18:11:33,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-08 18:11:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 18:11:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-08 18:11:33,337 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 73 [2025-03-08 18:11:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:33,338 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-08 18:11:33,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-08 18:11:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 18:11:33,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:33,339 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:33,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 18:11:33,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:33,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash -626301941, now seen corresponding path program 1 times [2025-03-08 18:11:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449908198] [2025-03-08 18:11:33,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:33,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:33,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 18:11:33,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 18:11:33,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:33,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:33,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:33,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449908198] [2025-03-08 18:11:33,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449908198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:33,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:33,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 18:11:33,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311864697] [2025-03-08 18:11:33,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:33,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 18:11:33,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:33,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 18:11:33,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:11:33,564 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:33,677 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2025-03-08 18:11:33,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 18:11:33,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2025-03-08 18:11:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:33,678 INFO L225 Difference]: With dead ends: 138 [2025-03-08 18:11:33,678 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 18:11:33,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 18:11:33,679 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 28 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:33,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 402 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:11:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 18:11:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2025-03-08 18:11:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-08 18:11:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-03-08 18:11:33,692 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 74 [2025-03-08 18:11:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:33,692 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-03-08 18:11:33,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 18:11:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-03-08 18:11:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 18:11:33,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:33,693 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:33,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 18:11:33,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:33,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -514954486, now seen corresponding path program 1 times [2025-03-08 18:11:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371117306] [2025-03-08 18:11:33,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:33,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 18:11:33,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 18:11:33,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:33,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 18:11:33,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371117306] [2025-03-08 18:11:33,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371117306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129595975] [2025-03-08 18:11:33,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:33,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:33,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:33,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:33,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 18:11:34,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 18:11:34,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 18:11:34,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:34,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:34,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-08 18:11:34,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:34,213 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 18 treesize of output 19 [2025-03-08 18:11:34,226 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 24 treesize of output 9 [2025-03-08 18:11:34,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:34,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:34,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:34,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2025-03-08 18:11:34,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:34,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:34,286 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 34 treesize of output 22 [2025-03-08 18:11:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 18:11:34,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:34,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129595975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:34,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-08 18:11:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128260790] [2025-03-08 18:11:34,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:34,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 18:11:34,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:34,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 18:11:34,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:11:34,871 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 18:11:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:35,312 INFO L93 Difference]: Finished difference Result 196 states and 258 transitions. [2025-03-08 18:11:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 18:11:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2025-03-08 18:11:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:35,315 INFO L225 Difference]: With dead ends: 196 [2025-03-08 18:11:35,315 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 18:11:35,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:11:35,316 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 62 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:35,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 397 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:11:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 18:11:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2025-03-08 18:11:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 99 states have internal predecessors, (119), 26 states have call successors, (26), 11 states have call predecessors, (26), 14 states have return successors, (34), 24 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-08 18:11:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2025-03-08 18:11:35,341 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 82 [2025-03-08 18:11:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:35,341 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2025-03-08 18:11:35,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 18:11:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2025-03-08 18:11:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 18:11:35,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:35,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 18:11:35,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 18:11:35,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 18:11:35,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:35,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:35,547 INFO L85 PathProgramCache]: Analyzing trace with hash -234604597, now seen corresponding path program 1 times [2025-03-08 18:11:35,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:35,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387925026] [2025-03-08 18:11:35,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:35,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 18:11:35,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 18:11:35,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:35,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 18:11:35,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:35,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387925026] [2025-03-08 18:11:35,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387925026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:35,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026778943] [2025-03-08 18:11:35,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:35,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:35,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:35,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:35,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 18:11:35,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 18:11:35,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 18:11:35,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:35,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:35,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-08 18:11:35,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:35,961 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 18 treesize of output 7 [2025-03-08 18:11:35,966 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 14 treesize of output 15 [2025-03-08 18:11:36,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:36,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2025-03-08 18:11:36,018 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 22 treesize of output 25 [2025-03-08 18:11:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 18:11:36,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:36,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026778943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:36,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:36,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-08 18:11:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841160626] [2025-03-08 18:11:36,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:36,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 18:11:36,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:36,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 18:11:36,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 18:11:36,813 INFO L87 Difference]: Start difference. First operand 135 states and 179 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:37,261 INFO L93 Difference]: Finished difference Result 197 states and 255 transitions. [2025-03-08 18:11:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 18:11:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 82 [2025-03-08 18:11:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:37,263 INFO L225 Difference]: With dead ends: 197 [2025-03-08 18:11:37,263 INFO L226 Difference]: Without dead ends: 134 [2025-03-08 18:11:37,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:11:37,264 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 50 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:37,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 413 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 18:11:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-08 18:11:37,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-03-08 18:11:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 96 states have internal predecessors, (116), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-08 18:11:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 174 transitions. [2025-03-08 18:11:37,285 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 174 transitions. Word has length 82 [2025-03-08 18:11:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:37,285 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 174 transitions. [2025-03-08 18:11:37,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 174 transitions. [2025-03-08 18:11:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 18:11:37,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:37,287 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 18:11:37,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:37,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:37,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:37,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1226975402, now seen corresponding path program 2 times [2025-03-08 18:11:37,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:37,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704733295] [2025-03-08 18:11:37,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 18:11:37,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:37,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-08 18:11:37,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 82 statements. [2025-03-08 18:11:37,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 18:11:37,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 18:11:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:37,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704733295] [2025-03-08 18:11:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704733295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:37,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 18:11:37,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 18:11:37,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097357197] [2025-03-08 18:11:37,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:37,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:11:37,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:37,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:11:37,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 18:11:37,693 INFO L87 Difference]: Start difference. First operand 132 states and 174 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 18:11:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:37,745 INFO L93 Difference]: Finished difference Result 152 states and 201 transitions. [2025-03-08 18:11:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:11:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2025-03-08 18:11:37,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:37,747 INFO L225 Difference]: With dead ends: 152 [2025-03-08 18:11:37,748 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 18:11:37,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 18:11:37,749 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:37,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 446 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:11:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 18:11:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 134. [2025-03-08 18:11:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 98 states have internal predecessors, (118), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-08 18:11:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 176 transitions. [2025-03-08 18:11:37,770 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 176 transitions. Word has length 82 [2025-03-08 18:11:37,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:37,770 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 176 transitions. [2025-03-08 18:11:37,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 18:11:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2025-03-08 18:11:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:11:37,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:37,771 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:37,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 18:11:37,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:37,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1105108659, now seen corresponding path program 1 times [2025-03-08 18:11:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:37,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116442852] [2025-03-08 18:11:37,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:37,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:37,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:37,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:37,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:11:37,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116442852] [2025-03-08 18:11:37,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116442852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863431336] [2025-03-08 18:11:37,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:37,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:37,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:37,946 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:37,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 18:11:38,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:38,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:38,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:38,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:38,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 18:11:38,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:38,164 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-03-08 18:11:38,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 104 [2025-03-08 18:11:38,169 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 12 treesize of output 11 [2025-03-08 18:11:38,190 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:38,190 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 12 treesize of output 1 [2025-03-08 18:11:38,227 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:11:38,228 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 33 treesize of output 9 [2025-03-08 18:11:38,230 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 7 [2025-03-08 18:11:38,277 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= .cse1 (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (store .cse1 24 .cse0)) .cse0))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) 24) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|)))) is different from true [2025-03-08 18:11:38,530 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) 24)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (store .cse0 24 .cse1)) .cse1)))) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| .cse1) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| .cse2) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (store .cse3 24 .cse2)) .cse2))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) 24) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))))) is different from true [2025-03-08 18:11:40,240 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| (store .cse1 24 .cse0)) .cse0) .cse1)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) 24) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|) 24))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| .cse2) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse2))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse2 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| (store .cse3 24 .cse2)) .cse2)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|) 24) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) 24)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) 24))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse5))) (= .cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse5 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (store .cse4 24 .cse5)) .cse5)))) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| .cse5) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= .cse7 (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| (store .cse7 24 .cse6)) .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| Int)) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) 24) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) 24))) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| .cse8) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| .cse8))) (= .cse9 (select (store (store |c_#memory_$Pointer$#2.base| .cse8 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (store .cse9 24 .cse8)) .cse8))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) 24) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|))))) is different from true [2025-03-08 18:11:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 29 not checked. [2025-03-08 18:11:41,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:11:41,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:11:41,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 310 [2025-03-08 18:11:41,773 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 162 treesize of output 146 [2025-03-08 18:11:41,808 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 129 treesize of output 117 [2025-03-08 18:11:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863431336] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:41,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 18:11:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 20] total 33 [2025-03-08 18:11:41,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369390039] [2025-03-08 18:11:41,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:41,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:11:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:41,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:11:41,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=746, Unknown=32, NotChecked=174, Total=1056 [2025-03-08 18:11:41,968 INFO L87 Difference]: Start difference. First operand 134 states and 176 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:42,378 INFO L93 Difference]: Finished difference Result 235 states and 324 transitions. [2025-03-08 18:11:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 18:11:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 76 [2025-03-08 18:11:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:42,380 INFO L225 Difference]: With dead ends: 235 [2025-03-08 18:11:42,380 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 18:11:42,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=150, Invalid=1233, Unknown=35, NotChecked=222, Total=1640 [2025-03-08 18:11:42,381 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 170 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:42,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 390 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 18:11:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 18:11:42,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2025-03-08 18:11:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.25) internal successors, (120), 100 states have internal predecessors, (120), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-08 18:11:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2025-03-08 18:11:42,404 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 76 [2025-03-08 18:11:42,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:42,404 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2025-03-08 18:11:42,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2025-03-08 18:11:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:11:42,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:42,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:42,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 18:11:42,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:42,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:42,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:42,606 INFO L85 PathProgramCache]: Analyzing trace with hash 807144020, now seen corresponding path program 1 times [2025-03-08 18:11:42,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:42,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704927877] [2025-03-08 18:11:42,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:42,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:42,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:42,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:42,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 18:11:42,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:42,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704927877] [2025-03-08 18:11:42,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704927877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:42,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660213484] [2025-03-08 18:11:42,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:42,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:42,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:42,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:42,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 18:11:42,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:42,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:42,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:42,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:42,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 18:11:42,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:42,930 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 14 treesize of output 15 [2025-03-08 18:11:42,937 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 18 treesize of output 7 [2025-03-08 18:11:42,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:42,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:42,963 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 22 treesize of output 25 [2025-03-08 18:11:42,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:42,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:42,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:11:42,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-03-08 18:11:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 18:11:44,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660213484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:44,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:44,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-08 18:11:44,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106679472] [2025-03-08 18:11:44,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:44,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 18:11:44,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:44,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 18:11:44,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-08 18:11:44,062 INFO L87 Difference]: Start difference. First operand 136 states and 178 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:11:44,664 INFO L93 Difference]: Finished difference Result 226 states and 303 transitions. [2025-03-08 18:11:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:11:44,664 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 76 [2025-03-08 18:11:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:11:44,665 INFO L225 Difference]: With dead ends: 226 [2025-03-08 18:11:44,665 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 18:11:44,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-08 18:11:44,666 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 65 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:11:44,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 531 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 18:11:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 18:11:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2025-03-08 18:11:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 102 states have internal predecessors, (122), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-08 18:11:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2025-03-08 18:11:44,687 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 76 [2025-03-08 18:11:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:11:44,687 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2025-03-08 18:11:44,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2025-03-08 18:11:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:11:44,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:11:44,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:11:44,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 18:11:44,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 18:11:44,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:11:44,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:11:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2069032523, now seen corresponding path program 1 times [2025-03-08 18:11:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:11:44,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396135992] [2025-03-08 18:11:44,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:11:44,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:44,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:44,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:44,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:11:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:11:45,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396135992] [2025-03-08 18:11:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396135992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:11:45,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113127951] [2025-03-08 18:11:45,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:11:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:11:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:11:45,184 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:11:45,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 18:11:45,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:11:45,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:11:45,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:11:45,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:11:45,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 18:11:45,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:11:45,369 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 14 treesize of output 15 [2025-03-08 18:11:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 18:11:45,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:11:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113127951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:11:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:11:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2025-03-08 18:11:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443215289] [2025-03-08 18:11:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:11:45,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 18:11:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:11:45,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 18:11:45,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-08 18:11:45,973 INFO L87 Difference]: Start difference. First operand 138 states and 180 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:11:49,977 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-03-08 18:11:54,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:11:58,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:02,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:06,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:06,529 INFO L93 Difference]: Finished difference Result 234 states and 312 transitions. [2025-03-08 18:12:06,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 18:12:06,529 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 76 [2025-03-08 18:12:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:06,532 INFO L225 Difference]: With dead ends: 234 [2025-03-08 18:12:06,532 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 18:12:06,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-03-08 18:12:06,533 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 205 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 58 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:06,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 419 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 295 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2025-03-08 18:12:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 18:12:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2025-03-08 18:12:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.24) internal successors, (124), 104 states have internal predecessors, (124), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-03-08 18:12:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2025-03-08 18:12:06,551 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 76 [2025-03-08 18:12:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:06,551 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2025-03-08 18:12:06,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 18:12:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2025-03-08 18:12:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 18:12:06,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:06,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:12:06,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 18:12:06,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:06,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:06,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash -115751722, now seen corresponding path program 1 times [2025-03-08 18:12:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:06,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438484758] [2025-03-08 18:12:06,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:06,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:12:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:12:06,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:06,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:06,845 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 18:12:06,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:06,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438484758] [2025-03-08 18:12:06,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438484758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:06,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705605016] [2025-03-08 18:12:06,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:06,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:06,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:06,848 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:06,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 18:12:06,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 18:12:06,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 18:12:06,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:06,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:06,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 18:12:06,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:07,020 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:12:07,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:07,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705605016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:07,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:07,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-08 18:12:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414634787] [2025-03-08 18:12:07,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:07,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 18:12:07,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:07,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 18:12:07,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 18:12:07,023 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 18:12:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:07,120 INFO L93 Difference]: Finished difference Result 306 states and 407 transitions. [2025-03-08 18:12:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 18:12:07,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-03-08 18:12:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:07,122 INFO L225 Difference]: With dead ends: 306 [2025-03-08 18:12:07,122 INFO L226 Difference]: Without dead ends: 181 [2025-03-08 18:12:07,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 18:12:07,123 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:07,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 197 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:12:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-08 18:12:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-08 18:12:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 143 states have internal predecessors, (169), 28 states have call successors, (28), 11 states have call predecessors, (28), 17 states have return successors, (42), 26 states have call predecessors, (42), 26 states have call successors, (42) [2025-03-08 18:12:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 239 transitions. [2025-03-08 18:12:07,145 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 239 transitions. Word has length 76 [2025-03-08 18:12:07,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:07,146 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 239 transitions. [2025-03-08 18:12:07,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 18:12:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 239 transitions. [2025-03-08 18:12:07,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 18:12:07,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:07,149 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:12:07,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 18:12:07,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:07,349 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:07,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:07,350 INFO L85 PathProgramCache]: Analyzing trace with hash 627650168, now seen corresponding path program 1 times [2025-03-08 18:12:07,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:07,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74469309] [2025-03-08 18:12:07,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:07,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:07,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 18:12:07,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 18:12:07,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:07,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 18:12:07,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:07,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74469309] [2025-03-08 18:12:07,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74469309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:07,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862179302] [2025-03-08 18:12:07,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:07,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:07,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:07,498 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:07,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 18:12:07,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 18:12:07,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 18:12:07,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:07,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:07,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 18:12:07,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:07,692 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 24 treesize of output 9 [2025-03-08 18:12:07,696 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 18 treesize of output 19 [2025-03-08 18:12:07,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:07,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:07,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-03-08 18:12:07,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:07,734 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 27 treesize of output 20 [2025-03-08 18:12:07,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:07,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-08 18:12:07,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:07,745 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 18 treesize of output 13 [2025-03-08 18:12:07,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:07,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:07,773 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 47 treesize of output 42 [2025-03-08 18:12:07,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-03-08 18:12:07,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:07,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:07,785 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 38 treesize of output 35 [2025-03-08 18:12:07,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-03-08 18:12:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:12:08,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:12:08,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_751 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_751))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_752 Int) (v_ArrVal_753 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_753))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_752))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-03-08 18:12:08,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)) (forall ((v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_749)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_ArrVal_751))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| 1)) (forall ((v_ArrVal_752 Int) (v_ArrVal_746 Int) (v_ArrVal_753 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_746)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_18| v_ArrVal_753))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_752))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2025-03-08 18:12:08,240 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:08,241 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:08,290 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:12:08,290 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 297 treesize of output 284 [2025-03-08 18:12:08,298 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:08,298 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 18:12:08,342 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-08 18:12:08,342 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 327 treesize of output 314 [2025-03-08 18:12:08,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:12:08,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 250 treesize of output 250 [2025-03-08 18:12:08,365 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 217 treesize of output 205 [2025-03-08 18:12:08,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:12:08,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 306 treesize of output 304 [2025-03-08 18:12:08,403 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 263 treesize of output 251 [2025-03-08 18:12:08,420 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 8 treesize of output 4 [2025-03-08 18:12:08,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:12:08,839 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 99 treesize of output 101 [2025-03-08 18:12:08,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 18:12:08,866 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 38 treesize of output 38 [2025-03-08 18:12:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2025-03-08 18:12:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862179302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:12:08,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:12:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2025-03-08 18:12:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690096683] [2025-03-08 18:12:08,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:12:08,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 18:12:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:08,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 18:12:08,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=292, Unknown=2, NotChecked=70, Total=420 [2025-03-08 18:12:08,908 INFO L87 Difference]: Start difference. First operand 181 states and 239 transitions. Second operand has 21 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2025-03-08 18:12:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:09,622 INFO L93 Difference]: Finished difference Result 361 states and 476 transitions. [2025-03-08 18:12:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 18:12:09,622 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) Word has length 77 [2025-03-08 18:12:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:09,624 INFO L225 Difference]: With dead ends: 361 [2025-03-08 18:12:09,624 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 18:12:09,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=748, Unknown=2, NotChecked=114, Total=992 [2025-03-08 18:12:09,627 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 85 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:09,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 920 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 449 Invalid, 0 Unknown, 277 Unchecked, 0.4s Time] [2025-03-08 18:12:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 18:12:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2025-03-08 18:12:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 142 states have (on average 1.2464788732394365) internal successors, (177), 153 states have internal predecessors, (177), 28 states have call successors, (28), 12 states have call predecessors, (28), 21 states have return successors, (47), 26 states have call predecessors, (47), 26 states have call successors, (47) [2025-03-08 18:12:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 252 transitions. [2025-03-08 18:12:09,649 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 252 transitions. Word has length 77 [2025-03-08 18:12:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:09,649 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 252 transitions. [2025-03-08 18:12:09,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.4) internal successors, (88), 19 states have internal predecessors, (88), 7 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2025-03-08 18:12:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 252 transitions. [2025-03-08 18:12:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 18:12:09,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:09,653 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 18:12:09,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 18:12:09,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 18:12:09,853 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:09,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:09,854 INFO L85 PathProgramCache]: Analyzing trace with hash 679647791, now seen corresponding path program 1 times [2025-03-08 18:12:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:09,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157824866] [2025-03-08 18:12:09,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:09,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:09,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:12:09,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:12:09,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:09,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 18:12:10,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:10,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157824866] [2025-03-08 18:12:10,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157824866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:10,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512089454] [2025-03-08 18:12:10,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:10,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:10,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:10,056 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:10,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 18:12:10,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 18:12:10,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 18:12:10,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:10,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:10,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-08 18:12:10,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:10,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 18:12:10,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:10,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 18:12:10,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 18:12:10,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:10,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 18:12:10,405 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-03-08 18:12:10,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 105 [2025-03-08 18:12:10,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:10,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:10,412 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 25 [2025-03-08 18:12:10,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2025-03-08 18:12:10,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2025-03-08 18:12:10,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:10,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2025-03-08 18:12:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 18:12:11,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:12:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 18:12:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512089454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:12:16,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:12:16,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 25, 12] total 39 [2025-03-08 18:12:16,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10258303] [2025-03-08 18:12:16,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:12:16,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-08 18:12:16,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:16,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-08 18:12:16,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1345, Unknown=1, NotChecked=0, Total=1482 [2025-03-08 18:12:16,441 INFO L87 Difference]: Start difference. First operand 192 states and 252 transitions. Second operand has 39 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 33 states have internal predecessors, (127), 11 states have call successors, (23), 4 states have call predecessors, (23), 12 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23) [2025-03-08 18:12:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:21,524 INFO L93 Difference]: Finished difference Result 1109 states and 1574 transitions. [2025-03-08 18:12:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2025-03-08 18:12:21,525 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 33 states have internal predecessors, (127), 11 states have call successors, (23), 4 states have call predecessors, (23), 12 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23) Word has length 89 [2025-03-08 18:12:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:21,534 INFO L225 Difference]: With dead ends: 1109 [2025-03-08 18:12:21,534 INFO L226 Difference]: Without dead ends: 739 [2025-03-08 18:12:21,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5329 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1911, Invalid=14858, Unknown=1, NotChecked=0, Total=16770 [2025-03-08 18:12:21,540 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 444 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:21,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 2046 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 18:12:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-08 18:12:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 540. [2025-03-08 18:12:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 419 states have (on average 1.3007159904534606) internal successors, (545), 452 states have internal predecessors, (545), 65 states have call successors, (65), 25 states have call predecessors, (65), 55 states have return successors, (144), 62 states have call predecessors, (144), 61 states have call successors, (144) [2025-03-08 18:12:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 754 transitions. [2025-03-08 18:12:21,648 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 754 transitions. Word has length 89 [2025-03-08 18:12:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:21,648 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 754 transitions. [2025-03-08 18:12:21,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 3.6285714285714286) internal successors, (127), 33 states have internal predecessors, (127), 11 states have call successors, (23), 4 states have call predecessors, (23), 12 states have return successors, (23), 9 states have call predecessors, (23), 11 states have call successors, (23) [2025-03-08 18:12:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 754 transitions. [2025-03-08 18:12:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 18:12:21,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:21,654 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 18:12:21,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 18:12:21,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 18:12:21,854 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:21,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:21,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1302745082, now seen corresponding path program 1 times [2025-03-08 18:12:21,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:21,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126396241] [2025-03-08 18:12:21,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:21,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:21,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:12:21,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:12:21,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:21,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 18:12:21,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:21,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126396241] [2025-03-08 18:12:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126396241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:21,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642320836] [2025-03-08 18:12:21,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:21,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:21,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:21,953 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:21,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 18:12:22,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:12:22,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:12:22,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:22,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:22,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 18:12:22,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 18:12:22,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:22,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642320836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:22,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:22,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-08 18:12:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560319276] [2025-03-08 18:12:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:22,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:12:22,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:22,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:12:22,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:12:22,141 INFO L87 Difference]: Start difference. First operand 540 states and 754 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:12:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:22,190 INFO L93 Difference]: Finished difference Result 952 states and 1375 transitions. [2025-03-08 18:12:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:12:22,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2025-03-08 18:12:22,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:22,197 INFO L225 Difference]: With dead ends: 952 [2025-03-08 18:12:22,197 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 18:12:22,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:12:22,202 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:22,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:12:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 18:12:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2025-03-08 18:12:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 337 states have (on average 1.2729970326409497) internal successors, (429), 364 states have internal predecessors, (429), 52 states have call successors, (52), 20 states have call predecessors, (52), 44 states have return successors, (115), 49 states have call predecessors, (115), 49 states have call successors, (115) [2025-03-08 18:12:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 596 transitions. [2025-03-08 18:12:22,276 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 596 transitions. Word has length 101 [2025-03-08 18:12:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:22,276 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 596 transitions. [2025-03-08 18:12:22,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:12:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 596 transitions. [2025-03-08 18:12:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 18:12:22,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:22,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 18:12:22,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 18:12:22,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 18:12:22,484 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:22,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:22,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1518792644, now seen corresponding path program 1 times [2025-03-08 18:12:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:22,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029918949] [2025-03-08 18:12:22,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:22,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:12:22,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:12:22,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:22,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-08 18:12:22,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:22,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029918949] [2025-03-08 18:12:22,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029918949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:22,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668050002] [2025-03-08 18:12:22,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:22,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:22,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:22,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:22,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 18:12:22,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 18:12:22,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 18:12:22,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:22,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:22,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 18:12:22,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:22,752 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 18:12:22,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:22,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668050002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:22,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:22,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-08 18:12:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619223495] [2025-03-08 18:12:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:22,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 18:12:22,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:22,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 18:12:22,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:12:22,753 INFO L87 Difference]: Start difference. First operand 434 states and 596 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:12:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:22,824 INFO L93 Difference]: Finished difference Result 778 states and 1104 transitions. [2025-03-08 18:12:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 18:12:22,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2025-03-08 18:12:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:22,828 INFO L225 Difference]: With dead ends: 778 [2025-03-08 18:12:22,828 INFO L226 Difference]: Without dead ends: 369 [2025-03-08 18:12:22,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 18:12:22,849 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:22,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 226 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 18:12:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-08 18:12:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 343. [2025-03-08 18:12:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 261 states have (on average 1.1992337164750957) internal successors, (313), 278 states have internal predecessors, (313), 47 states have call successors, (47), 20 states have call predecessors, (47), 34 states have return successors, (72), 44 states have call predecessors, (72), 44 states have call successors, (72) [2025-03-08 18:12:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 432 transitions. [2025-03-08 18:12:22,895 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 432 transitions. Word has length 101 [2025-03-08 18:12:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:22,895 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 432 transitions. [2025-03-08 18:12:22,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 18:12:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 432 transitions. [2025-03-08 18:12:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 18:12:22,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:22,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-08 18:12:22,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 18:12:23,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 18:12:23,097 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:23,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash -821913380, now seen corresponding path program 1 times [2025-03-08 18:12:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:23,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95315394] [2025-03-08 18:12:23,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:23,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 18:12:23,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 18:12:23,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:23,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 18:12:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95315394] [2025-03-08 18:12:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95315394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666507551] [2025-03-08 18:12:23,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:23,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:23,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:23,350 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:23,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 18:12:23,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 18:12:23,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 18:12:23,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:23,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:23,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 18:12:23,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 18:12:23,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:23,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666507551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:23,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:23,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-08 18:12:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721934542] [2025-03-08 18:12:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:23,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 18:12:23,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:23,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 18:12:23,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 18:12:23,629 INFO L87 Difference]: Start difference. First operand 343 states and 432 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 18:12:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:23,762 INFO L93 Difference]: Finished difference Result 682 states and 839 transitions. [2025-03-08 18:12:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 18:12:23,762 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 102 [2025-03-08 18:12:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:23,764 INFO L225 Difference]: With dead ends: 682 [2025-03-08 18:12:23,764 INFO L226 Difference]: Without dead ends: 248 [2025-03-08 18:12:23,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-08 18:12:23,766 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:23,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 345 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 18:12:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-08 18:12:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-03-08 18:12:23,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 179 states have (on average 1.1620111731843576) internal successors, (208), 189 states have internal predecessors, (208), 42 states have call successors, (42), 19 states have call predecessors, (42), 26 states have return successors, (53), 39 states have call predecessors, (53), 39 states have call successors, (53) [2025-03-08 18:12:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 303 transitions. [2025-03-08 18:12:23,789 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 303 transitions. Word has length 102 [2025-03-08 18:12:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:23,789 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 303 transitions. [2025-03-08 18:12:23,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 18:12:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 303 transitions. [2025-03-08 18:12:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 18:12:23,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:23,791 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-08 18:12:23,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 18:12:23,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 18:12:23,991 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:23,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash -352440447, now seen corresponding path program 1 times [2025-03-08 18:12:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183672486] [2025-03-08 18:12:23,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:24,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 18:12:24,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 18:12:24,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:24,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 18:12:24,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:24,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183672486] [2025-03-08 18:12:24,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183672486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:24,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69552277] [2025-03-08 18:12:24,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:24,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:24,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:24,303 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:24,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 18:12:24,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 18:12:24,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 18:12:24,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:24,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:24,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-08 18:12:24,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:24,519 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-03-08 18:12:24,521 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-03-08 18:12:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 18:12:24,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 18:12:24,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69552277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 18:12:24,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 18:12:24,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [8] total 26 [2025-03-08 18:12:24,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258323968] [2025-03-08 18:12:24,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 18:12:24,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 18:12:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:24,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 18:12:24,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2025-03-08 18:12:24,966 INFO L87 Difference]: Start difference. First operand 248 states and 303 transitions. Second operand has 20 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 7 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 18:12:28,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:33,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:37,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:38,101 INFO L93 Difference]: Finished difference Result 674 states and 815 transitions. [2025-03-08 18:12:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 18:12:38,102 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 7 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) Word has length 103 [2025-03-08 18:12:38,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:38,104 INFO L225 Difference]: With dead ends: 674 [2025-03-08 18:12:38,104 INFO L226 Difference]: Without dead ends: 512 [2025-03-08 18:12:38,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 18:12:38,105 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 101 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 31 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:38,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1267 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 933 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2025-03-08 18:12:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-08 18:12:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 419. [2025-03-08 18:12:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 311 states have (on average 1.1864951768488745) internal successors, (369), 327 states have internal predecessors, (369), 63 states have call successors, (63), 31 states have call predecessors, (63), 44 states have return successors, (83), 60 states have call predecessors, (83), 57 states have call successors, (83) [2025-03-08 18:12:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 515 transitions. [2025-03-08 18:12:38,153 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 515 transitions. Word has length 103 [2025-03-08 18:12:38,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:38,154 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 515 transitions. [2025-03-08 18:12:38,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 7 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10) [2025-03-08 18:12:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 515 transitions. [2025-03-08 18:12:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 18:12:38,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:38,157 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 18:12:38,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 18:12:38,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 18:12:38,358 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:38,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:38,358 INFO L85 PathProgramCache]: Analyzing trace with hash -22674686, now seen corresponding path program 1 times [2025-03-08 18:12:38,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311612978] [2025-03-08 18:12:38,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:38,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 18:12:38,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 18:12:38,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:38,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 18:12:38,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311612978] [2025-03-08 18:12:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311612978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911696602] [2025-03-08 18:12:38,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:38,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:38,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:38,599 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:38,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 18:12:38,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 18:12:38,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 18:12:38,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:38,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:38,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 18:12:38,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:38,840 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-03-08 18:12:38,843 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-03-08 18:12:42,968 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_3|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_3|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_3|) 0)))) is different from true [2025-03-08 18:12:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 18:12:43,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 18:12:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 18:12:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911696602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 18:12:43,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 18:12:43,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 11] total 30 [2025-03-08 18:12:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039109523] [2025-03-08 18:12:43,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 18:12:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 18:12:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 18:12:43,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 18:12:43,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=722, Unknown=1, NotChecked=54, Total=870 [2025-03-08 18:12:43,665 INFO L87 Difference]: Start difference. First operand 419 states and 515 transitions. Second operand has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 30 states have internal predecessors, (129), 9 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (25), 8 states have call predecessors, (25), 9 states have call successors, (25) [2025-03-08 18:12:47,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:51,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:55,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 18:12:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 18:12:56,673 INFO L93 Difference]: Finished difference Result 1055 states and 1306 transitions. [2025-03-08 18:12:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 18:12:56,674 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 30 states have internal predecessors, (129), 9 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (25), 8 states have call predecessors, (25), 9 states have call successors, (25) Word has length 103 [2025-03-08 18:12:56,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 18:12:56,677 INFO L225 Difference]: With dead ends: 1055 [2025-03-08 18:12:56,677 INFO L226 Difference]: Without dead ends: 588 [2025-03-08 18:12:56,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 183 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=350, Invalid=2203, Unknown=1, NotChecked=98, Total=2652 [2025-03-08 18:12:56,681 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 156 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 38 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-03-08 18:12:56,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1262 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 979 Invalid, 3 Unknown, 413 Unchecked, 12.5s Time] [2025-03-08 18:12:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-08 18:12:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 510. [2025-03-08 18:12:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 393 states have (on average 1.193384223918575) internal successors, (469), 404 states have internal predecessors, (469), 68 states have call successors, (68), 37 states have call predecessors, (68), 48 states have return successors, (84), 68 states have call predecessors, (84), 62 states have call successors, (84) [2025-03-08 18:12:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 621 transitions. [2025-03-08 18:12:56,742 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 621 transitions. Word has length 103 [2025-03-08 18:12:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 18:12:56,742 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 621 transitions. [2025-03-08 18:12:56,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.448275862068965) internal successors, (129), 30 states have internal predecessors, (129), 9 states have call successors, (25), 4 states have call predecessors, (25), 7 states have return successors, (25), 8 states have call predecessors, (25), 9 states have call successors, (25) [2025-03-08 18:12:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 621 transitions. [2025-03-08 18:12:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 18:12:56,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 18:12:56,743 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 18:12:56,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 18:12:56,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:56,944 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 18:12:56,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 18:12:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1245319668, now seen corresponding path program 1 times [2025-03-08 18:12:56,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 18:12:56,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799888906] [2025-03-08 18:12:56,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 18:12:56,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 18:12:56,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 18:12:56,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:56,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 18:12:57,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 18:12:57,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799888906] [2025-03-08 18:12:57,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799888906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 18:12:57,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647872474] [2025-03-08 18:12:57,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 18:12:57,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 18:12:57,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 18:12:57,550 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 18:12:57,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 18:12:57,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 18:12:57,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 18:12:57,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 18:12:57,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 18:12:57,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-08 18:12:57,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 18:12:57,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-08 18:12:57,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:57,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-08 18:12:57,917 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-03-08 18:12:57,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 97 [2025-03-08 18:12:57,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 67 [2025-03-08 18:12:57,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 18:12:57,929 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 21 treesize of output 1