./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c37a0beecaaffccfccd39c8b76dad022f083d470c5665e9f01bdfeab207ad41e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:52:14,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:52:14,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:52:14,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:52:14,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:52:14,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:52:14,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:52:14,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:52:14,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:52:14,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:52:14,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:52:14,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:52:14,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:52:14,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:52:14,268 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:52:14,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:52:14,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:52:14,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:52:14,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:52:14,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:52:14,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:52:14,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:52:14,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:52:14,269 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:52:14,269 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:52:14,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:52:14,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:52:14,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:52:14,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:52:14,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:14,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:52:14,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:52:14,270 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:52:14,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:52:14,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:52:14,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:52:14,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:52:14,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:52:14,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:52:14,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:52:14,271 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c37a0beecaaffccfccd39c8b76dad022f083d470c5665e9f01bdfeab207ad41e [2025-02-08 01:52:14,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:52:14,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:52:14,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:52:14,545 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:52:14,545 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:52:14,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2025-02-08 01:52:15,640 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f029b0756/4f61a101346149e18132d85d0c707b03/FLAGd94d8870a [2025-02-08 01:52:16,044 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:52:16,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2025-02-08 01:52:16,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f029b0756/4f61a101346149e18132d85d0c707b03/FLAGd94d8870a [2025-02-08 01:52:16,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f029b0756/4f61a101346149e18132d85d0c707b03 [2025-02-08 01:52:16,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:52:16,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:52:16,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:16,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:52:16,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:52:16,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:16" (1/1) ... [2025-02-08 01:52:16,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d23ea59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:16, skipping insertion in model container [2025-02-08 01:52:16,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:52:16" (1/1) ... [2025-02-08 01:52:16,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:52:16,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4494,4507] [2025-02-08 01:52:16,292 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4554,4567] [2025-02-08 01:52:16,666 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,667 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,667 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,668 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,668 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,676 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,676 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,678 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,678 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,679 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,680 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,680 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,680 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:16,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[150277,150290] [2025-02-08 01:52:16,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:17,011 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:52:17,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4494,4507] [2025-02-08 01:52:17,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4554,4567] [2025-02-08 01:52:17,083 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,085 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,086 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,087 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,088 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,099 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,101 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,102 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,103 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,104 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,105 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,106 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,106 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:52:17,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[150277,150290] [2025-02-08 01:52:17,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:52:17,308 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:52:17,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17 WrapperNode [2025-02-08 01:52:17,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:52:17,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:17,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:52:17,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:52:17,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,413 INFO L138 Inliner]: procedures = 668, calls = 1034, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 89 [2025-02-08 01:52:17,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:52:17,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:52:17,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:52:17,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:52:17,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,458 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-02-08 01:52:17,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:52:17,483 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:52:17,483 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:52:17,483 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:52:17,484 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (1/1) ... [2025-02-08 01:52:17,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:52:17,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:52:17,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:52:17,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:52:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2025-02-08 01:52:17,533 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:52:17,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:17,534 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-08 01:52:17,534 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:52:17,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:52:17,534 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-02-08 01:52:17,535 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:52:17,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:52:17,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:52:17,720 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:52:17,722 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:52:17,772 INFO L1324 $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-02-08 01:52:17,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700-1: #t~ret311#1 := aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret322#1, aws_linked_list_is_valid_deep_#t~mem323#1.base, aws_linked_list_is_valid_deep_#t~mem323#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;havoc aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := (if 0 == #t~ret311#1 % 256 then 0 else 1);havoc #t~ret311#1; [2025-02-08 01:52:17,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-08 01:52:17,907 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-02-08 01:52:17,920 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-02-08 01:52:17,920 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:52:17,926 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:52:17,926 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:52:17,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:17 BoogieIcfgContainer [2025-02-08 01:52:17,926 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:52:17,928 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:52:17,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:52:17,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:52:17,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:52:16" (1/3) ... [2025-02-08 01:52:17,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13663f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:17, skipping insertion in model container [2025-02-08 01:52:17,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:52:17" (2/3) ... [2025-02-08 01:52:17,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13663f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:52:17, skipping insertion in model container [2025-02-08 01:52:17,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:17" (3/3) ... [2025-02-08 01:52:17,932 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2025-02-08 01:52:17,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:52:17,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_init_harness.i that has 7 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 01:52:17,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:52:17,979 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;@761eaed0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:52:17,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:52:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 40 states have (on average 1.35) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 01:52:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 01:52:17,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:17,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:17,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:17,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:17,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1488711331, now seen corresponding path program 1 times [2025-02-08 01:52:17,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300221776] [2025-02-08 01:52:17,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:17,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:18,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:52:18,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:52:18,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:18,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:52:18,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:18,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300221776] [2025-02-08 01:52:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300221776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:18,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:18,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:52:18,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317384191] [2025-02-08 01:52:18,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:18,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:52:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:18,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:52:18,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:52:18,203 INFO L87 Difference]: Start difference. First operand has 59 states, 40 states have (on average 1.35) internal successors, (54), 42 states have internal predecessors, (54), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:18,221 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2025-02-08 01:52:18,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:52:18,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-08 01:52:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:18,227 INFO L225 Difference]: With dead ends: 114 [2025-02-08 01:52:18,228 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 01:52:18,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:52:18,234 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:18,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 01:52:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 01:52:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 01:52:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-02-08 01:52:18,265 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 26 [2025-02-08 01:52:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:18,266 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-02-08 01:52:18,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2025-02-08 01:52:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 01:52:18,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:18,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:18,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:52:18,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:18,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1700062244, now seen corresponding path program 1 times [2025-02-08 01:52:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:18,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231949115] [2025-02-08 01:52:18,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:18,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:18,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:52:18,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:52:18,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:18,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:52:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:18,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231949115] [2025-02-08 01:52:18,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231949115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:18,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:18,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:52:18,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322257433] [2025-02-08 01:52:18,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:18,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:52:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:18,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:52:18,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:52:18,472 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 01:52:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:18,499 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2025-02-08 01:52:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:52:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-02-08 01:52:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:18,500 INFO L225 Difference]: With dead ends: 81 [2025-02-08 01:52:18,501 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 01:52:18,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:52:18,501 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:18,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 132 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 01:52:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-02-08 01:52:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 01:52:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-02-08 01:52:18,507 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 26 [2025-02-08 01:52:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:18,507 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-02-08 01:52:18,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 01:52:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2025-02-08 01:52:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 01:52:18,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:18,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:18,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:52:18,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:18,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash -96889115, now seen corresponding path program 1 times [2025-02-08 01:52:18,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:18,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488543061] [2025-02-08 01:52:18,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:18,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:52:18,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:52:18,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:18,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:52:18,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:18,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488543061] [2025-02-08 01:52:18,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488543061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:18,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:18,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:52:18,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361006372] [2025-02-08 01:52:18,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:18,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:52:18,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:18,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:52:18,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:52:18,636 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 01:52:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:18,655 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2025-02-08 01:52:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:52:18,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-02-08 01:52:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:18,658 INFO L225 Difference]: With dead ends: 85 [2025-02-08 01:52:18,658 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 01:52:18,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:52:18,659 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:18,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 134 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 01:52:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2025-02-08 01:52:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-08 01:52:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-02-08 01:52:18,669 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2025-02-08 01:52:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:18,669 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-02-08 01:52:18,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 01:52:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-02-08 01:52:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 01:52:18,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:18,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:18,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:52:18,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:18,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1904343578, now seen corresponding path program 1 times [2025-02-08 01:52:18,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:18,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608549186] [2025-02-08 01:52:18,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:18,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:52:18,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:52:18,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:18,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:52:19,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608549186] [2025-02-08 01:52:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608549186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:19,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:19,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:52:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870666951] [2025-02-08 01:52:19,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:19,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:52:19,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:19,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:52:19,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:52:19,215 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:19,345 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2025-02-08 01:52:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:52:19,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-08 01:52:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:19,347 INFO L225 Difference]: With dead ends: 96 [2025-02-08 01:52:19,347 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 01:52:19,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:52:19,348 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 12 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:19,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 228 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 01:52:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-08 01:52:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-08 01:52:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-02-08 01:52:19,354 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 26 [2025-02-08 01:52:19,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:19,354 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-02-08 01:52:19,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2025-02-08 01:52:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 01:52:19,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:19,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:19,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:52:19,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:19,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1993465251, now seen corresponding path program 1 times [2025-02-08 01:52:19,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:19,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207066005] [2025-02-08 01:52:19,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:19,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:19,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:52:19,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:52:19,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:19,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:52:20,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:20,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207066005] [2025-02-08 01:52:20,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207066005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:20,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:20,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 01:52:20,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639789918] [2025-02-08 01:52:20,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:20,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:52:20,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:20,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:52:20,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:52:20,097 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:20,227 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2025-02-08 01:52:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:52:20,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-08 01:52:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:20,229 INFO L225 Difference]: With dead ends: 110 [2025-02-08 01:52:20,229 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 01:52:20,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-08 01:52:20,230 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 19 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:20,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 206 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 01:52:20,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-02-08 01:52:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-08 01:52:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2025-02-08 01:52:20,242 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 26 [2025-02-08 01:52:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:20,243 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2025-02-08 01:52:20,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2025-02-08 01:52:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 01:52:20,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:20,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:20,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:52:20,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:20,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash 186010788, now seen corresponding path program 1 times [2025-02-08 01:52:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:20,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119776219] [2025-02-08 01:52:20,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:20,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:20,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:52:20,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:52:20,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:20,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:52:20,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:20,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119776219] [2025-02-08 01:52:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119776219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:20,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 01:52:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212003826] [2025-02-08 01:52:20,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:20,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:52:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:20,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:52:20,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 01:52:20,718 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:20,906 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2025-02-08 01:52:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:52:20,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-08 01:52:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:20,907 INFO L225 Difference]: With dead ends: 124 [2025-02-08 01:52:20,907 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 01:52:20,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:52:20,908 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:20,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 302 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 01:52:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2025-02-08 01:52:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 46 states have internal predecessors, (52), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-08 01:52:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2025-02-08 01:52:20,914 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 26 [2025-02-08 01:52:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:20,914 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2025-02-08 01:52:20,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2025-02-08 01:52:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 01:52:20,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:20,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:20,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:52:20,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:20,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:20,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1610940571, now seen corresponding path program 1 times [2025-02-08 01:52:20,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:20,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569551264] [2025-02-08 01:52:20,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:20,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:20,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:52:20,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:52:20,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:20,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:52:21,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:21,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569551264] [2025-02-08 01:52:21,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569551264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:21,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:21,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 01:52:21,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987565621] [2025-02-08 01:52:21,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:21,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:52:21,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:21,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:52:21,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-08 01:52:21,341 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:21,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:21,540 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2025-02-08 01:52:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:52:21,541 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-08 01:52:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:21,542 INFO L225 Difference]: With dead ends: 120 [2025-02-08 01:52:21,542 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 01:52:21,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-08 01:52:21,543 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:21,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 276 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 01:52:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 01:52:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2025-02-08 01:52:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 46 states have internal predecessors, (52), 9 states have call successors, (9), 5 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-08 01:52:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2025-02-08 01:52:21,549 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 26 [2025-02-08 01:52:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:21,549 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2025-02-08 01:52:21,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 01:52:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2025-02-08 01:52:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 01:52:21,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:52:21,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:21,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:52:21,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:52:21,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:52:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash -396791769, now seen corresponding path program 1 times [2025-02-08 01:52:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:52:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574675585] [2025-02-08 01:52:21,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:52:21,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:52:21,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 01:52:21,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 01:52:21,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:52:21,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:52:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:52:21,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:52:21,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574675585] [2025-02-08 01:52:21,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574675585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:52:21,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:52:21,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:52:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466481861] [2025-02-08 01:52:21,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:52:21,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:52:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:52:21,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:52:21,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:52:21,629 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 01:52:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:52:21,660 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2025-02-08 01:52:21,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:52:21,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-02-08 01:52:21,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:52:21,660 INFO L225 Difference]: With dead ends: 100 [2025-02-08 01:52:21,660 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 01:52:21,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:52:21,661 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:52:21,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:52:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 01:52:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 01:52:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:52:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 01:52:21,662 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-02-08 01:52:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:52:21,662 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 01:52:21,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 01:52:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 01:52:21,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 01:52:21,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 01:52:21,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:52:21,667 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:52:21,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 01:52:21,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:52:21,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:52:21 BoogieIcfgContainer [2025-02-08 01:52:21,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:52:21,874 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:52:21,874 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:52:21,875 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:52:21,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:52:17" (3/4) ... [2025-02-08 01:52:21,877 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:52:21,881 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2025-02-08 01:52:21,881 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 01:52:21,881 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 01:52:21,881 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_is_valid [2025-02-08 01:52:21,881 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_init [2025-02-08 01:52:21,881 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_empty [2025-02-08 01:52:21,884 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 01:52:21,884 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 01:52:21,884 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:52:21,884 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:52:21,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:52:21,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:52:21,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:52:21,940 INFO L158 Benchmark]: Toolchain (without parser) took 5832.90ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 126.6MB in the beginning and 196.6MB in the end (delta: -70.0MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2025-02-08 01:52:21,940 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 218.1MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:52:21,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1201.16ms. Allocated memory is still 167.8MB. Free memory was 126.2MB in the beginning and 85.2MB in the end (delta: 41.0MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2025-02-08 01:52:21,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.57ms. Allocated memory is still 167.8MB. Free memory was 85.2MB in the beginning and 80.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:52:21,940 INFO L158 Benchmark]: Boogie Preprocessor took 68.33ms. Allocated memory is still 167.8MB. Free memory was 80.2MB in the beginning and 76.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:52:21,941 INFO L158 Benchmark]: IcfgBuilder took 443.14ms. Allocated memory is still 167.8MB. Free memory was 76.8MB in the beginning and 125.8MB in the end (delta: -49.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:52:21,941 INFO L158 Benchmark]: TraceAbstraction took 3946.12ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 124.9MB in the beginning and 201.9MB in the end (delta: -77.0MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. [2025-02-08 01:52:21,941 INFO L158 Benchmark]: Witness Printer took 64.83ms. Allocated memory is still 243.3MB. Free memory was 201.9MB in the beginning and 196.6MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:52:21,942 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 218.1MB. Free memory is still 132.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1201.16ms. Allocated memory is still 167.8MB. Free memory was 126.2MB in the beginning and 85.2MB in the end (delta: 41.0MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.57ms. Allocated memory is still 167.8MB. Free memory was 85.2MB in the beginning and 80.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.33ms. Allocated memory is still 167.8MB. Free memory was 80.2MB in the beginning and 76.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 443.14ms. Allocated memory is still 167.8MB. Free memory was 76.8MB in the beginning and 125.8MB in the end (delta: -49.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3946.12ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 124.9MB in the beginning and 201.9MB in the end (delta: -77.0MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. * Witness Printer took 64.83ms. Allocated memory is still 243.3MB. Free memory was 201.9MB in the beginning and 196.6MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 1495 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1129 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 449 IncrementalHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 366 mSDtfsCounter, 449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=6, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 974 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:52:21,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE