./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b9d976a5c157b7db1e6b0f8b3d73c13a2dd8a00281a198d3aafefb7aed58d842 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 07:16:25,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:16:25,778 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:16:25,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:16:25,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:16:25,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:16:25,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:16:25,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:16:25,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:16:25,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:16:25,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:16:25,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:16:25,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:16:25,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:16:25,813 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:16:25,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:16:25,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:16:25,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:16:25,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:16:25,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:16:25,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:16:25,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:16:25,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:16:25,814 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:16:25,814 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:16:25,814 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:16:25,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:16:25,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:16:25,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:16:25,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:16:25,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:16:25,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:16:25,815 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:16:25,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:16:25,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:16:25,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:16:25,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:16:25,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:16:25,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:16:25,816 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:16:25,816 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 -> b9d976a5c157b7db1e6b0f8b3d73c13a2dd8a00281a198d3aafefb7aed58d842 [2025-03-17 07:16:26,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:16:26,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:16:26,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:16:26,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:16:26,063 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:16:26,064 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_next_harness.i [2025-03-17 07:16:27,228 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4820dbd/987316eba27d4efda09f26f87cff4b0f/FLAGf3e6a3c12 [2025-03-17 07:16:27,624 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:16:27,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_next_harness.i [2025-03-17 07:16:27,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4820dbd/987316eba27d4efda09f26f87cff4b0f/FLAGf3e6a3c12 [2025-03-17 07:16:27,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb4820dbd/987316eba27d4efda09f26f87cff4b0f [2025-03-17 07:16:27,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:16:27,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:16:27,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:16:27,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:16:27,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:16:27,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:16:27" (1/1) ... [2025-03-17 07:16:27,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bddaa6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:27, skipping insertion in model container [2025-03-17 07:16:27,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:16:27" (1/1) ... [2025-03-17 07:16:27,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:16:28,063 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_next_harness.i[4494,4507] [2025-03-17 07:16:28,071 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_next_harness.i[4554,4567] [2025-03-17 07:16:28,574 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,575 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,575 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,575 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,576 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,584 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,584 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,585 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,586 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,587 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,588 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,588 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,588 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,880 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_next_harness.i[150474,150487] [2025-03-17 07:16:28,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:16:28,897 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:16:28,909 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_next_harness.i[4494,4507] [2025-03-17 07:16:28,909 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_next_harness.i[4554,4567] [2025-03-17 07:16:28,949 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,950 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,950 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,950 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,952 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,964 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,965 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,965 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,965 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,966 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,966 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:28,968 WARN L1731 CHandler]: Possible shadowing of function index [2025-03-17 07:16:29,035 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_next_harness.i[150474,150487] [2025-03-17 07:16:29,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:16:29,149 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:16:29,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29 WrapperNode [2025-03-17 07:16:29,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:16:29,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:16:29,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:16:29,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:16:29,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,245 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 51, calls inlined = 4, statements flattened = 56 [2025-03-17 07:16:29,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:16:29,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:16:29,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:16:29,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:16:29,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,269 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 6, 4]. 35 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 2 writes are split as follows [0, 0, 1, 1]. [2025-03-17 07:16:29,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:16:29,297 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:16:29,297 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:16:29,297 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:16:29,298 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (1/1) ... [2025-03-17 07:16:29,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:16:29,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:29,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 07:16:29,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 07:16:29,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:16:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 07:16:29,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 07:16:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:16:29,343 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-03-17 07:16:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:16:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 07:16:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 07:16:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 07:16:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 07:16:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:16:29,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:16:29,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 07:16:29,343 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-03-17 07:16:29,344 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 07:16:29,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 07:16:29,503 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:16:29,505 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:16:29,554 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4720: havoc #t~mem308.base, #t~mem308.offset;havoc #t~short309;havoc #t~mem310.base, #t~mem310.offset;havoc #t~mem311.base, #t~mem311.offset;havoc #t~short312; [2025-03-17 07:16:29,576 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4731: havoc #t~mem313.base, #t~mem313.offset;havoc #t~short314;havoc #t~mem315.base, #t~mem315.offset;havoc #t~mem316.base, #t~mem316.offset;havoc #t~short317; [2025-03-17 07:16:29,646 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-17 07:16:29,646 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:16:29,653 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:16:29,653 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:16:29,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:16:29 BoogieIcfgContainer [2025-03-17 07:16:29,654 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:16:29,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:16:29,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:16:29,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:16:29,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:16:27" (1/3) ... [2025-03-17 07:16:29,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef75baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:16:29, skipping insertion in model container [2025-03-17 07:16:29,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:29" (2/3) ... [2025-03-17 07:16:29,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef75baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:16:29, skipping insertion in model container [2025-03-17 07:16:29,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:16:29" (3/3) ... [2025-03-17 07:16:29,661 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2025-03-17 07:16:29,672 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:16:29,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_next_harness.i that has 5 procedures, 46 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-17 07:16:29,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:16:29,720 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;@3daa3c84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:16:29,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:16:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 07:16:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 07:16:29,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:29,729 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:29,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:29,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1932416387, now seen corresponding path program 1 times [2025-03-17 07:16:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39508408] [2025-03-17 07:16:29,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:29,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 07:16:29,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 07:16:29,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:29,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 07:16:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39508408] [2025-03-17 07:16:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39508408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:30,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 07:16:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267323151] [2025-03-17 07:16:30,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:30,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 07:16:30,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:30,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 07:16:30,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 07:16:30,043 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 07:16:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:30,056 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2025-03-17 07:16:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 07:16:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-17 07:16:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:30,065 INFO L225 Difference]: With dead ends: 87 [2025-03-17 07:16:30,065 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 07:16:30,068 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-17 07:16:30,071 INFO L435 NwaCegarLoop]: 57 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, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:30,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 07:16:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-17 07:16:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 07:16:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-03-17 07:16:30,102 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 27 [2025-03-17 07:16:30,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:30,103 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-17 07:16:30,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 07:16:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-03-17 07:16:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 07:16:30,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:30,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:30,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 07:16:30,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:30,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1421882210, now seen corresponding path program 1 times [2025-03-17 07:16:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:30,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358226305] [2025-03-17 07:16:30,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:30,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 07:16:30,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 07:16:30,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:30,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:31,322 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 07:16:31,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:31,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358226305] [2025-03-17 07:16:31,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358226305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:31,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:31,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 07:16:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148494882] [2025-03-17 07:16:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:31,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:16:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:31,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:16:31,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:16:31,324 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 07:16:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:31,530 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2025-03-17 07:16:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:16:31,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-17 07:16:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:31,532 INFO L225 Difference]: With dead ends: 54 [2025-03-17 07:16:31,532 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 07:16:31,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 07:16:31,533 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:31,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 296 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 07:16:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 07:16:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-03-17 07:16:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-17 07:16:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-03-17 07:16:31,540 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 27 [2025-03-17 07:16:31,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:31,540 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-03-17 07:16:31,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 07:16:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-03-17 07:16:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 07:16:31,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:31,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:31,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:16:31,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:31,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:31,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1130274751, now seen corresponding path program 1 times [2025-03-17 07:16:31,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:31,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117479009] [2025-03-17 07:16:31,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:31,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:31,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 07:16:31,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 07:16:31,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:31,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 07:16:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:31,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117479009] [2025-03-17 07:16:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117479009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:31,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:31,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 07:16:31,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678528027] [2025-03-17 07:16:31,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:31,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:16:31,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:31,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:16:31,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:16:31,753 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 07:16:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:31,866 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2025-03-17 07:16:31,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:16:31,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-17 07:16:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:31,867 INFO L225 Difference]: With dead ends: 105 [2025-03-17 07:16:31,867 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 07:16:31,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:16:31,868 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:31,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 191 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 07:16:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 07:16:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 38 states have internal predecessors, (41), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-17 07:16:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2025-03-17 07:16:31,877 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 27 [2025-03-17 07:16:31,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:31,877 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2025-03-17 07:16:31,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 07:16:31,877 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2025-03-17 07:16:31,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 07:16:31,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:31,878 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] [2025-03-17 07:16:31,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 07:16:31,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:31,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:31,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1326788256, now seen corresponding path program 1 times [2025-03-17 07:16:31,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:31,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874136937] [2025-03-17 07:16:31,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:31,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:31,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 07:16:31,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 07:16:31,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:31,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 07:16:31,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:31,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874136937] [2025-03-17 07:16:31,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874136937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:31,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:31,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:16:31,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134356279] [2025-03-17 07:16:31,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:31,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:16:31,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:31,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:16:31,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:16:31,971 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 07:16:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:32,001 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2025-03-17 07:16:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:16:32,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-03-17 07:16:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:32,003 INFO L225 Difference]: With dead ends: 112 [2025-03-17 07:16:32,003 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 07:16:32,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:16:32,004 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:32,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 145 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 07:16:32,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2025-03-17 07:16:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 07:16:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-03-17 07:16:32,016 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 27 [2025-03-17 07:16:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:32,016 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-17 07:16:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 07:16:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-03-17 07:16:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 07:16:32,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:32,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:32,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 07:16:32,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:32,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash -3037131, now seen corresponding path program 1 times [2025-03-17 07:16:32,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:32,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540963283] [2025-03-17 07:16:32,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:32,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 07:16:32,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 07:16:32,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:32,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 07:16:33,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:33,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540963283] [2025-03-17 07:16:33,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540963283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:33,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101818220] [2025-03-17 07:16:33,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:33,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:33,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:33,040 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:16:33,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 07:16:33,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 07:16:33,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 07:16:33,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:33,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:33,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-17 07:16:33,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:33,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 07:16:33,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 07:16:33,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 07:16:33,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 07:16:34,472 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-17 07:16:34,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 87 [2025-03-17 07:16:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 07:16:34,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 07:16:34,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101818220] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:34,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 07:16:34,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17, 14] total 35 [2025-03-17 07:16:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495569376] [2025-03-17 07:16:34,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:34,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 07:16:34,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:34,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 07:16:34,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 07:16:34,951 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 07:16:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:35,210 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2025-03-17 07:16:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 07:16:35,211 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-03-17 07:16:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:35,212 INFO L225 Difference]: With dead ends: 63 [2025-03-17 07:16:35,212 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 07:16:35,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=1281, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 07:16:35,213 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 11 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:35,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 328 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 07:16:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 07:16:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-17 07:16:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-17 07:16:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-03-17 07:16:35,227 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 41 [2025-03-17 07:16:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:35,227 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-03-17 07:16:35,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 07:16:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-03-17 07:16:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 07:16:35,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:35,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:35,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 07:16:35,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:35,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:35,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:35,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1739773204, now seen corresponding path program 1 times [2025-03-17 07:16:35,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:35,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000882401] [2025-03-17 07:16:35,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:35,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 07:16:35,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 07:16:35,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:35,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 07:16:35,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:35,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000882401] [2025-03-17 07:16:35,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000882401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:35,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:35,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:16:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454291075] [2025-03-17 07:16:35,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:35,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:16:35,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:35,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:16:35,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:16:35,793 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 07:16:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:35,930 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2025-03-17 07:16:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:16:35,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-03-17 07:16:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:35,931 INFO L225 Difference]: With dead ends: 104 [2025-03-17 07:16:35,931 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 07:16:35,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 07:16:35,932 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:35,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 245 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 07:16:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 07:16:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 46 states have internal predecessors, (49), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-17 07:16:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2025-03-17 07:16:35,945 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 41 [2025-03-17 07:16:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:35,945 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2025-03-17 07:16:35,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 07:16:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2025-03-17 07:16:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 07:16:35,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:35,947 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:35,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 07:16:35,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:35,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:35,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1543259699, now seen corresponding path program 1 times [2025-03-17 07:16:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688323875] [2025-03-17 07:16:35,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:35,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 07:16:35,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 07:16:35,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:35,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 07:16:36,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:36,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688323875] [2025-03-17 07:16:36,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688323875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:36,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:36,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:16:36,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512317672] [2025-03-17 07:16:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:36,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:16:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:36,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:16:36,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:16:36,070 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 07:16:36,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:36,119 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2025-03-17 07:16:36,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:16:36,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2025-03-17 07:16:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:36,120 INFO L225 Difference]: With dead ends: 116 [2025-03-17 07:16:36,120 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 07:16:36,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:16:36,121 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:36,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 227 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 07:16:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2025-03-17 07:16:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.175) internal successors, (47), 43 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-17 07:16:36,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-03-17 07:16:36,127 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 41 [2025-03-17 07:16:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:36,127 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-03-17 07:16:36,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 07:16:36,128 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-03-17 07:16:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 07:16:36,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:36,132 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:36,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 07:16:36,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:36,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash -792529683, now seen corresponding path program 1 times [2025-03-17 07:16:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:36,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042394617] [2025-03-17 07:16:36,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:36,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 07:16:36,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 07:16:36,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:36,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 07:16:36,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:36,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042394617] [2025-03-17 07:16:36,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042394617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:36,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:36,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:16:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282429208] [2025-03-17 07:16:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:36,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:16:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:36,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:16:36,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:16:36,271 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 07:16:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:36,326 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-03-17 07:16:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 07:16:36,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2025-03-17 07:16:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:36,328 INFO L225 Difference]: With dead ends: 67 [2025-03-17 07:16:36,330 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 07:16:36,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:16:36,331 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:36,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 229 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:36,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 07:16:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 07:16:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-17 07:16:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2025-03-17 07:16:36,338 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 47 [2025-03-17 07:16:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:36,338 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2025-03-17 07:16:36,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 07:16:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2025-03-17 07:16:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 07:16:36,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:36,339 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:36,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 07:16:36,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:36,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash -941037529, now seen corresponding path program 1 times [2025-03-17 07:16:36,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:36,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601388068] [2025-03-17 07:16:36,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:36,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 07:16:36,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 07:16:36,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:36,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 07:16:36,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:36,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601388068] [2025-03-17 07:16:36,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601388068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:36,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:36,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 07:16:36,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316193767] [2025-03-17 07:16:36,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:36,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 07:16:36,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:36,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 07:16:36,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:16:36,894 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 07:16:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:37,040 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-03-17 07:16:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 07:16:37,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-03-17 07:16:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:37,041 INFO L225 Difference]: With dead ends: 76 [2025-03-17 07:16:37,041 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 07:16:37,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 07:16:37,042 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:37,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 286 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 07:16:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-03-17 07:16:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-17 07:16:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-03-17 07:16:37,049 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 61 [2025-03-17 07:16:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:37,049 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-03-17 07:16:37,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 07:16:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-03-17 07:16:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 07:16:37,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:37,050 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:37,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 07:16:37,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:37,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash 801772806, now seen corresponding path program 1 times [2025-03-17 07:16:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:37,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141493293] [2025-03-17 07:16:37,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:37,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 07:16:37,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 07:16:37,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:37,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 07:16:37,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:37,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141493293] [2025-03-17 07:16:37,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141493293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:37,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:37,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 07:16:37,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809930585] [2025-03-17 07:16:37,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:37,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:16:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:37,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:16:37,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:16:37,236 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 07:16:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:37,347 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2025-03-17 07:16:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:16:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-03-17 07:16:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:37,348 INFO L225 Difference]: With dead ends: 100 [2025-03-17 07:16:37,348 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 07:16:37,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:16:37,349 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:37,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 158 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 07:16:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-17 07:16:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.125) internal successors, (54), 52 states have internal predecessors, (54), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2025-03-17 07:16:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2025-03-17 07:16:37,356 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 61 [2025-03-17 07:16:37,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:37,357 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2025-03-17 07:16:37,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 07:16:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2025-03-17 07:16:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 07:16:37,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:37,357 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:37,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 07:16:37,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:37,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:37,358 INFO L85 PathProgramCache]: Analyzing trace with hash 605259301, now seen corresponding path program 1 times [2025-03-17 07:16:37,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:37,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784288549] [2025-03-17 07:16:37,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:37,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:37,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 07:16:37,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 07:16:37,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:37,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 07:16:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784288549] [2025-03-17 07:16:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784288549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:37,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:37,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:16:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796718883] [2025-03-17 07:16:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:37,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:16:37,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:37,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:16:37,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:16:37,470 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 07:16:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:37,489 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2025-03-17 07:16:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:16:37,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2025-03-17 07:16:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:37,491 INFO L225 Difference]: With dead ends: 101 [2025-03-17 07:16:37,491 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 07:16:37,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:16:37,491 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:37,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 186 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 07:16:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 07:16:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2025-03-17 07:16:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2025-03-17 07:16:37,508 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 61 [2025-03-17 07:16:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:37,508 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2025-03-17 07:16:37,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-17 07:16:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2025-03-17 07:16:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 07:16:37,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:37,509 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:37,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 07:16:37,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:37,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:37,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1522262138, now seen corresponding path program 1 times [2025-03-17 07:16:37,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:37,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333408562] [2025-03-17 07:16:37,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:37,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:37,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 07:16:37,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 07:16:37,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:37,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-17 07:16:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333408562] [2025-03-17 07:16:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333408562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 07:16:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293922103] [2025-03-17 07:16:38,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 07:16:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:16:38,649 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 07:16:38,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 07:16:38,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 07:16:38,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 07:16:38,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:38,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:38,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-03-17 07:16:38,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 07:16:38,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 07:16:38,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 07:16:38,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-17 07:16:38,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 07:16:40,787 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-17 07:16:40,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 87 [2025-03-17 07:16:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 07:16:40,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 07:16:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-17 07:16:41,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293922103] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 07:16:41,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 07:16:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 15] total 46 [2025-03-17 07:16:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872877870] [2025-03-17 07:16:41,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 07:16:41,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-17 07:16:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:41,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-17 07:16:41,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1904, Unknown=0, NotChecked=0, Total=2070 [2025-03-17 07:16:41,541 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 46 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 16 states have call successors, (30), 4 states have call predecessors, (30), 10 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2025-03-17 07:16:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:42,600 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-03-17 07:16:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 07:16:42,600 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 16 states have call successors, (30), 4 states have call predecessors, (30), 10 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) Word has length 75 [2025-03-17 07:16:42,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:42,601 INFO L225 Difference]: With dead ends: 75 [2025-03-17 07:16:42,601 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 07:16:42,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 109 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=239, Invalid=2841, Unknown=0, NotChecked=0, Total=3080 [2025-03-17 07:16:42,602 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:42,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 592 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 07:16:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 07:16:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-03-17 07:16:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 50 states have internal predecessors, (51), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-17 07:16:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2025-03-17 07:16:42,610 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 75 [2025-03-17 07:16:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:42,610 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2025-03-17 07:16:42,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 38 states have (on average 2.6052631578947367) internal successors, (99), 38 states have internal predecessors, (99), 16 states have call successors, (30), 4 states have call predecessors, (30), 10 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2025-03-17 07:16:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2025-03-17 07:16:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 07:16:42,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:42,611 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:42,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 07:16:42,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 07:16:42,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:42,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash 220548197, now seen corresponding path program 1 times [2025-03-17 07:16:42,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:42,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392495634] [2025-03-17 07:16:42,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:42,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:42,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 07:16:42,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 07:16:42,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:42,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 07:16:43,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:43,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392495634] [2025-03-17 07:16:43,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392495634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:43,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:43,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 07:16:43,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204909166] [2025-03-17 07:16:43,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:43,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 07:16:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:43,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 07:16:43,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:16:43,309 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 07:16:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:43,471 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2025-03-17 07:16:43,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 07:16:43,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 75 [2025-03-17 07:16:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:43,472 INFO L225 Difference]: With dead ends: 84 [2025-03-17 07:16:43,472 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 07:16:43,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 07:16:43,473 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 13 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:43,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 208 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 07:16:43,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 07:16:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 50 states have internal predecessors, (50), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-17 07:16:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-03-17 07:16:43,481 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 75 [2025-03-17 07:16:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:43,485 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-03-17 07:16:43,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 07:16:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-03-17 07:16:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 07:16:43,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:43,485 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:43,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 07:16:43,485 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:43,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash 24034692, now seen corresponding path program 1 times [2025-03-17 07:16:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:43,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886644603] [2025-03-17 07:16:43,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:43,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:43,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 07:16:43,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 07:16:43,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:43,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 07:16:43,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:43,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886644603] [2025-03-17 07:16:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886644603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:43,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:43,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:16:43,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880670814] [2025-03-17 07:16:43,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:43,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:16:43,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:43,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:16:43,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:16:43,669 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 07:16:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:43,721 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2025-03-17 07:16:43,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:16:43,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 75 [2025-03-17 07:16:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:43,722 INFO L225 Difference]: With dead ends: 85 [2025-03-17 07:16:43,722 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 07:16:43,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 07:16:43,723 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:43,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 256 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 07:16:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 07:16:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 07:16:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.0) internal successors, (40), 40 states have internal predecessors, (40), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 07:16:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2025-03-17 07:16:43,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 75 [2025-03-17 07:16:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:43,729 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2025-03-17 07:16:43,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 07:16:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2025-03-17 07:16:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 07:16:43,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:16:43,730 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:43,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 07:16:43,730 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:16:43,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:16:43,731 INFO L85 PathProgramCache]: Analyzing trace with hash -913101430, now seen corresponding path program 1 times [2025-03-17 07:16:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:16:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639165689] [2025-03-17 07:16:43,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:16:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:16:43,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 07:16:43,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 07:16:43,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:16:43,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:16:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 07:16:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:16:43,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639165689] [2025-03-17 07:16:43,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639165689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:16:43,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:16:43,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 07:16:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739574096] [2025-03-17 07:16:43,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:16:43,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 07:16:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:16:43,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 07:16:43,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 07:16:43,995 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-17 07:16:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:16:44,073 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2025-03-17 07:16:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 07:16:44,073 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 81 [2025-03-17 07:16:44,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:16:44,074 INFO L225 Difference]: With dead ends: 61 [2025-03-17 07:16:44,074 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 07:16:44,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:16:44,074 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 07:16:44,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 212 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 07:16:44,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 07:16:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 07:16:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 07:16:44,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 07:16:44,075 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2025-03-17 07:16:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:16:44,075 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 07:16:44,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-17 07:16:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 07:16:44,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 07:16:44,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 07:16:44,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 07:16:44,081 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:16:44,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 07:16:45,070 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 07:16:45,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 07:16:45 BoogieIcfgContainer [2025-03-17 07:16:45,074 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 07:16:45,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 07:16:45,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 07:16:45,075 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 07:16:45,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:16:29" (3/4) ... [2025-03-17 07:16:45,077 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 07:16:45,082 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2025-03-17 07:16:45,083 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2025-03-17 07:16:45,083 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 07:16:45,083 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 07:16:45,089 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-17 07:16:45,089 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 07:16:45,089 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 07:16:45,089 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 07:16:45,155 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 07:16:45,155 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 07:16:45,155 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 07:16:45,156 INFO L158 Benchmark]: Toolchain (without parser) took 17360.14ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 106.4MB in the beginning and 309.0MB in the end (delta: -202.6MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2025-03-17 07:16:45,156 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 07:16:45,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1353.35ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 49.5MB in the end (delta: 56.9MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2025-03-17 07:16:45,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.12ms. Allocated memory is still 142.6MB. Free memory was 49.5MB in the beginning and 101.6MB in the end (delta: -52.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2025-03-17 07:16:45,156 INFO L158 Benchmark]: Boogie Preprocessor took 46.10ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 98.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 07:16:45,156 INFO L158 Benchmark]: IcfgBuilder took 357.14ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 77.2MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 07:16:45,156 INFO L158 Benchmark]: TraceAbstraction took 15418.68ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 77.2MB in the beginning and 313.1MB in the end (delta: -235.9MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. [2025-03-17 07:16:45,157 INFO L158 Benchmark]: Witness Printer took 80.60ms. Allocated memory is still 444.6MB. Free memory was 313.1MB in the beginning and 309.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 07:16:45,158 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.21ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1353.35ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 49.5MB in the end (delta: 56.9MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.12ms. Allocated memory is still 142.6MB. Free memory was 49.5MB in the beginning and 101.6MB in the end (delta: -52.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.10ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 98.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 357.14ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 77.2MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15418.68ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 77.2MB in the beginning and 313.1MB in the end (delta: -235.9MB). Peak memory consumption was 190.6MB. Max. memory is 16.1GB. * Witness Printer took 80.60ms. Allocated memory is still 444.6MB. Free memory was 313.1MB in the beginning and 309.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 71 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 122 mSDsluCounter, 3616 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2878 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2217 IncrementalHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 738 mSDtfsCounter, 2217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 197 SyntacticMatches, 21 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=9, InterpolantAutomatonStates: 126, 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, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 883 NumberOfCodeBlocks, 883 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 980 ConstructedInterpolants, 95 QuantifiedInterpolants, 11069 SizeOfPredicates, 31 NumberOfNonLiveVariables, 594 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 548/583 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 07:16:45,171 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 Result: TRUE