./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_back_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 a846a77e79e267e728f6b3926ab21995aa009422ba7c404ee2d371931ead2c4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 07:15:35,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:15:35,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:15:35,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:15:35,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:15:35,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:15:35,822 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:15:35,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:15:35,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:15:35,823 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:15:35,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:15:35,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:15:35,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:15:35,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:15:35,823 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:15:35,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:15:35,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:15:35,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:15:35,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:15:35,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:15:35,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:15:35,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:15:35,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:15:35,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:15:35,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:15:35,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:15:35,825 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:15:35,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:15:35,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:15:35,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:15:35,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:15:35,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:15:35,825 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:15:35,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:15:35,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:15:35,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:15:35,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:15:35,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:15:35,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:15:35,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:15:35,826 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 -> a846a77e79e267e728f6b3926ab21995aa009422ba7c404ee2d371931ead2c4d [2025-03-17 07:15:36,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:15:36,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:15:36,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:15:36,047 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:15:36,047 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:15:36,049 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_back_harness_negated.i [2025-03-17 07:15:37,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc5e4749/a49cef8f08d94a86825c7aa091bce34c/FLAG69bbe053a [2025-03-17 07:15:37,545 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:15:37,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_back_harness_negated.i [2025-03-17 07:15:37,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc5e4749/a49cef8f08d94a86825c7aa091bce34c/FLAG69bbe053a [2025-03-17 07:15:37,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc5e4749/a49cef8f08d94a86825c7aa091bce34c [2025-03-17 07:15:37,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:15:37,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:15:37,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:15:37,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:15:37,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:15:37,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:15:37" (1/1) ... [2025-03-17 07:15:37,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142ed470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:37, skipping insertion in model container [2025-03-17 07:15:37,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:15:37" (1/1) ... [2025-03-17 07:15:37,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:15:38,010 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_back_harness_negated.i[4494,4507] [2025-03-17 07:15:38,018 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_back_harness_negated.i[4554,4567] [2025-03-17 07:15:38,803 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,808 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,808 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,809 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,809 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,819 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,819 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,820 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,821 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,822 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,822 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,823 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:38,823 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,233 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_back_harness_negated.i[150870,150883] [2025-03-17 07:15:39,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:15:39,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:15:39,265 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_back_harness_negated.i[4494,4507] [2025-03-17 07:15:39,265 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_back_harness_negated.i[4554,4567] [2025-03-17 07:15:39,326 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,327 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,328 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,341 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,342 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,343 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,346 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,346 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:15:39,452 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_back_harness_negated.i[150870,150883] [2025-03-17 07:15:39,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:15:39,596 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:15:39,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39 WrapperNode [2025-03-17 07:15:39,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:15:39,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:15:39,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:15:39,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:15:39,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,700 INFO L138 Inliner]: procedures = 668, calls = 1043, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 129 [2025-03-17 07:15:39,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:15:39,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:15:39,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:15:39,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:15:39,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,735 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 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-17 07:15:39,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,749 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:15:39,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:15:39,775 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:15:39,775 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:15:39,776 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (1/1) ... [2025-03-17 07:15:39,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:15:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:15:39,813 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-17 07:15:39,819 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-17 07:15:39,838 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_back [2025-03-17 07:15:39,839 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_back [2025-03-17 07:15:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:15:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 07:15:39,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 07:15:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:15:39,839 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:15:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 07:15:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-17 07:15:39,839 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-17 07:15:39,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:15:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 07:15:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 07:15:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 07:15:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:15:39,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:15:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-03-17 07:15:39,840 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-03-17 07:15:39,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 07:15:39,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 07:15:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 07:15:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 07:15:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 07:15:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 07:15:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 07:15:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 07:15:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 07:15:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-03-17 07:15:39,841 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-03-17 07:15:39,841 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-17 07:15:39,841 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-17 07:15:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 07:15:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 07:15:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 07:15:40,010 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:15:40,012 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:15:40,071 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem317.base, #t~mem317.offset;havoc #t~short318;havoc #t~mem319.base, #t~mem319.offset;havoc #t~mem320.base, #t~mem320.offset;havoc #t~short321; [2025-03-17 07:15:40,074 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-03-17 07:15:40,112 INFO L1322 $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-17 07:15:40,255 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-17 07:15:40,261 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-03-17 07:15:40,291 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-17 07:15:40,293 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:15:40,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:15:40,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:15:40,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:15:40 BoogieIcfgContainer [2025-03-17 07:15:40,302 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:15:40,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:15:40,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:15:40,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:15:40,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:15:37" (1/3) ... [2025-03-17 07:15:40,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eed2420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:15:40, skipping insertion in model container [2025-03-17 07:15:40,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:15:39" (2/3) ... [2025-03-17 07:15:40,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eed2420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:15:40, skipping insertion in model container [2025-03-17 07:15:40,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:15:40" (3/3) ... [2025-03-17 07:15:40,310 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_back_harness_negated.i [2025-03-17 07:15:40,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:15:40,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_back_harness_negated.i that has 9 procedures, 93 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-17 07:15:40,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:15:40,374 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;@6ad247c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:15:40,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:15:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 60 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 07:15:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 07:15:40,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:40,384 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 07:15:40,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:40,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash -466351013, now seen corresponding path program 1 times [2025-03-17 07:15:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:40,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136721816] [2025-03-17 07:15:40,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:40,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 07:15:40,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 07:15:40,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:40,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-17 07:15:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136721816] [2025-03-17 07:15:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136721816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:15:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543879363] [2025-03-17 07:15:40,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:40,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:15:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:15:40,714 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-17 07:15:40,717 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-17 07:15:40,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 07:15:40,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 07:15:40,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:40,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:40,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 07:15:40,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:15:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-17 07:15:40,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:15:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543879363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:40,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:15:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 07:15:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806230095] [2025-03-17 07:15:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:40,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 07:15:40,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:40,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 07:15:40,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:15:40,925 INFO L87 Difference]: Start difference. First operand has 93 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 60 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 07:15:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:40,943 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2025-03-17 07:15:40,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 07:15:40,944 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-03-17 07:15:40,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:40,949 INFO L225 Difference]: With dead ends: 179 [2025-03-17 07:15:40,949 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 07:15:40,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 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-17 07:15:40,954 INFO L435 NwaCegarLoop]: 122 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, 122 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-17 07:15:40,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:15:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 07:15:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 07:15:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 07:15:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2025-03-17 07:15:40,989 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 83 [2025-03-17 07:15:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:40,990 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2025-03-17 07:15:40,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 07:15:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2025-03-17 07:15:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 07:15:40,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:40,992 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 07:15:41,002 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-17 07:15:41,194 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-17 07:15:41,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:41,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1485800413, now seen corresponding path program 1 times [2025-03-17 07:15:41,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:41,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852507629] [2025-03-17 07:15:41,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:41,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:41,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 07:15:41,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 07:15:41,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:41,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-17 07:15:41,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:41,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852507629] [2025-03-17 07:15:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852507629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:41,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:41,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:15:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997489573] [2025-03-17 07:15:41,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:41,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:15:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:41,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:15:41,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:15:41,816 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 07:15:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:41,879 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2025-03-17 07:15:41,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 07:15:41,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 83 [2025-03-17 07:15:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:41,884 INFO L225 Difference]: With dead ends: 100 [2025-03-17 07:15:41,885 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 07:15:41,885 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-17 07:15:41,886 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 3 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:41,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 571 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:15:41,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 07:15:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-17 07:15:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-17 07:15:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2025-03-17 07:15:41,904 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 83 [2025-03-17 07:15:41,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:41,904 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2025-03-17 07:15:41,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 07:15:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2025-03-17 07:15:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 07:15:41,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:41,908 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 07:15:41,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:15:41,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:41,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:41,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1367851479, now seen corresponding path program 1 times [2025-03-17 07:15:41,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:41,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011163184] [2025-03-17 07:15:41,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:41,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:41,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 07:15:41,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 07:15:41,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:41,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 07:15:42,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:42,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011163184] [2025-03-17 07:15:42,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011163184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:15:42,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945756426] [2025-03-17 07:15:42,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:42,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:15:42,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:15:42,336 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-17 07:15:42,337 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-17 07:15:42,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 07:15:42,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 07:15:42,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:42,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:42,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 07:15:42,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:15:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 07:15:42,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:15:42,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945756426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:42,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:15:42,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-17 07:15:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434880067] [2025-03-17 07:15:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:42,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:15:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:42,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:15:42,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-17 07:15:42,616 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 07:15:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:42,745 INFO L93 Difference]: Finished difference Result 184 states and 242 transitions. [2025-03-17 07:15:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:15:42,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 84 [2025-03-17 07:15:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:42,748 INFO L225 Difference]: With dead ends: 184 [2025-03-17 07:15:42,749 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 07:15:42,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-17 07:15:42,751 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 30 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:42,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 657 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:15:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 07:15:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-03-17 07:15:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 63 states have internal predecessors, (75), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-17 07:15:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 127 transitions. [2025-03-17 07:15:42,765 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 127 transitions. Word has length 84 [2025-03-17 07:15:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:42,766 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 127 transitions. [2025-03-17 07:15:42,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 07:15:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 127 transitions. [2025-03-17 07:15:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 07:15:42,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:42,768 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 07:15:42,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 07:15:42,969 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,SelfDestructingSolverStorable2 [2025-03-17 07:15:42,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:42,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:42,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1995382561, now seen corresponding path program 1 times [2025-03-17 07:15:42,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:42,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160158893] [2025-03-17 07:15:42,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:42,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:15:42,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:15:42,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:42,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 07:15:43,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160158893] [2025-03-17 07:15:43,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160158893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:15:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070124695] [2025-03-17 07:15:43,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:43,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:15:43,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:15:43,274 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-17 07:15:43,276 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-17 07:15:43,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:15:43,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:15:43,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:43,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:43,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 07:15:43,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:15:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 07:15:43,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:15:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070124695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:43,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:15:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2025-03-17 07:15:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193784259] [2025-03-17 07:15:43,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:43,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:15:43,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:43,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:15:43,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2025-03-17 07:15:43,550 INFO L87 Difference]: Start difference. First operand 97 states and 127 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 07:15:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:43,694 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2025-03-17 07:15:43,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 07:15:43,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2025-03-17 07:15:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:43,696 INFO L225 Difference]: With dead ends: 190 [2025-03-17 07:15:43,696 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 07:15:43,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-17 07:15:43,697 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 39 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:43,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 737 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:15:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 07:15:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2025-03-17 07:15:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-17 07:15:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2025-03-17 07:15:43,705 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 86 [2025-03-17 07:15:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:43,705 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2025-03-17 07:15:43,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 07:15:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2025-03-17 07:15:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 07:15:43,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:43,706 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2025-03-17 07:15:43,714 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-17 07:15:43,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:15:43,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash -477872152, now seen corresponding path program 1 times [2025-03-17 07:15:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:43,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848180875] [2025-03-17 07:15:43,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:43,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 07:15:43,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 07:15:43,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:43,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 07:15:44,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:44,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848180875] [2025-03-17 07:15:44,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848180875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:44,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:15:44,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 07:15:44,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279234116] [2025-03-17 07:15:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:44,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:15:44,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:44,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:15:44,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:15:44,211 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 07:15:44,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:15:44,362 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2025-03-17 07:15:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:15:44,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-03-17 07:15:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:15:44,364 INFO L225 Difference]: With dead ends: 191 [2025-03-17 07:15:44,364 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 07:15:44,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 07:15:44,365 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 36 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:15:44,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 746 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:15:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 07:15:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2025-03-17 07:15:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-17 07:15:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 129 transitions. [2025-03-17 07:15:44,379 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 129 transitions. Word has length 87 [2025-03-17 07:15:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:15:44,380 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 129 transitions. [2025-03-17 07:15:44,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 07:15:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 129 transitions. [2025-03-17 07:15:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 07:15:44,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:15:44,383 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1] [2025-03-17 07:15:44,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 07:15:44,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:15:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:15:44,384 INFO L85 PathProgramCache]: Analyzing trace with hash -840627258, now seen corresponding path program 1 times [2025-03-17 07:15:44,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:15:44,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900665708] [2025-03-17 07:15:44,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:15:44,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 07:15:44,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 07:15:44,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:44,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-17 07:15:45,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:15:45,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900665708] [2025-03-17 07:15:45,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900665708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:15:45,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929075989] [2025-03-17 07:15:45,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:15:45,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:15:45,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:15:45,122 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-17 07:15:45,124 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-17 07:15:45,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 07:15:45,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 07:15:45,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:15:45,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:15:45,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-17 07:15:45,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:15:45,341 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-17 07:15:45,346 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-17 07:15:49,734 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1| Int)) (not (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2025-03-17 07:15:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 07:15:58,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:15:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929075989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:15:58,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:15:58,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [15] total 28 [2025-03-17 07:15:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167294355] [2025-03-17 07:15:58,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:15:58,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 07:15:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:15:58,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 07:15:58,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=629, Unknown=3, NotChecked=50, Total=756 [2025-03-17 07:15:58,053 INFO L87 Difference]: Start difference. First operand 99 states and 129 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 15 states have internal predecessors, (51), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-17 07:16:02,323 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-17 07:16:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:02,656 INFO L93 Difference]: Finished difference Result 218 states and 290 transitions. [2025-03-17 07:16:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 07:16:02,657 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 15 states have internal predecessors, (51), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 95 [2025-03-17 07:16:02,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:02,659 INFO L225 Difference]: With dead ends: 218 [2025-03-17 07:16:02,659 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 07:16:02,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=116, Invalid=941, Unknown=3, NotChecked=62, Total=1122 [2025-03-17 07:16:02,660 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:02,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1017 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 400 Invalid, 1 Unknown, 183 Unchecked, 4.4s Time] [2025-03-17 07:16:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 07:16:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2025-03-17 07:16:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 84 states have internal predecessors, (101), 26 states have call successors, (26), 10 states have call predecessors, (26), 11 states have return successors, (29), 24 states have call predecessors, (29), 25 states have call successors, (29) [2025-03-17 07:16:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 156 transitions. [2025-03-17 07:16:02,681 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 156 transitions. Word has length 95 [2025-03-17 07:16:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:02,682 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 156 transitions. [2025-03-17 07:16:02,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 15 states have internal predecessors, (51), 6 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-17 07:16:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2025-03-17 07:16:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 07:16:02,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:02,685 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1] [2025-03-17 07:16:02,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 07:16:02,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:02,885 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:02,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash -969709977, now seen corresponding path program 1 times [2025-03-17 07:16:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:02,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119541629] [2025-03-17 07:16:02,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:02,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 07:16:02,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 07:16:02,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:02,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-17 07:16:03,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119541629] [2025-03-17 07:16:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119541629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459230240] [2025-03-17 07:16:03,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:03,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:03,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:03,191 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-17 07:16:03,193 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-17 07:16:03,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 07:16:03,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 07:16:03,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:03,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:03,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 07:16:03,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 07:16:03,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-17 07:16:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459230240] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 07:16:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 13] total 20 [2025-03-17 07:16:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223934728] [2025-03-17 07:16:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:03,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:16:03,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:03,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:16:03,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2025-03-17 07:16:03,734 INFO L87 Difference]: Start difference. First operand 119 states and 156 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 07:16:03,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:03,783 INFO L93 Difference]: Finished difference Result 130 states and 169 transitions. [2025-03-17 07:16:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:16:03,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2025-03-17 07:16:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:03,785 INFO L225 Difference]: With dead ends: 130 [2025-03-17 07:16:03,785 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 07:16:03,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2025-03-17 07:16:03,787 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:03,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 673 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 07:16:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2025-03-17 07:16:03,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 85 states have internal predecessors, (102), 26 states have call successors, (26), 10 states have call predecessors, (26), 11 states have return successors, (29), 24 states have call predecessors, (29), 25 states have call successors, (29) [2025-03-17 07:16:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 157 transitions. [2025-03-17 07:16:03,800 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 157 transitions. Word has length 95 [2025-03-17 07:16:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:03,800 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 157 transitions. [2025-03-17 07:16:03,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 07:16:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 157 transitions. [2025-03-17 07:16:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 07:16:03,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:03,801 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:03,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 07:16:04,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:04,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:04,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1777894317, now seen corresponding path program 1 times [2025-03-17 07:16:04,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:04,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232442452] [2025-03-17 07:16:04,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:04,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:04,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 07:16:04,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 07:16:04,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:04,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-17 07:16:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232442452] [2025-03-17 07:16:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232442452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99067210] [2025-03-17 07:16:04,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:04,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:04,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:04,487 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-17 07:16:04,489 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-17 07:16:04,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 07:16:04,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 07:16:04,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:04,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:04,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 07:16:04,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-17 07:16:04,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:16:04,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99067210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:04,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:16:04,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-03-17 07:16:04,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12586511] [2025-03-17 07:16:04,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 07:16:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:04,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 07:16:04,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2025-03-17 07:16:04,746 INFO L87 Difference]: Start difference. First operand 120 states and 157 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 07:16:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:04,811 INFO L93 Difference]: Finished difference Result 132 states and 171 transitions. [2025-03-17 07:16:04,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 07:16:04,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2025-03-17 07:16:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:04,812 INFO L225 Difference]: With dead ends: 132 [2025-03-17 07:16:04,813 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 07:16:04,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2025-03-17 07:16:04,813 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 4 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:04,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 977 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 07:16:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2025-03-17 07:16:04,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 86 states have internal predecessors, (103), 26 states have call successors, (26), 10 states have call predecessors, (26), 11 states have return successors, (29), 24 states have call predecessors, (29), 25 states have call successors, (29) [2025-03-17 07:16:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 158 transitions. [2025-03-17 07:16:04,821 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 158 transitions. Word has length 97 [2025-03-17 07:16:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:04,822 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 158 transitions. [2025-03-17 07:16:04,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 07:16:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2025-03-17 07:16:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 07:16:04,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:04,823 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:04,830 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-17 07:16:05,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:05,023 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:05,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:05,024 INFO L85 PathProgramCache]: Analyzing trace with hash 529594074, now seen corresponding path program 1 times [2025-03-17 07:16:05,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911485495] [2025-03-17 07:16:05,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:05,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 07:16:05,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 07:16:05,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:05,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-17 07:16:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:05,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911485495] [2025-03-17 07:16:05,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911485495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:05,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561368207] [2025-03-17 07:16:05,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:05,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:05,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:05,834 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-17 07:16:05,837 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-17 07:16:05,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 07:16:05,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 07:16:05,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:05,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:05,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-17 07:16:05,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:06,065 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 16 treesize of output 17 [2025-03-17 07:16:06,073 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-17 07:16:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-17 07:16:07,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:20,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2025-03-17 07:16:20,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:20,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:20,387 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 07:16:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-17 07:16:20,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561368207] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:20,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 07:16:20,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [16, 16] total 44 [2025-03-17 07:16:20,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731266015] [2025-03-17 07:16:20,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:20,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 07:16:20,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:20,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 07:16:20,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1756, Unknown=3, NotChecked=0, Total=1892 [2025-03-17 07:16:20,482 INFO L87 Difference]: Start difference. First operand 121 states and 158 transitions. Second operand has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 13 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-17 07:16:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:20,888 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2025-03-17 07:16:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 07:16:20,889 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 13 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Word has length 98 [2025-03-17 07:16:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:20,890 INFO L225 Difference]: With dead ends: 225 [2025-03-17 07:16:20,890 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 07:16:20,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 160 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=143, Invalid=1924, Unknown=3, NotChecked=0, Total=2070 [2025-03-17 07:16:20,891 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 4 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:20,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1428 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:16:20,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 07:16:20,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-17 07:16:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 87 states have internal predecessors, (104), 26 states have call successors, (26), 10 states have call predecessors, (26), 11 states have return successors, (29), 24 states have call predecessors, (29), 25 states have call successors, (29) [2025-03-17 07:16:20,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2025-03-17 07:16:20,902 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 159 transitions. Word has length 98 [2025-03-17 07:16:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:20,903 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 159 transitions. [2025-03-17 07:16:20,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.533333333333333) internal successors, (53), 13 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-17 07:16:20,903 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2025-03-17 07:16:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 07:16:20,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:20,903 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:20,911 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-17 07:16:21,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:21,104 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:21,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash 932636461, now seen corresponding path program 1 times [2025-03-17 07:16:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:21,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107722743] [2025-03-17 07:16:21,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:21,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:21,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 07:16:21,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 07:16:21,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:21,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 07:16:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107722743] [2025-03-17 07:16:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107722743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480674493] [2025-03-17 07:16:21,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:21,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:21,807 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-17 07:16:21,808 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-17 07:16:21,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 07:16:21,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 07:16:21,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:21,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:21,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-17 07:16:21,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:22,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:22,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:22,058 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 22 treesize of output 22 [2025-03-17 07:16:22,064 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-17 07:16:22,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:22,068 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 [2025-03-17 07:16:26,093 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|) 24) 2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_30|))) is different from true [2025-03-17 07:16:30,150 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_31| Int)) (and (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_31|) 24) 2) |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_31|) (<= 2 |v_ULTIMATE.start_aws_linked_list_back_harness_~#list~0#1.base_BEFORE_CALL_31|))) is different from true [2025-03-17 07:16:34,232 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_21 Int)) (and (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_21) (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_21) 24) 2) v_aws_linked_list_back_~list.base_BEFORE_CALL_21))) is different from true [2025-03-17 07:16:38,294 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_22 Int)) (and (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_22) 24) 2) v_aws_linked_list_back_~list.base_BEFORE_CALL_22) (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_22))) is different from true [2025-03-17 07:16:42,340 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_23 Int)) (and (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_23) 24)) v_aws_linked_list_back_~list.base_BEFORE_CALL_23) (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_23))) is different from true [2025-03-17 07:16:46,505 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_24 Int)) (and (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_24) (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_24) 24) 2) v_aws_linked_list_back_~list.base_BEFORE_CALL_24))) is different from true [2025-03-17 07:16:50,561 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_back_~list.base_BEFORE_CALL_25 Int)) (and (<= (+ (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_back_~list.base_BEFORE_CALL_25) 24) 2) v_aws_linked_list_back_~list.base_BEFORE_CALL_25) (<= 2 v_aws_linked_list_back_~list.base_BEFORE_CALL_25))) is different from true