./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.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_insert_after_harness.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 90d8983d1d445f35ced762b5547157927629cd141f5cc02ba145442ec7c5e770 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 07:16:08,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:16:08,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:16:08,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:16:08,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:16:08,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:16:08,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:16:08,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:16:08,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:16:08,083 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:16:08,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:16:08,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:16:08,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:16:08,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:16:08,084 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:16:08,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:16:08,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:16:08,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:16:08,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:16:08,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:16:08,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:16:08,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:16:08,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:16:08,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:16:08,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:16:08,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:16:08,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:16:08,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:16:08,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:16:08,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:16:08,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:16:08,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:16:08,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:16:08,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:16:08,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:16:08,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:16:08,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:16:08,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:16:08,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:16:08,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:16:08,087 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 -> 90d8983d1d445f35ced762b5547157927629cd141f5cc02ba145442ec7c5e770 [2025-03-17 07:16:08,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:16:08,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:16:08,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:16:08,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:16:08,339 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:16:08,340 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_insert_after_harness.i [2025-03-17 07:16:09,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638f1fcc9/29ed0c6913d84acd927f1177f9d081dd/FLAG576e04c90 [2025-03-17 07:16:09,859 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:16:09,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_insert_after_harness.i [2025-03-17 07:16:09,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638f1fcc9/29ed0c6913d84acd927f1177f9d081dd/FLAG576e04c90 [2025-03-17 07:16:10,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638f1fcc9/29ed0c6913d84acd927f1177f9d081dd [2025-03-17 07:16:10,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:16:10,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:16:10,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:16:10,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:16:10,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:16:10,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:16:10" (1/1) ... [2025-03-17 07:16:10,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642b2fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:10, skipping insertion in model container [2025-03-17 07:16:10,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:16:10" (1/1) ... [2025-03-17 07:16:10,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:16:10,274 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_insert_after_harness.i[4502,4515] [2025-03-17 07:16:10,280 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_insert_after_harness.i[4562,4575] [2025-03-17 07:16:10,901 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,901 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,902 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,902 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,903 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,911 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,911 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,912 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,913 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,914 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,914 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,915 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:10,915 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,257 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_insert_after_harness.i[150740,150753] [2025-03-17 07:16:11,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:16:11,275 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:16:11,285 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_insert_after_harness.i[4502,4515] [2025-03-17 07:16:11,286 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_insert_after_harness.i[4562,4575] [2025-03-17 07:16:11,326 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,329 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,330 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,331 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,332 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,344 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,345 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,346 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,346 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,347 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,348 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:11,417 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_insert_after_harness.i[150740,150753] [2025-03-17 07:16:11,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:16:11,548 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:16:11,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11 WrapperNode [2025-03-17 07:16:11,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:16:11,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:16:11,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:16:11,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:16:11,556 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:16:11" (1/1) ... [2025-03-17 07:16:11,601 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:16:11" (1/1) ... [2025-03-17 07:16:11,631 INFO L138 Inliner]: procedures = 668, calls = 1048, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 76 [2025-03-17 07:16:11,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:16:11,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:16:11,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:16:11,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:16:11,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,641 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,659 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 17, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2025-03-17 07:16:11,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:16:11,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:16:11,675 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:16:11,675 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:16:11,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (1/1) ... [2025-03-17 07:16:11,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:16:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:11,712 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:16:11,716 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:16:11,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:16:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 07:16:11,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 07:16:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:16:11,735 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:16:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:16:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 07:16:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 07:16:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 07:16:11,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:16:11,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:16:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 07:16:11,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 07:16:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 07:16:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 07:16:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 07:16:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 07:16:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 07:16:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 07:16:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 07:16:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-17 07:16:11,737 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-17 07:16:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 07:16:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 07:16:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 07:16:11,907 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:16:11,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:16:11,957 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-03-17 07:16:11,971 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-03-17 07:16:12,087 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-17 07:16:12,087 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:16:12,095 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:16:12,095 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:16:12,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:16:12 BoogieIcfgContainer [2025-03-17 07:16:12,096 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:16:12,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:16:12,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:16:12,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:16:12,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:16:10" (1/3) ... [2025-03-17 07:16:12,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e280a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:16:12, skipping insertion in model container [2025-03-17 07:16:12,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:11" (2/3) ... [2025-03-17 07:16:12,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e280a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:16:12, skipping insertion in model container [2025-03-17 07:16:12,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:16:12" (3/3) ... [2025-03-17 07:16:12,104 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_insert_after_harness.i [2025-03-17 07:16:12,114 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:16:12,116 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_insert_after_harness.i that has 5 procedures, 59 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-17 07:16:12,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:16:12,159 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;@750c7edf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:16:12,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:16:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 07:16:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 07:16:12,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:12,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:12,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1698734204, now seen corresponding path program 1 times [2025-03-17 07:16:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336146992] [2025-03-17 07:16:12,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:12,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 07:16:12,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 07:16:12,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:12,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 07:16:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336146992] [2025-03-17 07:16:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336146992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322119170] [2025-03-17 07:16:12,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:12,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:12,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:12,504 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:16:12,506 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:16:12,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 07:16:12,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 07:16:12,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:12,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:12,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 07:16:12,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 07:16:12,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 07:16:12,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322119170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:12,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 07:16:12,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 07:16:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201493777] [2025-03-17 07:16:12,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:12,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 07:16:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:12,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 07:16:12,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:16:12,713 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 07:16:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:12,729 INFO L93 Difference]: Finished difference Result 115 states and 167 transitions. [2025-03-17 07:16:12,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 07:16:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-17 07:16:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:12,734 INFO L225 Difference]: With dead ends: 115 [2025-03-17 07:16:12,735 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 07:16:12,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 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:16:12,739 INFO L435 NwaCegarLoop]: 78 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, 78 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:16:12,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 07:16:12,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 07:16:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 07:16:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2025-03-17 07:16:12,769 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 33 [2025-03-17 07:16:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:12,769 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2025-03-17 07:16:12,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 07:16:12,770 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2025-03-17 07:16:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 07:16:12,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:12,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:12,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 07:16:12,974 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:16:12,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:12,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:12,975 INFO L85 PathProgramCache]: Analyzing trace with hash -849856262, now seen corresponding path program 1 times [2025-03-17 07:16:12,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:12,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35989949] [2025-03-17 07:16:12,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:13,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 07:16:13,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 07:16:13,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:13,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 07:16:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35989949] [2025-03-17 07:16:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35989949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:14,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 07:16:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060995548] [2025-03-17 07:16:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:14,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 07:16:14,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:14,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 07:16:14,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 07:16:14,834 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 07:16:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:15,126 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2025-03-17 07:16:15,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 07:16:15,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-17 07:16:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:15,128 INFO L225 Difference]: With dead ends: 67 [2025-03-17 07:16:15,128 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 07:16:15,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 07:16:15,129 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:15,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 460 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 07:16:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 07:16:15,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-03-17 07:16:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 21 states have call successors, (21), 5 states have call predecessors, (21), 6 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2025-03-17 07:16:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 87 transitions. [2025-03-17 07:16:15,149 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 87 transitions. Word has length 33 [2025-03-17 07:16:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:15,149 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 87 transitions. [2025-03-17 07:16:15,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 07:16:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 87 transitions. [2025-03-17 07:16:15,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 07:16:15,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:15,150 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 07:16:15,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:16:15,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:15,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 892954073, now seen corresponding path program 1 times [2025-03-17 07:16:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:15,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210958349] [2025-03-17 07:16:15,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:15,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:15,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 07:16:15,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 07:16:15,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:15,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 07:16:15,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:15,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210958349] [2025-03-17 07:16:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210958349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:15,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:15,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:16:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182926439] [2025-03-17 07:16:15,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:15,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:16:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:15,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:16:15,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:16:15,403 INFO L87 Difference]: Start difference. First operand 64 states and 87 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 07:16:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:15,603 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2025-03-17 07:16:15,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:16:15,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-03-17 07:16:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:15,608 INFO L225 Difference]: With dead ends: 131 [2025-03-17 07:16:15,608 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 07:16:15,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 07:16:15,609 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 17 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:15,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 319 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 07:16:15,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 07:16:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 21 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (28), 20 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-17 07:16:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2025-03-17 07:16:15,628 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 33 [2025-03-17 07:16:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:15,628 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2025-03-17 07:16:15,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 07:16:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2025-03-17 07:16:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 07:16:15,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:15,630 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 07:16:15,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 07:16:15,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:15,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash 696440568, now seen corresponding path program 1 times [2025-03-17 07:16:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:15,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592854341] [2025-03-17 07:16:15,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:15,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 07:16:15,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 07:16:15,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:15,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 07:16:15,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:15,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592854341] [2025-03-17 07:16:15,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592854341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:15,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:15,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:16:15,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73491042] [2025-03-17 07:16:15,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:15,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:16:15,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:15,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:16:15,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:16:15,752 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 07:16:15,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:15,818 INFO L93 Difference]: Finished difference Result 138 states and 191 transitions. [2025-03-17 07:16:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:16:15,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2025-03-17 07:16:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:15,820 INFO L225 Difference]: With dead ends: 138 [2025-03-17 07:16:15,820 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 07:16:15,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:16:15,821 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:15,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 266 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:15,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 07:16:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-03-17 07:16:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (22), 19 states have call predecessors, (22), 19 states have call successors, (22) [2025-03-17 07:16:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-03-17 07:16:15,836 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 33 [2025-03-17 07:16:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:15,836 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-03-17 07:16:15,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 07:16:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-03-17 07:16:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 07:16:15,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:15,837 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 07:16:15,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 07:16:15,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:15,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash 353301295, now seen corresponding path program 1 times [2025-03-17 07:16:15,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:15,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601435362] [2025-03-17 07:16:15,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:15,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:15,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 07:16:15,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 07:16:15,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:15,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 07:16:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601435362] [2025-03-17 07:16:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601435362] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889605975] [2025-03-17 07:16:17,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:17,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:17,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:17,039 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:16:17,043 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:16:17,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 07:16:17,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 07:16:17,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:17,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:17,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-03-17 07:16:17,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:17,247 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 07:16:17,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 84 [2025-03-17 07:16:17,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-17 07:16:17,269 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 07:16:17,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-03-17 07:16:21,315 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_1|) 0)))) is different from true [2025-03-17 07:16:25,387 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_2|) 0)))) is different from true [2025-03-17 07:16:29,468 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_insert_after_~after#1.base_BEFORE_CALL_3|) 0)))) is different from true [2025-03-17 07:16:29,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:29,670 INFO L349 Elim1Store]: treesize reduction 171, result has 16.2 percent of original size [2025-03-17 07:16:29,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 278 treesize of output 279 [2025-03-17 07:16:29,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:29,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 71 [2025-03-17 07:16:29,704 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 07:16:29,708 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 07:16:29,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 52 [2025-03-17 07:16:29,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 141 [2025-03-17 07:16:29,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:29,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2025-03-17 07:16:29,763 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 07:16:29,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 75 [2025-03-17 07:16:29,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2025-03-17 07:16:29,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:29,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:29,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:33,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:33,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:33,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:33,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:33,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:33,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:33,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 07:16:34,017 INFO L349 Elim1Store]: treesize reduction 277, result has 47.4 percent of original size [2025-03-17 07:16:34,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 7 disjoint index pairs (out of 66 index pairs), introduced 16 new quantified variables, introduced 59 case distinctions, treesize of input 406 treesize of output 523 [2025-03-17 07:16:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2025-03-17 07:16:34,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:17:03,040 INFO L349 Elim1Store]: treesize reduction 88, result has 1.1 percent of original size [2025-03-17 07:17:03,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1912 treesize of output 1 [2025-03-17 07:17:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 07:17:03,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889605975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 07:17:03,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 07:17:03,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24, 16] total 53 [2025-03-17 07:17:03,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359764605] [2025-03-17 07:17:03,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 07:17:03,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-17 07:17:03,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:17:03,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-17 07:17:03,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2212, Unknown=74, NotChecked=294, Total=2756 [2025-03-17 07:17:03,060 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 53 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 41 states have internal predecessors, (85), 15 states have call successors, (21), 9 states have call predecessors, (21), 13 states have return successors, (18), 12 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-17 07:17:31,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 07:17:48,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]