./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cfa46b1b74f9528e420997256345b81eb5e96730cd46353f45cf9329326ca074 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:57:30,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:57:30,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 02:57:30,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:57:30,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:57:30,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:57:30,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:57:30,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:57:30,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:57:30,184 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:57:30,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:57:30,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:57:30,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:57:30,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:57:30,186 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:57:30,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:57:30,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:57:30,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:57:30,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:57:30,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:57:30,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:57:30,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:57:30,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:57:30,187 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:57:30,187 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:57:30,187 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:57:30,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:57:30,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:57:30,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:57:30,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:30,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:57:30,188 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfa46b1b74f9528e420997256345b81eb5e96730cd46353f45cf9329326ca074 [2025-03-04 02:57:30,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:57:30,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:57:30,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:57:30,430 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:57:30,430 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:57:30,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i [2025-03-04 02:57:31,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e875faa0/e0e7423927c54975b5f9261d8d1c45d4/FLAG395e5fc1c [2025-03-04 02:57:32,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:57:32,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i [2025-03-04 02:57:32,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e875faa0/e0e7423927c54975b5f9261d8d1c45d4/FLAG395e5fc1c [2025-03-04 02:57:32,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e875faa0/e0e7423927c54975b5f9261d8d1c45d4 [2025-03-04 02:57:32,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:57:32,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:57:32,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:32,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:57:32,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:57:32,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:32" (1/1) ... [2025-03-04 02:57:32,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:32, skipping insertion in model container [2025-03-04 02:57:32,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:57:32" (1/1) ... [2025-03-04 02:57:32,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:57:32,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i[4494,4507] [2025-03-04 02:57:32,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i[4554,4567] [2025-03-04 02:57:32,783 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,784 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,784 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,784 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,785 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,795 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,795 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,796 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,797 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,798 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,798 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,798 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:32,798 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i[150488,150501] [2025-03-04 02:57:33,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:33,100 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:57:33,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i[4494,4507] [2025-03-04 02:57:33,111 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i[4554,4567] [2025-03-04 02:57:33,154 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,155 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,155 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,155 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,156 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,164 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,165 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,165 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,165 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,166 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,166 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,166 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,167 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-04 02:57:33,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness_negated.i[150488,150501] [2025-03-04 02:57:33,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:57:33,378 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:57:33,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33 WrapperNode [2025-03-04 02:57:33,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:57:33,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:33,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:57:33,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:57:33,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,452 INFO L138 Inliner]: procedures = 668, calls = 1034, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 89 [2025-03-04 02:57:33,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:57:33,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:57:33,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:57:33,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:57:33,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,482 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-03-04 02:57:33,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,495 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:57:33,508 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:57:33,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:57:33,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:57:33,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (1/1) ... [2025-03-04 02:57:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:57:33,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:33,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:57:33,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:57:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2025-03-04 02:57:33,565 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 02:57:33,565 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:33,565 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-03-04 02:57:33,565 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:57:33,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-03-04 02:57:33,565 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 02:57:33,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 02:57:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 02:57:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 02:57:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:57:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:57:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:57:33,708 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:57:33,710 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:57:33,750 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-03-04 02:57:33,871 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-03-04 02:57:33,881 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-03-04 02:57:33,897 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2025-03-04 02:57:33,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:57:33,904 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:57:33,905 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:57:33,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:33 BoogieIcfgContainer [2025-03-04 02:57:33,905 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:57:33,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:57:33,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:57:33,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:57:33,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:57:32" (1/3) ... [2025-03-04 02:57:33,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d89aa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:33, skipping insertion in model container [2025-03-04 02:57:33,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:57:33" (2/3) ... [2025-03-04 02:57:33,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d89aa2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:57:33, skipping insertion in model container [2025-03-04 02:57:33,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:33" (3/3) ... [2025-03-04 02:57:33,913 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness_negated.i [2025-03-04 02:57:33,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:57:33,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_init_harness_negated.i that has 7 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 02:57:33,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:57:33,972 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;@496a9f19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:57:33,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 02:57:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 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-03-04 02:57:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 02:57:33,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:33,981 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, 1] [2025-03-04 02:57:33,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:33,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:33,985 INFO L85 PathProgramCache]: Analyzing trace with hash 149093260, now seen corresponding path program 1 times [2025-03-04 02:57:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:33,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566806703] [2025-03-04 02:57:33,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:33,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:34,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:57:34,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:57:34,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:34,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:57:34,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566806703] [2025-03-04 02:57:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566806703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:34,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:34,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:57:34,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636064073] [2025-03-04 02:57:34,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:34,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:57:34,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:34,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:57:34,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:57:34,225 INFO L87 Difference]: Start difference. First operand has 62 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 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.5) internal successors, (21), 2 states have internal predecessors, (21), 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-03-04 02:57:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:34,239 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2025-03-04 02:57:34,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:57:34,242 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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 27 [2025-03-04 02:57:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:34,246 INFO L225 Difference]: With dead ends: 119 [2025-03-04 02:57:34,247 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 02:57:34,249 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-03-04 02:57:34,251 INFO L435 NwaCegarLoop]: 76 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, 76 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:34,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 02:57:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 02:57:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 02:57:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2025-03-04 02:57:34,279 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 27 [2025-03-04 02:57:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:34,280 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2025-03-04 02:57:34,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 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-03-04 02:57:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2025-03-04 02:57:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 02:57:34,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:34,282 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, 1] [2025-03-04 02:57:34,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:57:34,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:34,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:34,283 INFO L85 PathProgramCache]: Analyzing trace with hash 360444173, now seen corresponding path program 1 times [2025-03-04 02:57:34,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:34,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590045078] [2025-03-04 02:57:34,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:34,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:34,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:57:34,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:57:34,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:34,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:57:34,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:34,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590045078] [2025-03-04 02:57:34,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590045078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:34,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:34,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:57:34,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125817941] [2025-03-04 02:57:34,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:34,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:57:34,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:34,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:57:34,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:57:34,621 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-03-04 02:57:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:34,670 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2025-03-04 02:57:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:57:34,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 27 [2025-03-04 02:57:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:34,673 INFO L225 Difference]: With dead ends: 67 [2025-03-04 02:57:34,673 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 02:57:34,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:34,673 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:34,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 335 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 02:57:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-03-04 02:57:34,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-04 02:57:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-03-04 02:57:34,688 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 27 [2025-03-04 02:57:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:34,688 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-03-04 02:57:34,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-03-04 02:57:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-03-04 02:57:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 02:57:34,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:34,689 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, 1, 1] [2025-03-04 02:57:34,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:57:34,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:34,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash 955943814, now seen corresponding path program 1 times [2025-03-04 02:57:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:34,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141882132] [2025-03-04 02:57:34,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:34,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:57:34,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:57:34,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:34,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:57:34,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:34,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141882132] [2025-03-04 02:57:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141882132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:34,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 02:57:34,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268856672] [2025-03-04 02:57:34,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:34,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:57:34,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:34,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:57:34,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:57:34,873 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-03-04 02:57:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:34,999 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2025-03-04 02:57:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:57:34,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 28 [2025-03-04 02:57:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:35,000 INFO L225 Difference]: With dead ends: 121 [2025-03-04 02:57:35,000 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 02:57:35,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:35,001 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:35,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 367 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 02:57:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2025-03-04 02:57:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.25) internal successors, (55), 46 states have internal predecessors, (55), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-04 02:57:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2025-03-04 02:57:35,008 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 28 [2025-03-04 02:57:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:35,008 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2025-03-04 02:57:35,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-03-04 02:57:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2025-03-04 02:57:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 02:57:35,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:35,009 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, 1, 1, 1, 1] [2025-03-04 02:57:35,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:57:35,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:35,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash 959059630, now seen corresponding path program 1 times [2025-03-04 02:57:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:35,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389495748] [2025-03-04 02:57:35,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:35,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:35,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 02:57:35,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:57:35,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:35,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:57:35,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389495748] [2025-03-04 02:57:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389495748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:35,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:35,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:57:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457997020] [2025-03-04 02:57:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:35,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:35,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:35,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:35,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:35,206 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-03-04 02:57:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:35,355 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2025-03-04 02:57:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:57:35,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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 30 [2025-03-04 02:57:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:35,357 INFO L225 Difference]: With dead ends: 127 [2025-03-04 02:57:35,357 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 02:57:35,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 02:57:35,358 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:35,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 345 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 02:57:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-03-04 02:57:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 47 states have internal predecessors, (56), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-04 02:57:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-03-04 02:57:35,367 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 30 [2025-03-04 02:57:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:35,367 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-03-04 02:57:35,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-03-04 02:57:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-03-04 02:57:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 02:57:35,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:35,368 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, 1, 1, 1, 1, 1] [2025-03-04 02:57:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:57:35,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:35,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1029919960, now seen corresponding path program 1 times [2025-03-04 02:57:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439639981] [2025-03-04 02:57:35,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:35,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:57:35,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:57:35,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:35,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:57:35,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:35,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439639981] [2025-03-04 02:57:35,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439639981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:35,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:35,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:57:35,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200745125] [2025-03-04 02:57:35,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:35,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:35,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:35,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:35,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:35,617 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-03-04 02:57:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:35,754 INFO L93 Difference]: Finished difference Result 128 states and 157 transitions. [2025-03-04 02:57:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 31 [2025-03-04 02:57:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:35,756 INFO L225 Difference]: With dead ends: 128 [2025-03-04 02:57:35,756 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 02:57:35,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:57:35,757 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:35,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 411 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 02:57:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2025-03-04 02:57:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 48 states have internal predecessors, (57), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-04 02:57:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2025-03-04 02:57:35,766 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 31 [2025-03-04 02:57:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:35,766 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2025-03-04 02:57:35,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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-03-04 02:57:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2025-03-04 02:57:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 02:57:35,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:35,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:35,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:57:35,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:35,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:35,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1684418345, now seen corresponding path program 1 times [2025-03-04 02:57:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:35,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384770404] [2025-03-04 02:57:35,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:35,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 02:57:35,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 02:57:35,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:35,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:57:36,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:36,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384770404] [2025-03-04 02:57:36,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384770404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:36,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:36,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:57:36,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281327427] [2025-03-04 02:57:36,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:36,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:57:36,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:36,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:57:36,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:36,122 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:57:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:36,154 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2025-03-04 02:57:36,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:57:36,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-04 02:57:36,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:36,155 INFO L225 Difference]: With dead ends: 77 [2025-03-04 02:57:36,156 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 02:57:36,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:57:36,156 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:36,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 02:57:36,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2025-03-04 02:57:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-04 02:57:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-03-04 02:57:36,168 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 39 [2025-03-04 02:57:36,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:36,169 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-03-04 02:57:36,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 02:57:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-03-04 02:57:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 02:57:36,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:36,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:36,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:57:36,170 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:36,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:36,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1503669757, now seen corresponding path program 1 times [2025-03-04 02:57:36,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:36,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792973194] [2025-03-04 02:57:36,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:36,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:36,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 02:57:36,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 02:57:36,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:36,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:57:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792973194] [2025-03-04 02:57:36,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792973194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:57:36,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506606165] [2025-03-04 02:57:36,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:36,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:36,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:57:36,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:57:36,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:57:36,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 02:57:36,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 02:57:36,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:36,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:36,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 02:57:36,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:57:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:57:36,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 02:57:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506606165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 02:57:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-03-04 02:57:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128302707] [2025-03-04 02:57:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:57:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:36,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:57:36,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2025-03-04 02:57:36,808 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 02:57:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:36,879 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-03-04 02:57:36,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:57:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2025-03-04 02:57:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:36,881 INFO L225 Difference]: With dead ends: 79 [2025-03-04 02:57:36,881 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 02:57:36,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2025-03-04 02:57:36,882 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:36,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 493 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 02:57:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2025-03-04 02:57:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 50 states have internal predecessors, (59), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-03-04 02:57:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-03-04 02:57:36,893 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 41 [2025-03-04 02:57:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:36,893 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-03-04 02:57:36,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 02:57:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-03-04 02:57:36,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 02:57:36,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:36,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:36,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:57:37,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:57:37,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:37,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash 991707862, now seen corresponding path program 1 times [2025-03-04 02:57:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:37,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669392809] [2025-03-04 02:57:37,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:37,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:37,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:57:37,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:57:37,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:37,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:37,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:57:37,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:37,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669392809] [2025-03-04 02:57:37,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669392809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:37,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:37,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 02:57:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377940414] [2025-03-04 02:57:37,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:37,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:57:37,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:37,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:57:37,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:57:37,522 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 02:57:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:37,657 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2025-03-04 02:57:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:57:37,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2025-03-04 02:57:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:37,659 INFO L225 Difference]: With dead ends: 134 [2025-03-04 02:57:37,659 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 02:57:37,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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-03-04 02:57:37,660 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:37,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 312 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 02:57:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-03-04 02:57:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 54 states have internal predecessors, (63), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-04 02:57:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2025-03-04 02:57:37,669 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 43 [2025-03-04 02:57:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:37,669 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2025-03-04 02:57:37,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 02:57:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2025-03-04 02:57:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 02:57:37,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:37,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:37,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:57:37,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:37,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1085501481, now seen corresponding path program 1 times [2025-03-04 02:57:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:37,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560174966] [2025-03-04 02:57:37,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:37,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:37,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:57:37,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:57:37,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:37,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:57:38,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:38,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560174966] [2025-03-04 02:57:38,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560174966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:38,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:38,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 02:57:38,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882507047] [2025-03-04 02:57:38,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:38,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 02:57:38,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:38,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 02:57:38,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 02:57:38,045 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 02:57:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:38,226 INFO L93 Difference]: Finished difference Result 172 states and 214 transitions. [2025-03-04 02:57:38,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 02:57:38,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2025-03-04 02:57:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:38,227 INFO L225 Difference]: With dead ends: 172 [2025-03-04 02:57:38,228 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 02:57:38,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:57:38,228 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:38,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 413 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 02:57:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2025-03-04 02:57:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 69 states have internal predecessors, (85), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 02:57:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2025-03-04 02:57:38,241 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 43 [2025-03-04 02:57:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:38,241 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2025-03-04 02:57:38,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 02:57:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2025-03-04 02:57:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 02:57:38,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:38,242 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:38,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:57:38,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:38,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash -123887464, now seen corresponding path program 1 times [2025-03-04 02:57:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:38,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604044767] [2025-03-04 02:57:38,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:38,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:57:38,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:57:38,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:38,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:57:38,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604044767] [2025-03-04 02:57:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604044767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:38,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:57:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837622349] [2025-03-04 02:57:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:38,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:57:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:38,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:57:38,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:57:38,625 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 02:57:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:38,814 INFO L93 Difference]: Finished difference Result 202 states and 258 transitions. [2025-03-04 02:57:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 02:57:38,815 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2025-03-04 02:57:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:38,816 INFO L225 Difference]: With dead ends: 202 [2025-03-04 02:57:38,816 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 02:57:38,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 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-03-04 02:57:38,818 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:38,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 476 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 02:57:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2025-03-04 02:57:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 75 states have internal predecessors, (94), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 02:57:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2025-03-04 02:57:38,831 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 43 [2025-03-04 02:57:38,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:38,831 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2025-03-04 02:57:38,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 02:57:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2025-03-04 02:57:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 02:57:38,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:38,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:38,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:57:38,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:38,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash 569214233, now seen corresponding path program 1 times [2025-03-04 02:57:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:38,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976467099] [2025-03-04 02:57:38,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:38,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:57:38,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:57:38,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:38,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:57:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976467099] [2025-03-04 02:57:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976467099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:39,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:39,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 02:57:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300814329] [2025-03-04 02:57:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:39,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 02:57:39,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:39,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 02:57:39,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 02:57:39,068 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 02:57:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:39,204 INFO L93 Difference]: Finished difference Result 216 states and 280 transitions. [2025-03-04 02:57:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:57:39,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2025-03-04 02:57:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:39,206 INFO L225 Difference]: With dead ends: 216 [2025-03-04 02:57:39,206 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 02:57:39,206 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-03-04 02:57:39,207 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:39,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 478 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 02:57:39,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 02:57:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2025-03-04 02:57:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 75 states have internal predecessors, (94), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 02:57:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2025-03-04 02:57:39,219 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 43 [2025-03-04 02:57:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:39,219 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2025-03-04 02:57:39,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-04 02:57:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2025-03-04 02:57:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 02:57:39,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:39,220 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:39,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:57:39,220 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:39,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:39,220 INFO L85 PathProgramCache]: Analyzing trace with hash -734701544, now seen corresponding path program 1 times [2025-03-04 02:57:39,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:39,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688001070] [2025-03-04 02:57:39,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:39,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:39,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:57:39,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:57:39,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:39,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:57:39,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688001070] [2025-03-04 02:57:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688001070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:39,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:39,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:57:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755128648] [2025-03-04 02:57:39,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:39,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:57:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:39,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:57:39,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:57:39,269 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:39,291 INFO L93 Difference]: Finished difference Result 179 states and 232 transitions. [2025-03-04 02:57:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:57:39,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-03-04 02:57:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:39,293 INFO L225 Difference]: With dead ends: 179 [2025-03-04 02:57:39,293 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 02:57:39,293 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-03-04 02:57:39,294 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:39,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 02:57:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 02:57:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 73 states have internal predecessors, (90), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 02:57:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2025-03-04 02:57:39,304 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 43 [2025-03-04 02:57:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:39,304 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2025-03-04 02:57:39,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2025-03-04 02:57:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 02:57:39,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:39,305 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:39,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 02:57:39,305 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:39,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash -41599847, now seen corresponding path program 1 times [2025-03-04 02:57:39,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:39,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845671727] [2025-03-04 02:57:39,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:39,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:39,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:57:39,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:57:39,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:39,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:57:39,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:39,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845671727] [2025-03-04 02:57:39,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845671727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:39,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:39,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:57:39,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361522035] [2025-03-04 02:57:39,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:39,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:57:39,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:39,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:57:39,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:57:39,349 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:39,366 INFO L93 Difference]: Finished difference Result 177 states and 227 transitions. [2025-03-04 02:57:39,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:57:39,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-03-04 02:57:39,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:39,368 INFO L225 Difference]: With dead ends: 177 [2025-03-04 02:57:39,368 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 02:57:39,368 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-03-04 02:57:39,368 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:39,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 02:57:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 02:57:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 73 states have internal predecessors, (88), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 02:57:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2025-03-04 02:57:39,376 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 43 [2025-03-04 02:57:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:39,376 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2025-03-04 02:57:39,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 02:57:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2025-03-04 02:57:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 02:57:39,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:39,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:39,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 02:57:39,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:39,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:39,377 INFO L85 PathProgramCache]: Analyzing trace with hash 920014170, now seen corresponding path program 1 times [2025-03-04 02:57:39,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:39,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931892502] [2025-03-04 02:57:39,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:39,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:39,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 02:57:39,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 02:57:39,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:39,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:57:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 02:57:39,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:57:39,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931892502] [2025-03-04 02:57:39,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931892502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:57:39,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:57:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:57:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257057710] [2025-03-04 02:57:39,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:57:39,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:57:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:57:39,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:57:39,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:57:39,479 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 02:57:39,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 02:57:39,531 INFO L93 Difference]: Finished difference Result 196 states and 244 transitions. [2025-03-04 02:57:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:57:39,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 43 [2025-03-04 02:57:39,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 02:57:39,532 INFO L225 Difference]: With dead ends: 196 [2025-03-04 02:57:39,532 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 02:57:39,532 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-03-04 02:57:39,533 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 30 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 02:57:39,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 389 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 02:57:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 02:57:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 02:57:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 65 states have internal predecessors, (77), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-03-04 02:57:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2025-03-04 02:57:39,545 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 43 [2025-03-04 02:57:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 02:57:39,545 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2025-03-04 02:57:39,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 02:57:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2025-03-04 02:57:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 02:57:39,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 02:57:39,546 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:39,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 02:57:39,546 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:57:39,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:57:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash 732964713, now seen corresponding path program 1 times [2025-03-04 02:57:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:57:39,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27596367] [2025-03-04 02:57:39,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:57:39,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:57:39,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:57:39,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:57:39,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:39,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:57:39,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:57:39,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 02:57:39,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 02:57:39,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:57:39,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:57:39,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:57:39,611 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:57:39,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 02:57:39,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 02:57:39,615 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:57:39,646 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:57:39,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:57:39 BoogieIcfgContainer [2025-03-04 02:57:39,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:57:39,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:57:39,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:57:39,650 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:57:39,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:57:33" (3/4) ... [2025-03-04 02:57:39,651 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 02:57:39,695 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 21. [2025-03-04 02:57:39,738 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:57:39,738 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:57:39,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:57:39,739 INFO L158 Benchmark]: Toolchain (without parser) took 7556.40ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 117.6MB in the beginning and 341.1MB in the end (delta: -223.5MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2025-03-04 02:57:39,739 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:57:39,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1195.42ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 75.1MB in the end (delta: 42.5MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. [2025-03-04 02:57:39,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.40ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 69.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:57:39,739 INFO L158 Benchmark]: Boogie Preprocessor took 54.09ms. Allocated memory is still 167.8MB. Free memory was 69.8MB in the beginning and 66.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:57:39,740 INFO L158 Benchmark]: IcfgBuilder took 397.41ms. Allocated memory is still 167.8MB. Free memory was 66.7MB in the beginning and 120.8MB in the end (delta: -54.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:57:39,740 INFO L158 Benchmark]: TraceAbstraction took 5741.94ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 120.8MB in the beginning and 349.5MB in the end (delta: -228.7MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2025-03-04 02:57:39,740 INFO L158 Benchmark]: Witness Printer took 88.13ms. Allocated memory is still 444.6MB. Free memory was 349.5MB in the beginning and 341.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:57:39,741 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.29ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1195.42ms. Allocated memory is still 167.8MB. Free memory was 117.6MB in the beginning and 75.1MB in the end (delta: 42.5MB). Peak memory consumption was 102.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.40ms. Allocated memory is still 167.8MB. Free memory was 75.1MB in the beginning and 69.8MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.09ms. Allocated memory is still 167.8MB. Free memory was 69.8MB in the beginning and 66.7MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 397.41ms. Allocated memory is still 167.8MB. Free memory was 66.7MB in the beginning and 120.8MB in the end (delta: -54.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5741.94ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 120.8MB in the beginning and 349.5MB in the end (delta: -228.7MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * Witness Printer took 88.13ms. Allocated memory is still 444.6MB. Free memory was 349.5MB in the beginning and 341.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7355] CALL aws_linked_list_init_harness() [L7344] struct aws_linked_list list; VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7350] CALL aws_linked_list_init(&list) VAL [\old(list)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4771] CALL assume_abort_if_not((list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4771] RET assume_abort_if_not((list)) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4772] list->head.next = &list->tail [L4773-L4774] list->head.prev = ((void *)0) [L4776] list->tail.prev = &list->head [L4777-L4778] list->tail.next = ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4780] CALL, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4780] RET, EXPR aws_linked_list_is_valid(list) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4780] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 296 mSDsluCounter, 4880 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3933 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 990 IncrementalHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 947 mSDtfsCounter, 990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=10, InterpolantAutomatonStates: 110, 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, 14 MinimizatonAttempts, 114 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 607 NumberOfCodeBlocks, 607 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 1777 SizeOfPredicates, 1 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 43/44 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-04 02:57:39,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE