./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 798a7b37 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-?-798a7b3-m [2025-03-04 02:59:57,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:59:57,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:59:57,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:59:57,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:59:57,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:59:57,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:59:57,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:59:57,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:59:57,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:59:57,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:59:57,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:59:57,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:59:57,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:59:57,301 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:59:57,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:59:57,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:59:57,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:59:57,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:59:57,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:59:57,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:59:57,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:59:57,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:59:57,302 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:59:57,302 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:59:57,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:59:57,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:59:57,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:59:57,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:59:57,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:59:57,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:59:57,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:59:57,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:59:57,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:59:57,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:59:57,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:59:57,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:59:57,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:59:57,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:59:57,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:59:57,304 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-04 02:59:57,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:59:57,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:59:57,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:59:57,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:59:57,532 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:59:57,533 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-04 02:59:58,673 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4003e48d7/4f1b7e5f51394f0d9ff34968275fe488/FLAG8f722601b [2025-03-04 02:59:59,072 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:59:59,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i [2025-03-04 02:59:59,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4003e48d7/4f1b7e5f51394f0d9ff34968275fe488/FLAG8f722601b [2025-03-04 02:59:59,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4003e48d7/4f1b7e5f51394f0d9ff34968275fe488 [2025-03-04 02:59:59,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:59:59,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:59:59,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:59:59,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:59:59,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:59:59,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:59" (1/1) ... [2025-03-04 02:59:59,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@169ff655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:59:59, skipping insertion in model container [2025-03-04 02:59:59,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:59:59" (1/1) ... [2025-03-04 02:59:59,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:59:59,486 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-04 02:59:59,491 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-04 02:59:59,861 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,862 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,862 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,863 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,863 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,871 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,871 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,873 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,873 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,874 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,875 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,875 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:59:59,875 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,164 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-04 03:00:00,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:00:00,182 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:00:00,196 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-04 03:00:00,197 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-04 03:00:00,240 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,244 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,244 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,244 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,245 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,256 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,257 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,258 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,259 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,260 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,261 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,262 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,262 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 03:00:00,363 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-04 03:00:00,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:00:00,481 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:00:00,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00 WrapperNode [2025-03-04 03:00:00,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:00:00,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:00:00,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:00:00,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:00:00,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,548 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 131 [2025-03-04 03:00:00,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:00:00,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:00:00,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:00:00,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:00:00,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,570 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-04 03:00:00,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,578 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:00:00,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:00:00,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:00:00,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:00:00,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (1/1) ... [2025-03-04 03:00:00,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:00:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:00,622 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-04 03:00:00,626 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-04 03:00:00,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:00:00,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 03:00:00,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 03:00:00,644 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 03:00:00,644 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 03:00:00,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:00:00,644 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 03:00:00,644 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 03:00:00,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:00:00,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:00:00,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:00:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:00:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:00:00,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:00:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 03:00:00,645 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 03:00:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:00:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:00:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:00:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:00:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:00:00,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:00:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:00:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-04 03:00:00,646 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-04 03:00:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:00:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:00:00,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:00:00,810 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:00:00,812 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:00:00,848 INFO L1325 $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-04 03:00:00,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-04 03:00:00,991 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 03:00:01,006 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-03-04 03:00:01,009 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:00:01,015 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:00:01,015 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:00:01,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:00:01 BoogieIcfgContainer [2025-03-04 03:00:01,016 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:00:01,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:00:01,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:00:01,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:00:01,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:59:59" (1/3) ... [2025-03-04 03:00:01,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2500ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:00:01, skipping insertion in model container [2025-03-04 03:00:01,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:00" (2/3) ... [2025-03-04 03:00:01,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2500ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:00:01, skipping insertion in model container [2025-03-04 03:00:01,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:00:01" (3/3) ... [2025-03-04 03:00:01,023 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness_negated.i [2025-03-04 03:00:01,033 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:00:01,035 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-04 03:00:01,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:00:01,081 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;@718bf6ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:00:01,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:00:01,084 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-04 03:00:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 03:00:01,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:01,093 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-04 03:00:01,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:01,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1130872929, now seen corresponding path program 1 times [2025-03-04 03:00:01,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:01,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004247057] [2025-03-04 03:00:01,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:01,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:01,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:01,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:01,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:01,376 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-04 03:00:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004247057] [2025-03-04 03:00:01,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004247057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:01,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100434748] [2025-03-04 03:00:01,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:01,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:01,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:01,379 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-04 03:00:01,381 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-04 03:00:01,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:01,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:01,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:01,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:01,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 03:00:01,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:01,537 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-04 03:00:01,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100434748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:01,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:01,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 03:00:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299392224] [2025-03-04 03:00:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:01,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 03:00:01,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:01,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 03:00:01,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 03:00:01,555 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-04 03:00:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:01,569 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2025-03-04 03:00:01,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 03:00:01,571 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-04 03:00:01,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:01,578 INFO L225 Difference]: With dead ends: 126 [2025-03-04 03:00:01,578 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 03:00:01,580 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-04 03:00:01,584 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-04 03:00:01,585 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-04 03:00:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 03:00:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 03:00:01,605 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-04 03:00:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2025-03-04 03:00:01,609 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 70 [2025-03-04 03:00:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:01,610 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2025-03-04 03:00:01,610 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-04 03:00:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2025-03-04 03:00:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 03:00:01,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:01,612 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-04 03:00:01,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:01,813 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-04 03:00:01,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:01,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:01,813 INFO L85 PathProgramCache]: Analyzing trace with hash -624638336, now seen corresponding path program 1 times [2025-03-04 03:00:01,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:01,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401153951] [2025-03-04 03:00:01,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:01,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 03:00:01,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 03:00:01,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:01,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:02,391 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-04 03:00:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401153951] [2025-03-04 03:00:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401153951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:02,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:00:02,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:00:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268977016] [2025-03-04 03:00:02,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:02,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:00:02,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:02,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:00:02,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:00:02,393 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-04 03:00:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:02,444 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2025-03-04 03:00:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:00:02,445 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-04 03:00:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:02,447 INFO L225 Difference]: With dead ends: 72 [2025-03-04 03:00:02,447 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 03:00:02,447 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-04 03:00:02,448 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-04 03:00:02,448 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-04 03:00:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 03:00:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-04 03:00:02,462 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-04 03:00:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-03-04 03:00:02,465 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2025-03-04 03:00:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:02,465 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-04 03:00:02,466 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-04 03:00:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-03-04 03:00:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-04 03:00:02,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:02,467 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-04 03:00:02,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:00:02,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:02,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 511756480, now seen corresponding path program 1 times [2025-03-04 03:00:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:02,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3423457] [2025-03-04 03:00:02,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:02,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 03:00:02,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 03:00:02,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:02,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:02,704 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-04 03:00:02,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3423457] [2025-03-04 03:00:02,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3423457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:02,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:00:02,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:00:02,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462777354] [2025-03-04 03:00:02,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:02,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:00:02,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:02,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:00:02,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:00:02,706 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-04 03:00:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:02,812 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2025-03-04 03:00:02,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:00:02,812 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-04 03:00:02,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:02,813 INFO L225 Difference]: With dead ends: 131 [2025-03-04 03:00:02,813 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 03:00:02,814 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-04 03:00:02,814 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-04 03:00:02,814 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-04 03:00:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 03:00:02,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-03-04 03:00:02,823 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-04 03:00:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-04 03:00:02,824 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 71 [2025-03-04 03:00:02,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:02,824 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-04 03:00:02,824 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-04 03:00:02,824 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-04 03:00:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 03:00:02,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:02,827 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-04 03:00:02,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:00:02,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:02,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:02,828 INFO L85 PathProgramCache]: Analyzing trace with hash 211973896, now seen corresponding path program 1 times [2025-03-04 03:00:02,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:02,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922787959] [2025-03-04 03:00:02,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:02,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:02,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 03:00:02,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 03:00:02,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:02,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:03,045 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-04 03:00:03,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:03,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922787959] [2025-03-04 03:00:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922787959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:03,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:00:03,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 03:00:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608794786] [2025-03-04 03:00:03,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:03,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:00:03,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:03,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:00:03,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:00:03,048 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-04 03:00:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:03,169 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2025-03-04 03:00:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:00:03,170 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-04 03:00:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:03,171 INFO L225 Difference]: With dead ends: 137 [2025-03-04 03:00:03,171 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 03:00:03,172 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-04 03:00:03,173 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-04 03:00:03,175 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-04 03:00:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 03:00:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2025-03-04 03:00:03,184 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-04 03:00:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-04 03:00:03,186 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 73 [2025-03-04 03:00:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:03,187 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-04 03:00:03,187 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-04 03:00:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-04 03:00:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 03:00:03,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:03,191 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-04 03:00:03,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:00:03,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:03,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash -626301941, now seen corresponding path program 1 times [2025-03-04 03:00:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:03,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147811839] [2025-03-04 03:00:03,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:03,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:03,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 03:00:03,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 03:00:03,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:03,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:03,466 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-04 03:00:03,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:03,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147811839] [2025-03-04 03:00:03,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147811839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:03,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:00:03,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 03:00:03,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651284776] [2025-03-04 03:00:03,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:03,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 03:00:03,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:03,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 03:00:03,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 03:00:03,468 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-04 03:00:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:03,577 INFO L93 Difference]: Finished difference Result 138 states and 182 transitions. [2025-03-04 03:00:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 03:00:03,578 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-04 03:00:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:03,579 INFO L225 Difference]: With dead ends: 138 [2025-03-04 03:00:03,579 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 03:00:03,579 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-04 03:00:03,580 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-04 03:00:03,580 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-04 03:00:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 03:00:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2025-03-04 03:00:03,592 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-04 03:00:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2025-03-04 03:00:03,593 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 74 [2025-03-04 03:00:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:03,594 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2025-03-04 03:00:03,594 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-04 03:00:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2025-03-04 03:00:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 03:00:03,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:03,596 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-04 03:00:03,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:00:03,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:03,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash -514954486, now seen corresponding path program 1 times [2025-03-04 03:00:03,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:03,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287204679] [2025-03-04 03:00:03,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:03,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:03,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 03:00:03,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 03:00:03,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:03,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:03,879 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-04 03:00:03,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287204679] [2025-03-04 03:00:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287204679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526711462] [2025-03-04 03:00:03,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:03,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:03,883 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-04 03:00:03,885 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-04 03:00:03,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 03:00:04,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 03:00:04,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:04,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:04,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 03:00:04,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:04,119 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-04 03:00:04,135 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-04 03:00:04,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:04,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:04,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:04,187 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-04 03:00:04,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:04,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:04,201 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-04 03:00:04,787 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-04 03:00:04,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:04,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526711462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:04,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:04,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2025-03-04 03:00:04,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649188734] [2025-03-04 03:00:04,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:04,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 03:00:04,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:04,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 03:00:04,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 03:00:04,790 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-04 03:00:05,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:05,238 INFO L93 Difference]: Finished difference Result 196 states and 258 transitions. [2025-03-04 03:00:05,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 03:00:05,239 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-04 03:00:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:05,240 INFO L225 Difference]: With dead ends: 196 [2025-03-04 03:00:05,240 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 03:00:05,241 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-04 03:00:05,241 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-04 03:00:05,241 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-04 03:00:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 03:00:05,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2025-03-04 03:00:05,265 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-04 03:00:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 179 transitions. [2025-03-04 03:00:05,267 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 179 transitions. Word has length 82 [2025-03-04 03:00:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:05,268 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 179 transitions. [2025-03-04 03:00:05,268 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-04 03:00:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 179 transitions. [2025-03-04 03:00:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 03:00:05,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:05,270 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-04 03:00:05,279 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-04 03:00:05,471 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-04 03:00:05,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:05,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:05,471 INFO L85 PathProgramCache]: Analyzing trace with hash -234604597, now seen corresponding path program 1 times [2025-03-04 03:00:05,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:05,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701000627] [2025-03-04 03:00:05,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:05,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 03:00:05,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 03:00:05,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:05,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:05,722 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-04 03:00:05,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:05,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701000627] [2025-03-04 03:00:05,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701000627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:05,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186014929] [2025-03-04 03:00:05,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:05,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:05,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:05,725 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-04 03:00:05,726 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-04 03:00:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 03:00:05,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 03:00:05,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:05,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:05,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-04 03:00:05,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:05,917 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-04 03:00:05,925 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-04 03:00:05,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:05,964 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-04 03:00:05,975 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-04 03:00:06,796 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-04 03:00:06,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:06,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186014929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:06,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:06,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-04 03:00:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824881485] [2025-03-04 03:00:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:06,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 03:00:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:06,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 03:00:06,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 03:00:06,798 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-04 03:00:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:07,272 INFO L93 Difference]: Finished difference Result 197 states and 255 transitions. [2025-03-04 03:00:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 03:00:07,272 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-04 03:00:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:07,273 INFO L225 Difference]: With dead ends: 197 [2025-03-04 03:00:07,275 INFO L226 Difference]: Without dead ends: 134 [2025-03-04 03:00:07,276 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-04 03:00:07,276 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-04 03:00:07,276 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-04 03:00:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-04 03:00:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-03-04 03:00:07,301 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-04 03:00:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 174 transitions. [2025-03-04 03:00:07,305 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 174 transitions. Word has length 82 [2025-03-04 03:00:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:07,305 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 174 transitions. [2025-03-04 03:00:07,305 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-04 03:00:07,305 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 174 transitions. [2025-03-04 03:00:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 03:00:07,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:07,307 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-04 03:00:07,315 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-04 03:00:07,508 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-04 03:00:07,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:07,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:07,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1226975402, now seen corresponding path program 2 times [2025-03-04 03:00:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275101375] [2025-03-04 03:00:07,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:00:07,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:07,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 82 statements into 2 equivalence classes. [2025-03-04 03:00:07,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 82 statements. [2025-03-04 03:00:07,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 03:00:07,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:07,711 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-04 03:00:07,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275101375] [2025-03-04 03:00:07,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275101375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:07,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:00:07,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:00:07,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057349972] [2025-03-04 03:00:07,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:07,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:00:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:07,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:00:07,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:00:07,712 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-04 03:00:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:07,756 INFO L93 Difference]: Finished difference Result 152 states and 201 transitions. [2025-03-04 03:00:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:00:07,756 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-04 03:00:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:07,757 INFO L225 Difference]: With dead ends: 152 [2025-03-04 03:00:07,757 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 03:00:07,757 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-04 03:00:07,758 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-04 03:00:07,758 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-04 03:00:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 03:00:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 134. [2025-03-04 03:00:07,778 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-04 03:00:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 176 transitions. [2025-03-04 03:00:07,780 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 176 transitions. Word has length 82 [2025-03-04 03:00:07,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:07,780 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 176 transitions. [2025-03-04 03:00:07,780 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-04 03:00:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2025-03-04 03:00:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 03:00:07,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:07,781 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-04 03:00:07,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:00:07,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:07,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:07,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1105108659, now seen corresponding path program 1 times [2025-03-04 03:00:07,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:07,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097240932] [2025-03-04 03:00:07,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:07,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:07,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 03:00:07,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 03:00:07,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:07,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:07,963 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-04 03:00:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097240932] [2025-03-04 03:00:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097240932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880531235] [2025-03-04 03:00:07,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:07,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:07,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:07,965 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-04 03:00:07,967 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-04 03:00:08,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 03:00:08,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 03:00:08,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:08,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:08,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 03:00:08,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:08,189 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2025-03-04 03:00:08,189 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-04 03:00:08,194 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-04 03:00:08,217 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:08,218 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-04 03:00:08,245 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:08,245 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-04 03:00:08,248 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-04 03:00:08,304 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-04 03:00:08,559 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-04 03:00:10,337 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-04 03:00:11,621 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-04 03:00:11,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:11,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:11,913 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-04 03:00:11,920 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-04 03:00:11,949 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-04 03:00:12,136 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-04 03:00:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880531235] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:12,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 03:00:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 20] total 33 [2025-03-04 03:00:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338030458] [2025-03-04 03:00:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:12,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 03:00:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:12,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 03:00:12,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=746, Unknown=32, NotChecked=174, Total=1056 [2025-03-04 03:00:12,137 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-04 03:00:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:12,545 INFO L93 Difference]: Finished difference Result 235 states and 324 transitions. [2025-03-04 03:00:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 03:00:12,546 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-04 03:00:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:12,547 INFO L225 Difference]: With dead ends: 235 [2025-03-04 03:00:12,547 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 03:00:12,550 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-04 03:00:12,550 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-04 03:00:12,550 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-04 03:00:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 03:00:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2025-03-04 03:00:12,569 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-04 03:00:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2025-03-04 03:00:12,572 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 76 [2025-03-04 03:00:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:12,573 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2025-03-04 03:00:12,573 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-04 03:00:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2025-03-04 03:00:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 03:00:12,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:12,574 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-04 03:00:12,581 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-04 03:00:12,774 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-04 03:00:12,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:12,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:12,775 INFO L85 PathProgramCache]: Analyzing trace with hash 807144020, now seen corresponding path program 1 times [2025-03-04 03:00:12,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:12,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040824431] [2025-03-04 03:00:12,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:12,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:12,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 03:00:12,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 03:00:12,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:12,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:12,923 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-04 03:00:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:12,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040824431] [2025-03-04 03:00:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040824431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:12,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952033251] [2025-03-04 03:00:12,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:12,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:12,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:12,926 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-04 03:00:12,927 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-04 03:00:13,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 03:00:13,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 03:00:13,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:13,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:13,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-04 03:00:13,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:13,096 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-04 03:00:13,104 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-04 03:00:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:13,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:13,132 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-04 03:00:13,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:13,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:13,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:13,140 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-04 03:00:14,253 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-04 03:00:14,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952033251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-03-04 03:00:14,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504246678] [2025-03-04 03:00:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:14,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 03:00:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:14,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 03:00:14,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-04 03:00:14,254 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-04 03:00:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:14,892 INFO L93 Difference]: Finished difference Result 226 states and 303 transitions. [2025-03-04 03:00:14,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 03:00:14,893 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-04 03:00:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:14,895 INFO L225 Difference]: With dead ends: 226 [2025-03-04 03:00:14,895 INFO L226 Difference]: Without dead ends: 142 [2025-03-04 03:00:14,895 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-04 03:00:14,896 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-04 03:00:14,897 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-04 03:00:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-04 03:00:14,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2025-03-04 03:00:14,910 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-04 03:00:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2025-03-04 03:00:14,911 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 76 [2025-03-04 03:00:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:14,911 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2025-03-04 03:00:14,911 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-04 03:00:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2025-03-04 03:00:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 03:00:14,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:14,912 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-04 03:00:14,919 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-04 03:00:15,116 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-04 03:00:15,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:15,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2069032523, now seen corresponding path program 1 times [2025-03-04 03:00:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:15,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911767468] [2025-03-04 03:00:15,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:15,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 03:00:15,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 03:00:15,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:15,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:15,399 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-04 03:00:15,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911767468] [2025-03-04 03:00:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911767468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:15,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946875336] [2025-03-04 03:00:15,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:15,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:15,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:15,402 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-04 03:00:15,402 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-04 03:00:15,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 03:00:15,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 03:00:15,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:15,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:15,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 03:00:15,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:15,597 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-04 03:00:16,228 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-04 03:00:16,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946875336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:16,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:16,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2025-03-04 03:00:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497192569] [2025-03-04 03:00:16,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 03:00:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:16,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 03:00:16,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-04 03:00:16,229 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-04 03:00:20,235 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-04 03:00:24,274 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-04 03:00:28,329 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-04 03:00:32,355 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-04 03:00:36,364 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-04 03:00:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:36,784 INFO L93 Difference]: Finished difference Result 234 states and 312 transitions. [2025-03-04 03:00:36,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 03:00:36,784 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-04 03:00:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:36,785 INFO L225 Difference]: With dead ends: 234 [2025-03-04 03:00:36,785 INFO L226 Difference]: Without dead ends: 144 [2025-03-04 03:00:36,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-03-04 03:00:36,786 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-04 03:00:36,786 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-04 03:00:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-04 03:00:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2025-03-04 03:00:36,802 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-04 03:00:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2025-03-04 03:00:36,803 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 76 [2025-03-04 03:00:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:36,804 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2025-03-04 03:00:36,804 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-04 03:00:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2025-03-04 03:00:36,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 03:00:36,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:36,804 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-04 03:00:36,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 03:00:37,005 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-04 03:00:37,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:37,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:37,005 INFO L85 PathProgramCache]: Analyzing trace with hash -115751722, now seen corresponding path program 1 times [2025-03-04 03:00:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:37,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105290110] [2025-03-04 03:00:37,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:37,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 03:00:37,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 03:00:37,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:37,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:37,067 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-04 03:00:37,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105290110] [2025-03-04 03:00:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105290110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:37,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177963390] [2025-03-04 03:00:37,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:37,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:37,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:37,070 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-04 03:00:37,071 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-04 03:00:37,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 03:00:37,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 03:00:37,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:37,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:37,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 03:00:37,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:37,250 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-04 03:00:37,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:37,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177963390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:37,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:37,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-04 03:00:37,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887688509] [2025-03-04 03:00:37,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:37,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:00:37,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:37,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:00:37,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 03:00:37,251 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-04 03:00:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:37,354 INFO L93 Difference]: Finished difference Result 306 states and 407 transitions. [2025-03-04 03:00:37,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:00:37,354 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-04 03:00:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:37,355 INFO L225 Difference]: With dead ends: 306 [2025-03-04 03:00:37,355 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 03:00:37,356 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-04 03:00:37,356 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-04 03:00:37,356 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-04 03:00:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 03:00:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-04 03:00:37,373 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-04 03:00:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 239 transitions. [2025-03-04 03:00:37,374 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 239 transitions. Word has length 76 [2025-03-04 03:00:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:37,376 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 239 transitions. [2025-03-04 03:00:37,376 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-04 03:00:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 239 transitions. [2025-03-04 03:00:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 03:00:37,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:37,379 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-04 03:00:37,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 03:00:37,580 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-04 03:00:37,580 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:37,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 627650168, now seen corresponding path program 1 times [2025-03-04 03:00:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930027025] [2025-03-04 03:00:37,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:37,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 03:00:37,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 03:00:37,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:37,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:37,732 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-04 03:00:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:37,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930027025] [2025-03-04 03:00:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930027025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10513369] [2025-03-04 03:00:37,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:37,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:37,734 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-04 03:00:37,736 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-04 03:00:37,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 03:00:37,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 03:00:37,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:37,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:37,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 03:00:37,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:37,916 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-04 03:00:37,920 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-04 03:00:37,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:37,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:37,955 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-04 03:00:37,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:37,959 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-04 03:00:37,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:37,966 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-04 03:00:37,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:37,969 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-04 03:00:37,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:37,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:37,993 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-04 03:00:37,996 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-04 03:00:38,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:38,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:38,002 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-04 03:00:38,004 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-04 03:00:38,238 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-04 03:00:38,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:38,403 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-04 03:00:38,427 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-04 03:00:38,437 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:38,438 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:38,489 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 03:00:38,489 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-04 03:00:38,498 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:38,499 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 03:00:38,544 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-03-04 03:00:38,544 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-04 03:00:38,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:38,566 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-04 03:00:38,575 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-04 03:00:38,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:38,590 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-04 03:00:38,602 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-04 03:00:38,632 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-04 03:00:39,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:39,021 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-04 03:00:39,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 03:00:39,049 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-04 03:00:39,090 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-04 03:00:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10513369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:39,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2025-03-04 03:00:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380284914] [2025-03-04 03:00:39,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:39,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 03:00:39,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:39,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 03:00:39,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=292, Unknown=2, NotChecked=70, Total=420 [2025-03-04 03:00:39,091 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-04 03:00:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:39,773 INFO L93 Difference]: Finished difference Result 361 states and 476 transitions. [2025-03-04 03:00:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 03:00:39,773 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-04 03:00:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:39,774 INFO L225 Difference]: With dead ends: 361 [2025-03-04 03:00:39,774 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 03:00:39,775 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-04 03:00:39,775 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-04 03:00:39,776 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-04 03:00:39,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 03:00:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2025-03-04 03:00:39,798 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-04 03:00:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 252 transitions. [2025-03-04 03:00:39,800 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 252 transitions. Word has length 77 [2025-03-04 03:00:39,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:39,801 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 252 transitions. [2025-03-04 03:00:39,801 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-04 03:00:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 252 transitions. [2025-03-04 03:00:39,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 03:00:39,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:39,803 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-04 03:00:39,810 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-04 03:00:40,003 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-04 03:00:40,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:40,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash 679647791, now seen corresponding path program 1 times [2025-03-04 03:00:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:40,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87759714] [2025-03-04 03:00:40,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:40,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:40,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 03:00:40,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 03:00:40,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:40,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:40,250 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-04 03:00:40,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:40,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87759714] [2025-03-04 03:00:40,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87759714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:40,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375372645] [2025-03-04 03:00:40,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:40,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:40,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:40,253 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-04 03:00:40,255 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-04 03:00:40,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 03:00:40,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 03:00:40,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:40,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:40,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 117 conjuncts are in the unsatisfiable core [2025-03-04 03:00:40,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:40,484 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-04 03:00:40,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:40,487 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-04 03:00:40,492 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-04 03:00:40,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:40,495 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-04 03:00:40,526 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-03-04 03:00:40,527 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-04 03:00:40,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:40,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:40,533 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-04 03:00:40,535 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-04 03:00:40,542 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-04 03:00:40,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:00:40,548 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-04 03:00:41,917 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-04 03:00:41,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:00:46,577 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-04 03:00:46,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375372645] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:00:46,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:00:46,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 25, 12] total 39 [2025-03-04 03:00:46,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976029319] [2025-03-04 03:00:46,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:00:46,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 03:00:46,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:46,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 03:00:46,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1345, Unknown=1, NotChecked=0, Total=1482 [2025-03-04 03:00:46,579 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-04 03:00:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:51,530 INFO L93 Difference]: Finished difference Result 1109 states and 1574 transitions. [2025-03-04 03:00:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2025-03-04 03:00:51,531 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-04 03:00:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:51,540 INFO L225 Difference]: With dead ends: 1109 [2025-03-04 03:00:51,541 INFO L226 Difference]: Without dead ends: 739 [2025-03-04 03:00:51,549 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-04 03:00:51,550 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 444 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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-04 03:00:51,550 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-04 03:00:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-04 03:00:51,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 540. [2025-03-04 03:00:51,649 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-04 03:00:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 754 transitions. [2025-03-04 03:00:51,653 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 754 transitions. Word has length 89 [2025-03-04 03:00:51,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:51,653 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 754 transitions. [2025-03-04 03:00:51,653 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-04 03:00:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 754 transitions. [2025-03-04 03:00:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 03:00:51,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:51,659 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-04 03:00:51,667 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-04 03:00:51,860 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-04 03:00:51,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:51,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1302745082, now seen corresponding path program 1 times [2025-03-04 03:00:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736695311] [2025-03-04 03:00:51,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:51,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 03:00:51,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 03:00:51,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:51,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:51,927 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-04 03:00:51,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736695311] [2025-03-04 03:00:51,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736695311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:51,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649740192] [2025-03-04 03:00:51,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:51,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:51,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:51,930 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-04 03:00:51,932 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-04 03:00:52,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 03:00:52,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 03:00:52,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:52,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:52,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:00:52,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:52,113 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-04 03:00:52,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:52,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649740192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:52,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:52,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-04 03:00:52,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916828752] [2025-03-04 03:00:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:52,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:00:52,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:52,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:00:52,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:00:52,118 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-04 03:00:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:52,170 INFO L93 Difference]: Finished difference Result 952 states and 1375 transitions. [2025-03-04 03:00:52,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:00:52,171 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-04 03:00:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:52,175 INFO L225 Difference]: With dead ends: 952 [2025-03-04 03:00:52,175 INFO L226 Difference]: Without dead ends: 437 [2025-03-04 03:00:52,177 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-04 03:00:52,178 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-04 03:00:52,178 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-04 03:00:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-04 03:00:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2025-03-04 03:00:52,231 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-04 03:00:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 596 transitions. [2025-03-04 03:00:52,234 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 596 transitions. Word has length 101 [2025-03-04 03:00:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:52,235 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 596 transitions. [2025-03-04 03:00:52,235 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-04 03:00:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 596 transitions. [2025-03-04 03:00:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 03:00:52,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:52,237 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-04 03:00:52,245 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-04 03:00:52,438 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-04 03:00:52,438 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:52,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1518792644, now seen corresponding path program 1 times [2025-03-04 03:00:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:52,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814435885] [2025-03-04 03:00:52,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:52,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:52,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 03:00:52,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 03:00:52,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:52,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:52,518 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-04 03:00:52,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:52,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814435885] [2025-03-04 03:00:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814435885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:52,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087206465] [2025-03-04 03:00:52,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:52,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:52,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:52,521 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-04 03:00:52,522 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-04 03:00:52,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 03:00:52,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 03:00:52,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:52,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:52,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:00:52,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:52,712 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-04 03:00:52,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:52,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087206465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:52,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:52,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-04 03:00:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003820832] [2025-03-04 03:00:52,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:52,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:00:52,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:52,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:00:52,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:00:52,715 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-04 03:00:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:52,755 INFO L93 Difference]: Finished difference Result 778 states and 1104 transitions. [2025-03-04 03:00:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:00:52,755 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-04 03:00:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:52,757 INFO L225 Difference]: With dead ends: 778 [2025-03-04 03:00:52,757 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 03:00:52,759 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-04 03:00:52,760 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-04 03:00:52,761 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-04 03:00:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 03:00:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 343. [2025-03-04 03:00:52,818 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-04 03:00:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 432 transitions. [2025-03-04 03:00:52,821 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 432 transitions. Word has length 101 [2025-03-04 03:00:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:52,821 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 432 transitions. [2025-03-04 03:00:52,821 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-04 03:00:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 432 transitions. [2025-03-04 03:00:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 03:00:52,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:52,823 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-04 03:00:52,833 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-04 03:00:53,023 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-04 03:00:53,024 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:53,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash -821913380, now seen corresponding path program 1 times [2025-03-04 03:00:53,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:53,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926095679] [2025-03-04 03:00:53,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:53,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:53,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 03:00:53,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 03:00:53,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:53,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:53,250 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-04 03:00:53,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926095679] [2025-03-04 03:00:53,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926095679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:53,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20969458] [2025-03-04 03:00:53,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:53,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:53,252 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-04 03:00:53,254 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-04 03:00:53,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 03:00:53,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 03:00:53,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:53,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:53,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 03:00:53,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:53,507 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-04 03:00:53,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:53,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20969458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:53,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:53,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-04 03:00:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961208670] [2025-03-04 03:00:53,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:53,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:00:53,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:53,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:00:53,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 03:00:53,509 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-04 03:00:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:00:53,638 INFO L93 Difference]: Finished difference Result 682 states and 839 transitions. [2025-03-04 03:00:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:00:53,641 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-04 03:00:53,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:00:53,644 INFO L225 Difference]: With dead ends: 682 [2025-03-04 03:00:53,644 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 03:00:53,645 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-04 03:00:53,645 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-04 03:00:53,646 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-04 03:00:53,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 03:00:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-03-04 03:00:53,671 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-04 03:00:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 303 transitions. [2025-03-04 03:00:53,673 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 303 transitions. Word has length 102 [2025-03-04 03:00:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:00:53,673 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 303 transitions. [2025-03-04 03:00:53,673 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-04 03:00:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 303 transitions. [2025-03-04 03:00:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 03:00:53,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:00:53,675 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-04 03:00:53,682 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-04 03:00:53,875 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-04 03:00:53,876 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:00:53,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:00:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash -352440447, now seen corresponding path program 1 times [2025-03-04 03:00:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:00:53,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540566417] [2025-03-04 03:00:53,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:00:53,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 03:00:53,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 03:00:53,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:53,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:54,143 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-04 03:00:54,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:00:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540566417] [2025-03-04 03:00:54,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540566417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:00:54,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509830288] [2025-03-04 03:00:54,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:00:54,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:00:54,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:00:54,146 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-04 03:00:54,147 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-04 03:00:54,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 03:00:54,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 03:00:54,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:00:54,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:00:54,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-03-04 03:00:54,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:00:54,411 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-04 03:00:54,413 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-04 03:00:54,820 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-04 03:00:54,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:00:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509830288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:00:54,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:00:54,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [8] total 26 [2025-03-04 03:00:54,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143194110] [2025-03-04 03:00:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:00:54,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 03:00:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:00:54,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 03:00:54,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2025-03-04 03:00:54,822 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-04 03:00:58,857 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-04 03:01:02,887 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-04 03:01:06,907 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-04 03:01:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:07,876 INFO L93 Difference]: Finished difference Result 674 states and 815 transitions. [2025-03-04 03:01:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 03:01:07,877 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-04 03:01:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:07,880 INFO L225 Difference]: With dead ends: 674 [2025-03-04 03:01:07,880 INFO L226 Difference]: Without dead ends: 512 [2025-03-04 03:01:07,881 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-04 03:01:07,882 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 101 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 33 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:01:07,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 1267 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 933 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2025-03-04 03:01:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-04 03:01:07,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 419. [2025-03-04 03:01:07,925 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-04 03:01:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 515 transitions. [2025-03-04 03:01:07,927 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 515 transitions. Word has length 103 [2025-03-04 03:01:07,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:07,928 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 515 transitions. [2025-03-04 03:01:07,928 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-04 03:01:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 515 transitions. [2025-03-04 03:01:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 03:01:07,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:07,930 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-04 03:01:07,947 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-04 03:01:08,131 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-04 03:01:08,131 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:08,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash -22674686, now seen corresponding path program 1 times [2025-03-04 03:01:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:08,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367842786] [2025-03-04 03:01:08,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:08,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:08,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 03:01:08,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 03:01:08,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:08,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:08,372 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-04 03:01:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367842786] [2025-03-04 03:01:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367842786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441339833] [2025-03-04 03:01:08,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:08,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:08,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:08,375 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-04 03:01:08,377 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-04 03:01:08,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 03:01:08,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 03:01:08,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:08,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:08,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 03:01:08,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:01:08,598 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-04 03:01:08,601 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-04 03:01:12,724 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-04 03:01:13,056 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-04 03:01:13,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:01:13,381 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-04 03:01:13,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441339833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:01:13,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:01:13,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 11] total 30 [2025-03-04 03:01:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433937061] [2025-03-04 03:01:13,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:01:13,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 03:01:13,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:01:13,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 03:01:13,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=722, Unknown=1, NotChecked=54, Total=870 [2025-03-04 03:01:13,383 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-04 03:01:17,399 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-04 03:01:21,422 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-04 03:01:25,439 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-04 03:01:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:01:26,469 INFO L93 Difference]: Finished difference Result 1055 states and 1306 transitions. [2025-03-04 03:01:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 03:01:26,470 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-04 03:01:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:01:26,472 INFO L225 Difference]: With dead ends: 1055 [2025-03-04 03:01:26,473 INFO L226 Difference]: Without dead ends: 588 [2025-03-04 03:01:26,474 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-04 03:01:26,475 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-04 03:01:26,475 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-04 03:01:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-03-04 03:01:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 510. [2025-03-04 03:01:26,525 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-04 03:01:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 621 transitions. [2025-03-04 03:01:26,527 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 621 transitions. Word has length 103 [2025-03-04 03:01:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:01:26,528 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 621 transitions. [2025-03-04 03:01:26,528 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-04 03:01:26,528 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 621 transitions. [2025-03-04 03:01:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 03:01:26,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:01:26,529 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-04 03:01:26,537 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-04 03:01:26,729 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-04 03:01:26,730 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:01:26,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:01:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1245319668, now seen corresponding path program 1 times [2025-03-04 03:01:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:01:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133467035] [2025-03-04 03:01:26,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:01:26,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 03:01:26,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 03:01:26,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:26,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:27,411 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-04 03:01:27,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:01:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133467035] [2025-03-04 03:01:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133467035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:01:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254928106] [2025-03-04 03:01:27,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:01:27,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:01:27,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:01:27,414 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-04 03:01:27,414 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-04 03:01:27,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 03:01:27,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 03:01:27,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:01:27,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:01:27,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-04 03:01:27,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:01:27,685 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-04 03:01:27,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:27,692 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-04 03:01:27,732 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2025-03-04 03:01:27,732 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-04 03:01:27,739 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-04 03:01:27,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 03:01:27,743 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